diff --git a/node_modules/@codemirror/autocomplete/.github/workflows/dispatch.yml b/node_modules/@codemirror/autocomplete/.github/workflows/dispatch.yml new file mode 100644 index 0000000000..d05007201d --- /dev/null +++ b/node_modules/@codemirror/autocomplete/.github/workflows/dispatch.yml @@ -0,0 +1,16 @@ +name: Trigger CI +on: push + +jobs: + build: + name: Dispatch to main repo + runs-on: ubuntu-latest + steps: + - name: Emit repository_dispatch + uses: mvasigh/dispatch-action@main + with: + # You should create a personal access token and store it in your repository + token: ${{ secrets.DISPATCH_AUTH }} + repo: dev + owner: codemirror + event_type: push diff --git a/node_modules/@codemirror/autocomplete/CHANGELOG.md b/node_modules/@codemirror/autocomplete/CHANGELOG.md new file mode 100644 index 0000000000..d10e889189 --- /dev/null +++ b/node_modules/@codemirror/autocomplete/CHANGELOG.md @@ -0,0 +1,280 @@ +## 6.0.1 (2022-06-09) + +### Bug fixes + +Support escaping `${` or `#{` in snippets. + +## 6.0.0 (2022-06-08) + +### Bug fixes + +Scroll the cursor into view when inserting a snippet. + +## 0.20.3 (2022-05-30) + +### Bug fixes + +Add an aria-label to the completion listbox. + +Fix a regression that caused transactions generated for completion to not have a `userEvent` annotation. + +## 0.20.2 (2022-05-24) + +### New features + +The package now exports an `insertCompletionText` helper that implements the default behavior for applying a completion. + +## 0.20.1 (2022-05-16) + +### New features + +The new `closeOnBlur` option determines whether the completion tooltip is closed when the editor loses focus. + +`CompletionResult` objects with `filter: false` may now have a `getMatch` property that determines the matched range in the options. + +## 0.20.0 (2022-04-20) + +### Breaking changes + +`CompletionResult.span` has been renamed to `validFor`, and may now hold a function as well as a regular expression. + +### Bug fixes + +Remove code that dropped any options beyond the 300th one when matching and sorting option lists. + +Completion will now apply to all cursors when there are multiple cursors. + +### New features + +`CompletionResult.update` can now be used to implement quick autocompletion updates in a synchronous way. + +The @codemirror/closebrackets package was merged into this one. + +## 0.19.15 (2022-03-23) + +### New features + +The `selectedCompletionIndex` function tells you the position of the currently selected completion. + +The new `setSelectionCompletion` function creates a state effect that moves the selected completion to a given index. + +A completion's `info` method may now return null to indicate that no further info is available. + +## 0.19.14 (2022-03-10) + +### Bug fixes + +Make the ARIA attributes added to the editor during autocompletion spec-compliant. + +## 0.19.13 (2022-02-18) + +### Bug fixes + +Fix an issue where the completion tooltip stayed open if it was explicitly opened and the user backspaced past its start. + +Stop snippet filling when a change happens across one of the snippet fields' boundaries. + +## 0.19.12 (2022-01-11) + +### Bug fixes + +Fix completion navigation with PageUp/Down when the completion tooltip isn't part of the view DOM. + +## 0.19.11 (2022-01-11) + +### Bug fixes + +Fix a bug that caused page up/down to only move the selection by two options in the completion tooltip. + +## 0.19.10 (2022-01-05) + +### Bug fixes + +Make sure the info tooltip is hidden when the selected option is scrolled out of view. + +Fix a bug in the completion ranking that would sometimes give options that match the input by word start chars higher scores than appropriate. + +Options are now sorted (ascending) by length when their match score is otherwise identical. + +## 0.19.9 (2021-11-26) + +### Bug fixes + +Fix an issue where info tooltips would be visible in an inappropriate position when there was no room to place them properly. + +## 0.19.8 (2021-11-17) + +### Bug fixes + +Give the completion tooltip a minimal width, and show ellipsis when completions overflow the tooltip width. + +### New features + +`autocompletion` now accepts an `aboveCursor` option to make the completion tooltip show up above the cursor. + +## 0.19.7 (2021-11-16) + +### Bug fixes + +Make option deduplication less aggressive, so that options with different `type` or `apply` fields don't get merged. + +## 0.19.6 (2021-11-12) + +### Bug fixes + +Fix an issue where parsing a snippet with a field that was labeled only by a number crashed. + +## 0.19.5 (2021-11-09) + +### Bug fixes + +Make sure info tooltips don't stick out of the bottom of the page. + +### New features + +The package exports a new function `selectedCompletion`, which can be used to find out which completion is currently selected. + +Transactions created by picking a completion now have an annotation (`pickedCompletion`) holding the original completion. + +## 0.19.4 (2021-10-24) + +### Bug fixes + +Don't rely on the platform's highlight colors for the active completion, since those are inconsistent and may not be appropriate for the theme. + +Fix incorrect match underline for some kinds of matched completions. + +## 0.19.3 (2021-08-31) + +### Bug fixes + +Improve the sorting of completions by using `localeCompare`. + +Fix reading of autocompletions in NVDA screen reader. + +### New features + +The new `icons` option can be used to turn off icons in the completion list. + +The `optionClass` option can now be used to add CSS classes to the options in the completion list. + +It is now possible to inject additional content into rendered completion options with the `addToOptions` configuration option. + +## 0.19.2 (2021-08-25) + +### Bug fixes + +Fix an issue where `completeAnyWord` would return results when there was no query and `explicit` was false. + +## 0.19.1 (2021-08-11) + +### Bug fixes + +Fix incorrect versions for @lezer dependencies. + +## 0.19.0 (2021-08-11) + +### Breaking changes + +Update dependencies to 0.19.0 + +## 0.18.8 (2021-06-30) + +### New features + +Add an `ifIn` helper function that constrains a completion source to only fire when in a given syntax node. Add support for unfiltered completions + +A completion result can now set a `filter: false` property to disable filtering and sorting of completions, when it already did so itself. + +## 0.18.7 (2021-06-14) + +### Bug fixes + +Don't treat continued completions when typing after an explicit completion as explicit. + +## 0.18.6 (2021-06-03) + +### Bug fixes + +Adding or reconfiguring completion sources will now cause them to be activated right away if a completion was active. + +### New features + +You can now specify multiple types in `Completion.type` by separating them by spaces. Small doc comment tweak for Completion.type + +## 0.18.5 (2021-04-23) + +### Bug fixes + +Fix a regression where snippet field selection didn't work with @codemirror/state 0.18.6. + +Fix a bug where snippet fields with different position numbers were inappropriately merged. + +## 0.18.4 (2021-04-20) + +### Bug fixes + +Fix a crash in Safari when moving the selection during composition. + +## 0.18.3 (2021-03-15) + +### Bug fixes + +Adjust to updated @codemirror/tooltip interface. + +## 0.18.2 (2021-03-14) + +### Bug fixes + +Fix unintended ES2020 output (the package contains ES6 code again). + +## 0.18.1 (2021-03-11) + +### Bug fixes + +Stop active completion when all sources resolve without producing any matches. + +### New features + +`Completion.info` may now return a promise. + +## 0.18.0 (2021-03-03) + +### Bug fixes + +Only preserve selected option across updates when it isn't the first option. + +## 0.17.4 (2021-01-18) + +### Bug fixes + +Fix a styling issue where the selection had become invisible inside snippet fields (when using `drawSelection`). + +### New features + +Snippet fields can now be selected with the pointing device (so that they are usable on touch devices). + +## 0.17.3 (2021-01-18) + +### Bug fixes + +Fix a bug where uppercase completions would be incorrectly matched against the typed input. + +## 0.17.2 (2021-01-12) + +### Bug fixes + +Don't bind Cmd-Space on macOS, since that already has a system default binding. Use Ctrl-Space for autocompletion. + +## 0.17.1 (2021-01-06) + +### New features + +The package now also exports a CommonJS module. + +## 0.17.0 (2020-12-29) + +### Breaking changes + +First numbered release. + diff --git a/node_modules/@codemirror/autocomplete/LICENSE b/node_modules/@codemirror/autocomplete/LICENSE new file mode 100644 index 0000000000..3af12e62d9 --- /dev/null +++ b/node_modules/@codemirror/autocomplete/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (C) 2018-2021 by Marijn Haverbeke and others + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/node_modules/@codemirror/autocomplete/README.md b/node_modules/@codemirror/autocomplete/README.md new file mode 100644 index 0000000000..64a605483e --- /dev/null +++ b/node_modules/@codemirror/autocomplete/README.md @@ -0,0 +1,18 @@ +# @codemirror/autocomplete [![NPM version](https://img.shields.io/npm/v/@codemirror/autocomplete.svg)](https://www.npmjs.org/package/@codemirror/autocomplete) + +[ [**WEBSITE**](https://codemirror.net/) | [**DOCS**](https://codemirror.net/docs/ref/#autocomplete) | [**ISSUES**](https://github.com/codemirror/dev/issues) | [**FORUM**](https://discuss.codemirror.net/c/next/) | [**CHANGELOG**](https://github.com/codemirror/autocomplete/blob/main/CHANGELOG.md) ] + +This package implements autocompletion for the +[CodeMirror](https://codemirror.net/) code editor. + +The [project page](https://codemirror.net/) has more information, a +number of [examples](https://codemirror.net/examples/) and the +[documentation](https://codemirror.net/docs/). + +This code is released under an +[MIT license](https://github.com/codemirror/autocomplete/tree/main/LICENSE). + +We aim to be an inclusive, welcoming community. To make that explicit, +we have a [code of +conduct](http://contributor-covenant.org/version/1/1/0/) that applies +to communication around the project. diff --git a/node_modules/@codemirror/autocomplete/dist/index.cjs b/node_modules/@codemirror/autocomplete/dist/index.cjs new file mode 100644 index 0000000000..6d8633a650 --- /dev/null +++ b/node_modules/@codemirror/autocomplete/dist/index.cjs @@ -0,0 +1,1787 @@ +'use strict'; + +Object.defineProperty(exports, '__esModule', { value: true }); + +var state = require('@codemirror/state'); +var view = require('@codemirror/view'); +var language = require('@codemirror/language'); + +/** +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) { + this.state = state; + this.pos = pos; + this.explicit = explicit; + /** + @internal + */ + this.abortListeners = []; + } + /** + Get the extent, content, and (if there is a token) type of the + token before `this.pos`. + */ + tokenBefore(types) { + let token = language.syntaxTree(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). + */ + addEventListener(type, listener) { + if (type == "abort" && this.abortListeners) + this.abortListeners.push(listener); + } +} +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 = language.syntaxTree(context.state).resolveInner(context.pos, -1); pos; pos = pos.parent) + if (nodes.indexOf(pos.name) > -1) + return source(context); + 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 = language.syntaxTree(context.state).resolveInner(context.pos, -1); pos; pos = pos.parent) + if (nodes.indexOf(pos.name) > -1) + return null; + return source(context); + }; +} +class Option { + constructor(completion, source, match) { + this.completion = completion; + this.source = source; + this.match = match; + } +} +function cur(state) { return state.selection.main.head; } +// 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 = 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$1, text, from, to) { + return Object.assign(Object.assign({}, state$1.changeByRange(range => { + if (range == state$1.selection.main) + return { + changes: { from: from, to: to, insert: text }, + range: state.EditorSelection.cursor(from + text.length) + }; + let len = to - from; + if (!range.empty || + len && state$1.sliceDoc(range.from - len, range.from) != state$1.sliceDoc(from, to)) + return { range }; + return { + changes: { from: range.from - len, to: range.from, insert: text }, + range: state.EditorSelection.cursor(range.from - len + text.length) + }; + })), { userEvent: "input.complete" }); +} +function applyCompletion(view, option) { + const apply = option.completion.apply || option.completion.label; + let result = option.source; + if (typeof apply == "string") + view.dispatch(insertCompletionText(view.state, apply, result.from, result.to)); + else + apply(view, option.completion, result.from, result.to); +} +const SourceCache = 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; +} + +// 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 = []; + for (let p = 0; p < pattern.length;) { + let char = state.codePointAt(pattern, p), size = state.codePointSize(char); + this.chars.push(char); + let part = pattern.slice(p, p + size), upper = part.toUpperCase(); + this.folded.push(state.codePointAt(upper == part ? part.toLowerCase() : upper, 0)); + p += size; + } + this.astral = pattern.length != this.chars.length; + } + // Matches a given word (completion) against the pattern (input). + // Will return null for no match, and otherwise an array that starts + // with the match score, followed by any number 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 [0]; + 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 = state.codePointAt(word, 0); + return first == chars[0] ? [0, 0, state.codePointSize(first)] + : first == folded[0] ? [-200 /* CaseFold */, 0, state.codePointSize(first)] : null; + } + let direct = word.indexOf(this.pattern); + if (direct == 0) + return [0, 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 = state.codePointAt(word, i); + if (next == chars[anyTo] || next == folded[anyTo]) + any[anyTo++] = i; + i += 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 /* NonWord */; i < e && byWordTo < len;) { + let next = 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 /* Lower */ : next >= 65 && next <= 90 ? 1 /* Upper */ : 0 /* NonWord */) + : ((ch = state.fromCodePoint(next)) != ch.toLowerCase() ? 1 /* Upper */ : ch != ch.toUpperCase() ? 2 /* Lower */ : 0 /* NonWord */); + if (!i || type == 1 /* Upper */ && hasLower || prevType == 0 /* NonWord */ && type != 0 /* NonWord */) { + if (chars[byWordTo] == next || (folded[byWordTo] == next && (byWordFolded = true))) + byWord[byWordTo++] = i; + else if (byWord.length) + wordAdjacent = false; + } + prevType = type; + i += state.codePointSize(next); + } + if (byWordTo == len && byWord[0] == 0 && wordAdjacent) + return this.result(-100 /* ByWord */ + (byWordFolded ? -200 /* CaseFold */ : 0), byWord, word); + if (adjacentTo == len && adjacentStart == 0) + return [-200 /* CaseFold */ - word.length, 0, adjacentEnd]; + if (direct > -1) + return [-700 /* NotStart */ - word.length, direct, direct + this.pattern.length]; + if (adjacentTo == len) + return [-200 /* CaseFold */ + -700 /* NotStart */ - word.length, adjacentStart, adjacentEnd]; + if (byWordTo == len) + return this.result(-100 /* ByWord */ + (byWordFolded ? -200 /* CaseFold */ : 0) + -700 /* NotStart */ + + (wordAdjacent ? 0 : -1100 /* Gap */), byWord, word); + return chars.length == 2 ? null : this.result((any[0] ? -700 /* NotStart */ : 0) + -200 /* CaseFold */ + -1100 /* Gap */, any, word); + } + result(score, positions, word) { + let result = [score - word.length], i = 1; + for (let pos of positions) { + let to = pos + (this.astral ? state.codePointSize(state.codePointAt(word, pos)) : 1); + if (i > 1 && result[i - 1] == pos) + result[i - 1] = to; + else { + result[i++] = pos; + result[i++] = to; + } + } + return result; + } +} + +const completionConfig = state.Facet.define({ + combine(configs) { + return state.combineConfig(configs, { + activateOnTyping: true, + override: null, + closeOnBlur: true, + maxRenderedOptions: 100, + defaultKeymap: true, + optionClass: () => "", + aboveCursor: false, + icons: true, + addToOptions: [] + }, { + defaultKeymap: (a, b) => a && b, + closeOnBlur: (a, b) => a && b, + icons: (a, b) => a && b, + optionClass: (a, b) => c => joinClass(a(c), b(c)), + addToOptions: (a, b) => a.concat(b) + }); + } +}); +function joinClass(a, b) { + return a ? b ? a + " " + b : a : b; +} + +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, match) { + let labelElt = document.createElement("span"); + labelElt.className = "cm-completionLabel"; + let { label } = completion, off = 0; + for (let j = 1; 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 <= (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) { + this.view = view; + this.stateField = stateField; + this.info = null; + this.placeInfo = { + read: () => this.measureInfo(), + write: (pos) => this.positionInfo(pos), + key: this + }; + 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.range = rangeAroundSelected(options.length, selected, config.maxRenderedOptions); + this.dom = document.createElement("div"); + this.dom.className = "cm-tooltip-autocomplete"; + this.dom.addEventListener("mousedown", (e) => { + 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) { + applyCompletion(view, options[+match[1]]); + e.preventDefault(); + return; + } + } + }); + this.list = this.dom.appendChild(this.createListBox(options, cState.id, this.range)); + this.list.addEventListener("scroll", () => { + if (this.info) + this.view.requestMeasure(this.placeInfo); + }); + } + mount() { this.updateSel(); } + update(update) { + if (update.state.field(this.stateField) != update.startState.field(this.stateField)) + this.updateSel(); + } + positioned() { + if (this.info) + this.view.requestMeasure(this.placeInfo); + } + updateSel() { + let cState = this.view.state.field(this.stateField), open = cState.open; + if (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.list.remove(); + this.list = this.dom.appendChild(this.createListBox(open.options, cState.id, this.range)); + this.list.addEventListener("scroll", () => { + if (this.info) + this.view.requestMeasure(this.placeInfo); + }); + } + if (this.updateSelectedOption(open.selected)) { + if (this.info) { + this.info.remove(); + this.info = null; + } + 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(node => { + if (node && this.view.state.field(this.stateField, false) == cState) + this.addInfoPane(node); + }).catch(e => view.logException(this.view.state, e, "completion info")); + } + else { + this.addInfoPane(infoResult); + } + } + } + addInfoPane(content) { + let dom = this.info = document.createElement("div"); + dom.className = "cm-tooltip cm-completionInfo"; + dom.appendChild(content); + this.dom.appendChild(dom); + this.view.requestMeasure(this.placeInfo); + } + updateSelectedOption(selected) { + let set = null; + for (let opt = this.list.firstChild, i = this.range.from; opt; opt = opt.nextSibling, i++) { + 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"); + } + } + 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(); + if (selRect.top > Math.min(innerHeight, listRect.bottom) - 10 || selRect.bottom < Math.max(0, listRect.top) + 10) + return null; + let top = Math.max(0, Math.min(selRect.top, innerHeight - infoRect.height)) - listRect.top; + let left = this.view.textDirection == view.Direction.RTL; + let spaceLeft = listRect.left, spaceRight = innerWidth - listRect.right; + if (left && spaceLeft < Math.min(infoRect.width, spaceRight)) + left = false; + else if (!left && spaceRight < Math.min(infoRect.width, spaceLeft)) + left = true; + return { top, left }; + } + positionInfo(pos) { + if (this.info) { + this.info.style.top = (pos ? pos.top : -1e6) + "px"; + if (pos) { + this.info.classList.toggle("cm-completionInfo-left", pos.left); + this.info.classList.toggle("cm-completionInfo-right", !pos.left); + } + } + } + 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")); + for (let i = range.from; i < range.to; i++) { + let { completion, match } = options[i]; + 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, 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; + } +} +// We allocate a new function instance every time the completion +// changes to force redrawing/repositioning of the tooltip +function completionTooltip(stateField) { + return (view) => new CompletionTooltip(view, stateField); +} +function scrollIntoView(container, element) { + let parent = container.getBoundingClientRect(); + let self = element.getBoundingClientRect(); + if (self.top < parent.top) + container.scrollTop -= parent.top - self.top; + else if (self.bottom > parent.bottom) + container.scrollTop += self.bottom - parent.bottom; +} + +// 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 = [], i = 0; + for (let a of active) + if (a.hasResult()) { + if (a.result.filter === false) { + let getMatch = a.result.getMatch; + for (let option of a.result.options) { + let match = [1e9 - i++]; + if (getMatch) + for (let n of getMatch(option)) + match.push(n); + options.push(new Option(option, a, match)); + } + } + else { + let matcher = new FuzzyMatcher(state.sliceDoc(a.from, a.to)), match; + for (let option of a.result.options) + if (match = matcher.match(option.label)) { + if (option.boost != null) + match[0] += option.boost; + options.push(new Option(option, a, match)); + } + } + } + let result = [], prev = null; + for (let opt of options.sort(cmpOption)) { + if (!prev || prev.label != opt.completion.label || prev.detail != opt.completion.detail || + (prev.type != null && opt.completion.type != null && prev.type != opt.completion.type) || + prev.apply != opt.completion.apply) + 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) { + this.options = options; + this.attrs = attrs; + this.tooltip = tooltip; + this.timestamp = timestamp; + this.selected = selected; + } + setSelected(selected, id) { + return selected == this.selected || selected >= this.options.length ? this + : new CompletionDialog(this.options, makeAttrs(id, selected), this.tooltip, this.timestamp, selected); + } + static build(active, state, id, prev, conf) { + let options = sortOptions(active, state); + if (!options.length) + return null; + let selected = 0; + if (prev && prev.selected) { + 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: completionTooltip(completionState), + above: conf.aboveCursor, + }, prev ? prev.timestamp : Date.now(), selected); + } + map(changes) { + return new CompletionDialog(this.options, this.attrs, Object.assign(Object.assign({}, this.tooltip), { pos: changes.mapPos(this.tooltip.pos) }), this.timestamp, this.selected); + } +} +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 /* Inactive */) ? 1 /* Pending */ : 0 /* 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 = tr.selection || active.some(a => a.hasResult() && tr.changes.touchesRange(a.from, a.to)) || + !sameResults(active, this.active) ? CompletionDialog.build(active, state, this.id, this.open, conf) + : this.open && tr.docChanged ? this.open.map(tr.changes) : this.open; + if (!open && active.every(a => a.state != 1 /* Pending */) && active.some(a => a.hasResult())) + active = active.map(a => a.hasResult() ? new ActiveSource(a.source, 0 /* 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 : baseAttrs; } +} +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" +}; +function makeAttrs(id, selected) { + return { + "aria-autocomplete": "list", + "aria-haspopup": "listbox", + "aria-activedescendant": id + "-" + selected, + "aria-controls": id + }; +} +const none = []; +function cmpOption(a, b) { + let dScore = b.match[0] - a.match[0]; + if (dScore) + return dScore; + return a.completion.label.localeCompare(b.completion.label); +} +function getUserEvent(tr) { + return tr.isUserEvent("input.type") ? "input" : tr.isUserEvent("delete.backward") ? "delete" : null; +} +class ActiveSource { + constructor(source, state, explicitPos = -1) { + this.source = source; + this.state = state; + this.explicitPos = explicitPos; + } + hasResult() { return false; } + update(tr, conf) { + let event = getUserEvent(tr), value = this; + if (event) + value = value.handleUserEvent(tr, event, conf); + else if (tr.docChanged) + value = value.handleChange(tr); + else if (tr.selection && value.state != 0 /* Inactive */) + value = new ActiveSource(value.source, 0 /* Inactive */); + for (let effect of tr.effects) { + if (effect.is(startCompletionEffect)) + value = new ActiveSource(value.source, 1 /* Pending */, effect.value ? cur(tr.state) : -1); + else if (effect.is(closeCompletionEffect)) + value = new ActiveSource(value.source, 0 /* Inactive */); + else if (effect.is(setActiveEffect)) + for (let active of effect.value) + if (active.source == value.source) + value = active; + } + return value; + } + handleUserEvent(tr, type, conf) { + return type == "delete" || !conf.activateOnTyping ? this.map(tr.changes) : new ActiveSource(this.source, 1 /* Pending */); + } + handleChange(tr) { + return tr.changes.touchesRange(cur(tr.startState)) ? new ActiveSource(this.source, 0 /* Inactive */) : this.map(tr.changes); + } + map(changes) { + return changes.empty || this.explicitPos < 0 ? this : new ActiveSource(this.source, this.state, changes.mapPos(this.explicitPos)); + } +} +class ActiveResult extends ActiveSource { + constructor(source, explicitPos, result, from, to) { + super(source, 2 /* Result */, explicitPos); + this.result = result; + this.from = from; + this.to = to; + } + hasResult() { return true; } + handleUserEvent(tr, type, conf) { + var _a; + let from = tr.changes.mapPos(this.from), to = tr.changes.mapPos(this.to, 1); + let pos = cur(tr.state); + if ((this.explicitPos < 0 ? pos <= from : pos < this.from) || + pos > to || + type == "delete" && cur(tr.startState) == this.from) + return new ActiveSource(this.source, type == "input" && conf.activateOnTyping ? 1 /* Pending */ : 0 /* Inactive */); + let explicitPos = this.explicitPos < 0 ? -1 : tr.changes.mapPos(this.explicitPos), updated; + if (checkValid(this.result.validFor, tr.state, from, to)) + return new ActiveResult(this.source, explicitPos, this.result, from, to); + if (this.result.update && + (updated = this.result.update(this.result, from, to, new CompletionContext(tr.state, pos, explicitPos >= 0)))) + return new ActiveResult(this.source, explicitPos, updated, updated.from, (_a = updated.to) !== null && _a !== void 0 ? _a : cur(tr.state)); + return new ActiveSource(this.source, 1 /* Pending */, explicitPos); + } + handleChange(tr) { + return tr.changes.touchesRange(this.from, this.to) ? new ActiveSource(this.source, 0 /* Inactive */) : this.map(tr.changes); + } + map(mapping) { + return mapping.empty ? this : + new ActiveResult(this.source, this.explicitPos < 0 ? -1 : mapping.mapPos(this.explicitPos), this.result, mapping.mapPos(this.from), mapping.mapPos(this.to, 1)); + } +} +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 startCompletionEffect = state.StateEffect.define(); +const closeCompletionEffect = state.StateEffect.define(); +const setActiveEffect = state.StateEffect.define({ + map(sources, mapping) { return sources.map(s => s.map(mapping)); } +}); +const setSelectedEffect = state.StateEffect.define(); +const completionState = 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) + ] +}); + +const CompletionInteractMargin = 75; +/** +Returns a command that moves the completion selection forward or +backward by the given amount. +*/ +function moveCompletionSelection(forward, by = "option") { + return (view$1) => { + let cState = view$1.state.field(completionState, false); + if (!cState || !cState.open || Date.now() - cState.open.timestamp < CompletionInteractMargin) + return false; + let step = 1, tooltip; + if (by == "page" && (tooltip = view.getTooltip(view$1, cState.open.tooltip))) + step = Math.max(2, Math.floor(tooltip.dom.offsetHeight / + tooltip.dom.querySelector("li").offsetHeight) - 1); + let selected = cState.open.selected + step * (forward ? 1 : -1), { length } = cState.open.options; + if (selected < 0) + selected = by == "page" ? 0 : length - 1; + else if (selected >= length) + selected = by == "page" ? length - 1 : 0; + view$1.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 || Date.now() - cState.open.timestamp < CompletionInteractMargin) + return false; + applyCompletion(view, cState.open.options[cState.open.selected]); + return true; +}; +/** +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 /* 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 DebounceTime = 50, MaxUpdateCount = 50, MinAbortTime = 1000; +const completionPlugin = view.ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.debounceUpdate = -1; + this.running = []; + this.debounceAccept = -1; + this.composing = 0 /* None */; + for (let active of view.state.field(completionState).active) + if (active.state == 1 /* Pending */) + this.startQuery(active); + } + update(update) { + let cState = update.state.field(completionState); + if (!update.selectionSet && !update.docChanged && update.startState.field(completionState) == cState) + return; + let doesReset = update.transactions.some(tr => { + return (tr.selection || tr.docChanged) && !getUserEvent(tr); + }); + for (let i = 0; i < this.running.length; i++) { + let query = this.running[i]; + if (doesReset || + query.updates.length + update.transactions.length > MaxUpdateCount && Date.now() - query.time > MinAbortTime) { + for (let handler of query.context.abortListeners) { + try { + handler(); + } + catch (e) { + 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); + this.debounceUpdate = cState.active.some(a => a.state == 1 /* Pending */ && !this.running.some(q => q.active.source == a.source)) + ? setTimeout(() => this.startUpdate(), DebounceTime) : -1; + if (this.composing != 0 /* None */) + for (let tr of update.transactions) { + if (getUserEvent(tr) == "input") + this.composing = 2 /* Changed */; + else if (this.composing == 2 /* Changed */ && tr.selection) + this.composing = 3 /* ChangedAndMoved */; + } + } + startUpdate() { + this.debounceUpdate = -1; + let { state } = this.view, cState = state.field(completionState); + for (let active of cState.active) { + if (active.state == 1 /* Pending */ && !this.running.some(r => r.active.source == active.source)) + this.startQuery(active); + } + } + startQuery(active) { + let { state } = this.view, pos = cur(state); + let context = new CompletionContext(state, pos, active.explicitPos == pos); + 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) }); + 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(), DebounceTime); + } + // 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); + 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 active = new ActiveResult(query.active.source, query.active.explicitPos, query.done, query.done.from, (_a = query.done.to) !== null && _a !== void 0 ? _a : cur(query.updates.length ? query.updates[0].startState : this.view.state)); + // 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 = this.view.state.field(completionState).active.find(a => a.source == query.active.source); + if (current && current.state == 1 /* Pending */) { + 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 /* Inactive */); + for (let tr of query.updates) + active = active.update(tr, conf); + if (active.state != 1 /* Pending */) + updated.push(active); + } + else { + // Cleared by subsequent transactions. Restart. + this.startQuery(current); + } + } + } + if (updated.length) + this.view.dispatch({ effects: setActiveEffect.of(updated) }); + } +}, { + eventHandlers: { + blur() { + let state = this.view.state.field(completionState, false); + if (state && state.tooltip && this.view.state.facet(completionConfig).closeOnBlur) + this.view.dispatch({ effects: closeCompletionEffect.of(null) }); + }, + compositionstart() { + this.composing = 1 /* Started */; + }, + compositionend() { + if (this.composing == 3 /* 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 /* None */; + } + } +}); + +const baseTheme = 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", + listStyle: "none", + margin: 0, + padding: 0, + "& > li": { + overflowX: "hidden", + textOverflow: "ellipsis", + cursor: "pointer", + padding: "1px 3px", + lineHeight: 1.2 + }, + } + }, + "&light .cm-tooltip-autocomplete ul li[aria-selected]": { + background: "#17c", + color: "white", + }, + "&dark .cm-tooltip-autocomplete ul li[aria-selected]": { + background: "#347", + color: "white", + }, + ".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: "300px", + }, + ".cm-completionInfo.cm-completionInfo-left": { right: "100%" }, + ".cm-completionInfo.cm-completionInfo-right": { left: "100%" }, + "&light .cm-snippetField": { backgroundColor: "#00000022" }, + "&dark .cm-snippetField": { backgroundColor: "#ffffff22" }, + ".cm-snippetFieldPosition": { + verticalAlign: "text-top", + width: 0, + height: "1.15em", + 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" + }, + ".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, state.MapMode.TrackDel); + let to = changes.mapPos(this.to, 1, state.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(language.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, name = m[2] || m[3] || "", found = -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++; + } + positions.push(new FieldPos(found, lines.length, m.index, m.index + name.length)); + line = line.slice(0, m.index) + name + line.slice(m.index + m[0].length); + } + for (let esc; esc = /([$#])\\{/.exec(line);) { + line = line.slice(0, esc.index) + esc[1] + "{" + line.slice(esc.index + esc[0].length); + for (let pos of positions) + if (pos.line == lines.length && pos.from > esc.index) { + pos.from--; + pos.to--; + } + } + lines.push(line); + } + return new Snippet(lines, positions); + } +} +let fieldMarker = view.Decoration.widget({ widget: new class extends view.WidgetType { + toDOM() { + let span = document.createElement("span"); + span.className = "cm-snippetFieldPosition"; + return span; + } + ignoreEvent() { return false; } + } }); +let fieldRange = 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))); + } + 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 = state.StateEffect.define({ + map(value, changes) { return value && value.map(changes); } +}); +const moveToField = state.StateEffect.define(); +const snippetState = 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 after the dollar or hash and before the brace (`$\\{`). +This will be removed and the sequence will not be interpreted as a +placeholder. +*/ +function snippet(template) { + let snippet = Snippet.parse(template); + return (editor, _completion, from, to) => { + let { text, ranges } = snippet.instantiate(editor.state, from); + let spec = { + changes: { from, to, insert: state.Text.of(text) }, + scrollIntoView: true + }; + if (ranges.length) + spec.selection = fieldSelection(ranges, 0); + if (ranges.length > 1) { + let active = new ActiveSnippet(ranges, 0); + let effects = spec.effects = [setActive.of(active)]; + if (editor.state.field(snippetState, false) === undefined) + effects.push(state.StateEffect.appendConfig.of([snippetState, addSnippetKeymap, snippetPointerHandler, 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)) + })); + 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 = moveField(1); +/** +Move to the previous snippet field, if available. +*/ +const prevSnippetField = moveField(-1); +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 = state.Facet.define({ + combine(maps) { return maps.length ? maps[0] : defaultSnippetKeymap; } +}); +const addSnippetKeymap = state.Prec.highest(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 Object.assign(Object.assign({}, completion), { apply: snippet(template) }); +} +const snippetPointerHandler = 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) + }); + 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 = 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 /* MaxList */) + return; + } + } + pos += value.length + 1; + } +} +function collectWords(doc, cache, wordRE, to, ignoreAt) { + let big = doc.length >= 1000 /* 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 /* 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 /* 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 /* Range */, from); + return { from, options, validFor: mapRE(re, s => "^" + s) }; +}; + +const defaults = { + brackets: ["(", "[", "{", "'", '"'], + before: ")]}:;>" +}; +const closeBracketEffect = state.StateEffect.define({ + map(value, mapping) { + let mapped = mapping.mapPos(value, -1, state.MapMode.TrackAfter); + return mapped == null ? undefined : mapped; + } +}); +const skipBracketEffect = state.StateEffect.define({ + map(value, mapping) { return mapping.mapPos(value); } +}); +const closedBracket = new class extends state.RangeValue { +}; +closedBracket.startSide = 1; +closedBracket.endSide = -1; +const bracketState = state.StateField.define({ + create() { return state.RangeSet.empty; }, + update(value, tr) { + if (tr.selection) { + let lineStart = tr.state.doc.lineAt(tr.selection.main.head).from; + let prevLineStart = tr.startState.doc.lineAt(tr.startState.selection.main.head).from; + if (lineStart != tr.changes.mapPos(prevLineStart, -1)) + value = state.RangeSet.empty; + } + value = value.map(tr.changes); + for (let effect of tr.effects) { + if (effect.is(closeBracketEffect)) + value = value.update({ add: [closedBracket.range(effect.value, effect.value + 1)] }); + else if (effect.is(skipBracketEffect)) + value = value.update({ filter: from => from != effect.value }); + } + 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 state.fromCodePoint(ch < 128 ? ch : ch + 1); +} +function config(state, pos) { + return state.languageDataAt("closeBrackets", pos)[0] || defaults; +} +const android = typeof navigator == "object" && /Android\b/.test(navigator.userAgent); +const inputHandler = 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 && state.codePointSize(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: state$1, dispatch }) => { + if (state$1.readOnly) + return false; + let conf = config(state$1, state$1.selection.main.head); + let tokens = conf.brackets || defaults.brackets; + let dont = null, changes = state$1.changeByRange(range => { + if (range.empty) { + let before = prevChar(state$1.doc, range.head); + for (let token of tokens) { + if (token == before && nextChar(state$1.doc, range.head) == closing(state.codePointAt(token, 0))) + return { changes: { from: range.head - token.length, to: range.head + token.length }, + range: state.EditorSelection.cursor(range.head - token.length), + userEvent: "delete.backward" }; + } + } + return { range: dont = range }; + }); + if (!dont) + dispatch(state$1.update(changes, { scrollIntoView: true })); + 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$1, bracket) { + let conf = config(state$1, state$1.selection.main.head); + let tokens = conf.brackets || defaults.brackets; + for (let tok of tokens) { + let closed = closing(state.codePointAt(tok, 0)); + if (bracket == tok) + return closed == tok ? handleSame(state$1, tok, tokens.indexOf(tok + tok + tok) > -1) + : handleOpen(state$1, tok, closed, conf.before || defaults.before); + if (bracket == closed && closedBracketAt(state$1, state$1.selection.main.from)) + return handleClose(state$1, 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, state.codePointSize(state.codePointAt(next, 0))); +} +function prevChar(doc, pos) { + let prev = doc.sliceString(pos - 2, pos); + return state.codePointSize(state.codePointAt(prev, 0)) == prev.length ? prev : prev.slice(1); +} +function handleOpen(state$1, open, close, closeBefore) { + let dont = null, changes = state$1.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$1.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$1.update(changes, { + scrollIntoView: true, + userEvent: "input.type" + }); +} +function handleClose(state$1, _open, close) { + let dont = null, moved = state$1.selection.ranges.map(range => { + if (range.empty && nextChar(state$1.doc, range.head) == close) + return state.EditorSelection.cursor(range.head + close.length); + return dont = range; + }); + return dont ? null : state$1.update({ + selection: state.EditorSelection.create(moved, state$1.selection.mainIndex), + scrollIntoView: true, + effects: state$1.selection.ranges.map(({ from }) => skipBracketEffect.of(from)) + }); +} +// Handles cases where the open and close token are the same, and +// possibly triple quotes (as in `"""abc"""`-style quoting). +function handleSame(state$1, token, allowTriple) { + let dont = null, changes = state$1.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$1.doc, pos); + if (next == token) { + if (nodeStart(state$1, 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$1, pos)) { + let isTriple = allowTriple && state$1.sliceDoc(pos, pos + token.length * 3) == token + token + token; + return { range: state.EditorSelection.cursor(pos + token.length * (isTriple ? 3 : 1)), + effects: skipBracketEffect.of(pos) }; + } + } + else if (allowTriple && state$1.sliceDoc(pos - 2 * token.length, pos) == token + token && + nodeStart(state$1, pos - 2 * token.length)) { + 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$1.charCategorizer(pos)(next) != state.CharCategory.Word) { + let prev = state$1.sliceDoc(pos - 1, pos); + if (prev != token && state$1.charCategorizer(pos)(prev) != state.CharCategory.Word && !probablyInString(state$1, pos, token)) + 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$1.update(changes, { + scrollIntoView: true, + userEvent: "input.type" + }); +} +function nodeStart(state, pos) { + let tree = language.syntaxTree(state).resolveInner(pos + 1); + return tree.parent && tree.from == pos; +} +function probablyInString(state, pos, quoteToken) { + let node = language.syntaxTree(state).resolveInner(pos, -1); + for (let i = 0; i < 5; i++) { + if (state.sliceDoc(node.from, node.from + quoteToken.length) == quoteToken) + return true; + let parent = node.to == pos && node.parent; + if (!parent) + break; + node = parent; + } + return false; +} + +/** +Returns an extension that enables autocompletion. +*/ +function autocompletion(config = {}) { + return [ + completionState, + completionConfig.of(config), + completionPlugin, + completionKeymapExt, + baseTheme + ]; +} +/** +Basic keybindings for autocompletion. + + - Ctrl-Space: [`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")` + - PageDown: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(true, "page")` + - Enter: [`acceptCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.acceptCompletion) +*/ +const completionKeymap = [ + { key: "Ctrl-Space", run: startCompletion }, + { key: "Escape", run: closeCompletion }, + { key: "ArrowDown", run: moveCompletionSelection(true) }, + { key: "ArrowUp", run: moveCompletionSelection(false) }, + { key: "PageDown", run: moveCompletionSelection(true, "page") }, + { key: "PageUp", run: moveCompletionSelection(false, "page") }, + { key: "Enter", run: acceptCompletion } +]; +const completionKeymapExt = state.Prec.highest(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.state == 1 /* Pending */) ? "pending" + : cState && cState.active.some(a => a.state != 0 /* Inactive */) ? "active" : null; +} +const completionArrayCache = 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) + 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.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.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); +} + +exports.CompletionContext = CompletionContext; +exports.acceptCompletion = acceptCompletion; +exports.autocompletion = autocompletion; +exports.clearSnippet = clearSnippet; +exports.closeBrackets = closeBrackets; +exports.closeBracketsKeymap = closeBracketsKeymap; +exports.closeCompletion = closeCompletion; +exports.completeAnyWord = completeAnyWord; +exports.completeFromList = completeFromList; +exports.completionKeymap = completionKeymap; +exports.completionStatus = completionStatus; +exports.currentCompletions = currentCompletions; +exports.deleteBracketPair = deleteBracketPair; +exports.ifIn = ifIn; +exports.ifNotIn = ifNotIn; +exports.insertBracket = insertBracket; +exports.insertCompletionText = insertCompletionText; +exports.moveCompletionSelection = moveCompletionSelection; +exports.nextSnippetField = nextSnippetField; +exports.pickedCompletion = pickedCompletion; +exports.prevSnippetField = prevSnippetField; +exports.selectedCompletion = selectedCompletion; +exports.selectedCompletionIndex = selectedCompletionIndex; +exports.setSelectedCompletion = setSelectedCompletion; +exports.snippet = snippet; +exports.snippetCompletion = snippetCompletion; +exports.snippetKeymap = snippetKeymap; +exports.startCompletion = startCompletion; diff --git a/node_modules/@codemirror/autocomplete/dist/index.d.ts b/node_modules/@codemirror/autocomplete/dist/index.d.ts new file mode 100644 index 0000000000..a4c950fd3a --- /dev/null +++ b/node_modules/@codemirror/autocomplete/dist/index.d.ts @@ -0,0 +1,459 @@ +import * as _codemirror_state from '@codemirror/state'; +import { EditorState, TransactionSpec, Transaction, StateCommand, Facet, Extension, StateEffect } from '@codemirror/state'; +import { EditorView, KeyBinding, Command } from '@codemirror/view'; +import * as _lezer_common from '@lezer/common'; + +interface CompletionConfig { + /** + When enabled (defaults to true), autocompletion will start + whenever the user types something that can be completed. + */ + activateOnTyping?: boolean; + /** + Override the completion sources used. By default, they will be + taken from the `"autocomplete"` [language + data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) (which should hold + [completion sources](https://codemirror.net/6/docs/ref/#autocomplete.CompletionSource) or arrays + of [completions](https://codemirror.net/6/docs/ref/#autocomplete.Completion)). + */ + override?: readonly CompletionSource[] | null; + /** + Determines whether the completion tooltip is closed when the + editor loses focus. Defaults to true. + */ + closeOnBlur?: boolean; + /** + The maximum number of options to render to the DOM. + */ + maxRenderedOptions?: number; + /** + Set this to false to disable the [default completion + keymap](https://codemirror.net/6/docs/ref/#autocomplete.completionKeymap). (This requires you to + add bindings to control completion yourself. The bindings should + probably have a higher precedence than other bindings for the + same keys.) + */ + defaultKeymap?: boolean; + /** + By default, completions are shown below the cursor when there is + space. Setting this to true will make the extension put the + completions above the cursor when possible. + */ + aboveCursor?: boolean; + /** + This can be used to add additional CSS classes to completion + options. + */ + optionClass?: (completion: Completion) => string; + /** + By default, the library will render icons based on the + completion's [type](https://codemirror.net/6/docs/ref/#autocomplete.Completion.type) in front of + each option. Set this to false to turn that off. + */ + icons?: boolean; + /** + This option can be used to inject additional content into + options. The `render` function will be called for each visible + completion, and should produce a DOM node to show. `position` + determines where in the DOM the result appears, relative to + other added widgets and the standard content. The default icons + have position 20, the label position 50, and the detail position 70. + */ + addToOptions?: { + render: (completion: Completion, state: EditorState) => Node | null; + position: number; + }[]; +} + +/** +Objects type used to represent individual completions. +*/ +interface Completion { + /** + The label to show in the completion picker. This is what input + is matched agains to determine whether a completion matches (and + how well it matches). + */ + label: string; + /** + An optional short piece of information to show (with a different + style) after the label. + */ + detail?: string; + /** + Additional info to show when the completion is selected. Can be + a plain string or a function that'll render the DOM structure to + show when invoked. + */ + info?: string | ((completion: Completion) => (Node | null | Promise)); + /** + How to apply the completion. The default is to replace it with + its [label](https://codemirror.net/6/docs/ref/#autocomplete.Completion.label). When this holds a + string, the completion range is replaced by that string. When it + is a function, that function is called to perform the + completion. If it fires a transaction, it is responsible for + adding the [`pickedCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.pickedCompletion) + annotation to it. + */ + apply?: string | ((view: EditorView, completion: Completion, from: number, to: number) => void); + /** + The type of the completion. This is used to pick an icon to show + for the completion. Icons are styled with a CSS class created by + appending the type name to `"cm-completionIcon-"`. You can + define or restyle icons by defining these selectors. The base + library defines simple icons for `class`, `constant`, `enum`, + `function`, `interface`, `keyword`, `method`, `namespace`, + `property`, `text`, `type`, and `variable`. + + Multiple types can be provided by separating them with spaces. + */ + type?: string; + /** + When given, should be a number from -99 to 99 that adjusts how + this completion is ranked compared to other completions that + match the input as well as this one. A negative number moves it + down the list, a positive number moves it up. + */ + boost?: number; +} +/** +An instance of this is passed to completion source functions. +*/ +declare class CompletionContext { + /** + The editor state that the completion happens in. + */ + readonly state: EditorState; + /** + The position at which the completion is happening. + */ + readonly pos: number; + /** + 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. + */ + readonly explicit: boolean; + /** + 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: EditorState, + /** + The position at which the completion is happening. + */ + pos: number, + /** + 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: boolean); + /** + Get the extent, content, and (if there is a token) type of the + token before `this.pos`. + */ + tokenBefore(types: readonly string[]): { + from: number; + to: number; + text: string; + type: _lezer_common.NodeType; + } | null; + /** + Get the match of the given expression directly before the + cursor. + */ + matchBefore(expr: RegExp): { + from: number; + to: number; + text: string; + } | null; + /** + Yields true when the query has been aborted. Can be useful in + asynchronous queries to avoid doing work that will be ignored. + */ + get aborted(): boolean; + /** + Allows you to register abort handlers, which will be called when + the query is + [aborted](https://codemirror.net/6/docs/ref/#autocomplete.CompletionContext.aborted). + */ + addEventListener(type: "abort", listener: () => void): void; +} +/** +Given a a fixed array of options, return an autocompleter that +completes them. +*/ +declare function completeFromList(list: readonly (string | Completion)[]): CompletionSource; +/** +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. +*/ +declare function ifIn(nodes: readonly string[], source: CompletionSource): CompletionSource; +/** +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. +*/ +declare function ifNotIn(nodes: readonly string[], source: CompletionSource): CompletionSource; +/** +The function signature for a completion source. Such a function +may return its [result](https://codemirror.net/6/docs/ref/#autocomplete.CompletionResult) +synchronously or as a promise. Returning null indicates no +completions are available. +*/ +declare type CompletionSource = (context: CompletionContext) => CompletionResult | null | Promise; +/** +Interface for objects returned by completion sources. +*/ +interface CompletionResult { + /** + The start of the range that is being completed. + */ + from: number; + /** + The end of the range that is being completed. Defaults to the + main cursor position. + */ + to?: number; + /** + The completions returned. These don't have to be compared with + the input by the source—the autocompletion system will do its + own matching (against the text between `from` and `to`) and + sorting. + */ + options: readonly Completion[]; + /** + When given, further typing or deletion that causes the part of + the document between ([mapped](https://codemirror.net/6/docs/ref/#state.ChangeDesc.mapPos)) `from` + and `to` to match this regular expression or predicate function + will not query the completion source again, but continue with + this list of options. This can help a lot with responsiveness, + since it allows the completion list to be updated synchronously. + */ + validFor?: RegExp | ((text: string, from: number, to: number, state: EditorState) => boolean); + /** + By default, the library filters and scores completions. Set + `filter` to `false` to disable this, and cause your completions + to all be included, in the order they were given. When there are + other sources, unfiltered completions appear at the top of the + list of completions. `validFor` must not be given when `filter` + is `false`, because it only works when filtering. + */ + filter?: boolean; + /** + When [`filter`](https://codemirror.net/6/docs/ref/#autocomplete.CompletionResult.filter) is set to + `false`, this may be provided to compute the ranges on the label + that match the input. Should return an array of numbers where + each pair of adjacent numbers provide the start and end of a + range. + */ + getMatch?: (completion: Completion) => readonly number[]; + /** + Synchronously update the completion result after typing or + deletion. If given, this should not do any expensive work, since + it will be called during editor state updates. The function + should make sure (similar to + [`validFor`](https://codemirror.net/6/docs/ref/#autocomplete.CompletionResult.validFor)) that the + completion still applies in the new state. + */ + update?: (current: CompletionResult, from: number, to: number, context: CompletionContext) => CompletionResult | null; +} +/** +This annotation is added to transactions that are produced by +picking a completion. +*/ +declare const pickedCompletion: _codemirror_state.AnnotationType; +/** +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. +*/ +declare function insertCompletionText(state: EditorState, text: string, from: number, to: number): TransactionSpec; + +/** +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 after the dollar or hash and before the brace (`$\\{`). +This will be removed and the sequence will not be interpreted as a +placeholder. +*/ +declare function snippet(template: string): (editor: { + state: EditorState; + dispatch: (tr: Transaction) => void; +}, _completion: Completion, from: number, to: number) => void; +/** +A command that clears the active snippet, if any. +*/ +declare const clearSnippet: StateCommand; +/** +Move to the next snippet field, if available. +*/ +declare const nextSnippetField: StateCommand; +/** +Move to the previous snippet field, if available. +*/ +declare const prevSnippetField: StateCommand; +/** +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). +*/ +declare const snippetKeymap: Facet; +/** +Create a completion from a snippet. Returns an object with the +properties from `completion`, plus an `apply` function that +applies the snippet. +*/ +declare function snippetCompletion(template: string, completion: Completion): Completion; + +/** +Returns a command that moves the completion selection forward or +backward by the given amount. +*/ +declare function moveCompletionSelection(forward: boolean, by?: "option" | "page"): Command; +/** +Accept the current completion. +*/ +declare const acceptCompletion: Command; +/** +Explicitly start autocompletion. +*/ +declare const startCompletion: Command; +/** +Close the currently active completion. +*/ +declare const closeCompletion: Command; + +/** +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. +*/ +declare const completeAnyWord: CompletionSource; + +/** +Configures bracket closing behavior for a syntax (via +[language data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt)) using the `"closeBrackets"` +identifier. +*/ +interface CloseBracketConfig { + /** + The opening brackets to close. Defaults to `["(", "[", "{", "'", + '"']`. Brackets may be single characters or a triple of quotes + (as in `"''''"`). + */ + brackets?: string[]; + /** + Characters in front of which newly opened brackets are + automatically closed. Closing always happens in front of + whitespace. Defaults to `")]}:;>"`. + */ + before?: string; +} +/** +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. +*/ +declare function closeBrackets(): Extension; +/** +Command that implements deleting a pair of matching brackets when +the cursor is between them. +*/ +declare const deleteBracketPair: StateCommand; +/** +Close-brackets related key bindings. Binds Backspace to +[`deleteBracketPair`](https://codemirror.net/6/docs/ref/#autocomplete.deleteBracketPair). +*/ +declare const closeBracketsKeymap: readonly KeyBinding[]; +/** +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.) +*/ +declare function insertBracket(state: EditorState, bracket: string): Transaction | null; + +/** +Returns an extension that enables autocompletion. +*/ +declare function autocompletion(config?: CompletionConfig): Extension; +/** +Basic keybindings for autocompletion. + + - Ctrl-Space: [`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")` + - PageDown: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(true, "page")` + - Enter: [`acceptCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.acceptCompletion) +*/ +declare const completionKeymap: readonly KeyBinding[]; +/** +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`. +*/ +declare function completionStatus(state: EditorState): null | "active" | "pending"; +/** +Returns the available completions as an array. +*/ +declare function currentCompletions(state: EditorState): readonly Completion[]; +/** +Return the currently selected completion, if any. +*/ +declare function selectedCompletion(state: EditorState): Completion | null; +/** +Returns the currently selected position in the active completion +list, or null if no completions are active. +*/ +declare function selectedCompletionIndex(state: EditorState): number | null; +/** +Create an effect that can be attached to a transaction to change +the currently selected completion. +*/ +declare function setSelectedCompletion(index: number): StateEffect; + +export { CloseBracketConfig, Completion, CompletionContext, CompletionResult, CompletionSource, acceptCompletion, autocompletion, clearSnippet, closeBrackets, closeBracketsKeymap, closeCompletion, completeAnyWord, completeFromList, completionKeymap, completionStatus, currentCompletions, deleteBracketPair, ifIn, ifNotIn, insertBracket, insertCompletionText, moveCompletionSelection, nextSnippetField, pickedCompletion, prevSnippetField, selectedCompletion, selectedCompletionIndex, setSelectedCompletion, snippet, snippetCompletion, snippetKeymap, startCompletion }; diff --git a/node_modules/@codemirror/autocomplete/dist/index.js b/node_modules/@codemirror/autocomplete/dist/index.js new file mode 100644 index 0000000000..934d4df4f4 --- /dev/null +++ b/node_modules/@codemirror/autocomplete/dist/index.js @@ -0,0 +1,1756 @@ +import { Annotation, EditorSelection, codePointAt, codePointSize, fromCodePoint, Facet, combineConfig, StateEffect, StateField, Prec, Text, MapMode, RangeValue, RangeSet, CharCategory } from '@codemirror/state'; +import { logException, Direction, showTooltip, EditorView, ViewPlugin, getTooltip, Decoration, WidgetType, keymap } from '@codemirror/view'; +import { syntaxTree, indentUnit } from '@codemirror/language'; + +/** +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) { + this.state = state; + this.pos = pos; + this.explicit = explicit; + /** + @internal + */ + this.abortListeners = []; + } + /** + Get the extent, content, and (if there is a token) type of the + token before `this.pos`. + */ + tokenBefore(types) { + let token = syntaxTree(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). + */ + addEventListener(type, listener) { + if (type == "abort" && this.abortListeners) + this.abortListeners.push(listener); + } +} +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); + 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; + return source(context); + }; +} +class Option { + constructor(completion, source, match) { + this.completion = completion; + this.source = source; + this.match = match; + } +} +function cur(state) { return state.selection.main.head; } +// 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__*/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) { + return Object.assign(Object.assign({}, state.changeByRange(range => { + if (range == state.selection.main) + return { + changes: { from: from, to: to, insert: text }, + range: EditorSelection.cursor(from + text.length) + }; + let len = to - from; + if (!range.empty || + len && state.sliceDoc(range.from - len, range.from) != state.sliceDoc(from, to)) + return { range }; + return { + changes: { from: range.from - len, to: range.from, insert: text }, + range: EditorSelection.cursor(range.from - len + text.length) + }; + })), { userEvent: "input.complete" }); +} +function applyCompletion(view, option) { + const apply = option.completion.apply || option.completion.label; + let result = option.source; + if (typeof apply == "string") + view.dispatch(insertCompletionText(view.state, apply, result.from, result.to)); + else + apply(view, option.completion, result.from, result.to); +} +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; +} + +// 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 = []; + for (let p = 0; p < pattern.length;) { + let char = codePointAt(pattern, p), size = codePointSize(char); + this.chars.push(char); + let part = pattern.slice(p, p + size), upper = part.toUpperCase(); + this.folded.push(codePointAt(upper == part ? part.toLowerCase() : upper, 0)); + p += size; + } + this.astral = pattern.length != this.chars.length; + } + // Matches a given word (completion) against the pattern (input). + // Will return null for no match, and otherwise an array that starts + // with the match score, followed by any number 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 [0]; + 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 = codePointAt(word, 0); + return first == chars[0] ? [0, 0, codePointSize(first)] + : first == folded[0] ? [-200 /* CaseFold */, 0, codePointSize(first)] : null; + } + let direct = word.indexOf(this.pattern); + if (direct == 0) + return [0, 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 = codePointAt(word, i); + if (next == chars[anyTo] || next == folded[anyTo]) + any[anyTo++] = i; + i += 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 /* NonWord */; i < e && byWordTo < len;) { + let next = 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 /* Lower */ : next >= 65 && next <= 90 ? 1 /* Upper */ : 0 /* NonWord */) + : ((ch = fromCodePoint(next)) != ch.toLowerCase() ? 1 /* Upper */ : ch != ch.toUpperCase() ? 2 /* Lower */ : 0 /* NonWord */); + if (!i || type == 1 /* Upper */ && hasLower || prevType == 0 /* NonWord */ && type != 0 /* NonWord */) { + if (chars[byWordTo] == next || (folded[byWordTo] == next && (byWordFolded = true))) + byWord[byWordTo++] = i; + else if (byWord.length) + wordAdjacent = false; + } + prevType = type; + i += codePointSize(next); + } + if (byWordTo == len && byWord[0] == 0 && wordAdjacent) + return this.result(-100 /* ByWord */ + (byWordFolded ? -200 /* CaseFold */ : 0), byWord, word); + if (adjacentTo == len && adjacentStart == 0) + return [-200 /* CaseFold */ - word.length, 0, adjacentEnd]; + if (direct > -1) + return [-700 /* NotStart */ - word.length, direct, direct + this.pattern.length]; + if (adjacentTo == len) + return [-200 /* CaseFold */ + -700 /* NotStart */ - word.length, adjacentStart, adjacentEnd]; + if (byWordTo == len) + return this.result(-100 /* ByWord */ + (byWordFolded ? -200 /* CaseFold */ : 0) + -700 /* NotStart */ + + (wordAdjacent ? 0 : -1100 /* Gap */), byWord, word); + return chars.length == 2 ? null : this.result((any[0] ? -700 /* NotStart */ : 0) + -200 /* CaseFold */ + -1100 /* Gap */, any, word); + } + result(score, positions, word) { + let result = [score - word.length], i = 1; + for (let pos of positions) { + let to = pos + (this.astral ? codePointSize(codePointAt(word, pos)) : 1); + if (i > 1 && result[i - 1] == pos) + result[i - 1] = to; + else { + result[i++] = pos; + result[i++] = to; + } + } + return result; + } +} + +const completionConfig = /*@__PURE__*/Facet.define({ + combine(configs) { + return combineConfig(configs, { + activateOnTyping: true, + override: null, + closeOnBlur: true, + maxRenderedOptions: 100, + defaultKeymap: true, + optionClass: () => "", + aboveCursor: false, + icons: true, + addToOptions: [] + }, { + defaultKeymap: (a, b) => a && b, + closeOnBlur: (a, b) => a && b, + icons: (a, b) => a && b, + optionClass: (a, b) => c => joinClass(a(c), b(c)), + addToOptions: (a, b) => a.concat(b) + }); + } +}); +function joinClass(a, b) { + return a ? b ? a + " " + b : a : b; +} + +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, match) { + let labelElt = document.createElement("span"); + labelElt.className = "cm-completionLabel"; + let { label } = completion, off = 0; + for (let j = 1; 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 <= (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) { + this.view = view; + this.stateField = stateField; + this.info = null; + this.placeInfo = { + read: () => this.measureInfo(), + write: (pos) => this.positionInfo(pos), + key: this + }; + 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.range = rangeAroundSelected(options.length, selected, config.maxRenderedOptions); + this.dom = document.createElement("div"); + this.dom.className = "cm-tooltip-autocomplete"; + this.dom.addEventListener("mousedown", (e) => { + 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) { + applyCompletion(view, options[+match[1]]); + e.preventDefault(); + return; + } + } + }); + this.list = this.dom.appendChild(this.createListBox(options, cState.id, this.range)); + this.list.addEventListener("scroll", () => { + if (this.info) + this.view.requestMeasure(this.placeInfo); + }); + } + mount() { this.updateSel(); } + update(update) { + if (update.state.field(this.stateField) != update.startState.field(this.stateField)) + this.updateSel(); + } + positioned() { + if (this.info) + this.view.requestMeasure(this.placeInfo); + } + updateSel() { + let cState = this.view.state.field(this.stateField), open = cState.open; + if (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.list.remove(); + this.list = this.dom.appendChild(this.createListBox(open.options, cState.id, this.range)); + this.list.addEventListener("scroll", () => { + if (this.info) + this.view.requestMeasure(this.placeInfo); + }); + } + if (this.updateSelectedOption(open.selected)) { + if (this.info) { + this.info.remove(); + this.info = null; + } + 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(node => { + if (node && this.view.state.field(this.stateField, false) == cState) + this.addInfoPane(node); + }).catch(e => logException(this.view.state, e, "completion info")); + } + else { + this.addInfoPane(infoResult); + } + } + } + addInfoPane(content) { + let dom = this.info = document.createElement("div"); + dom.className = "cm-tooltip cm-completionInfo"; + dom.appendChild(content); + this.dom.appendChild(dom); + this.view.requestMeasure(this.placeInfo); + } + updateSelectedOption(selected) { + let set = null; + for (let opt = this.list.firstChild, i = this.range.from; opt; opt = opt.nextSibling, i++) { + 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"); + } + } + 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(); + if (selRect.top > Math.min(innerHeight, listRect.bottom) - 10 || selRect.bottom < Math.max(0, listRect.top) + 10) + return null; + let top = Math.max(0, Math.min(selRect.top, innerHeight - infoRect.height)) - listRect.top; + let left = this.view.textDirection == Direction.RTL; + let spaceLeft = listRect.left, spaceRight = innerWidth - listRect.right; + if (left && spaceLeft < Math.min(infoRect.width, spaceRight)) + left = false; + else if (!left && spaceRight < Math.min(infoRect.width, spaceLeft)) + left = true; + return { top, left }; + } + positionInfo(pos) { + if (this.info) { + this.info.style.top = (pos ? pos.top : -1e6) + "px"; + if (pos) { + this.info.classList.toggle("cm-completionInfo-left", pos.left); + this.info.classList.toggle("cm-completionInfo-right", !pos.left); + } + } + } + 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")); + for (let i = range.from; i < range.to; i++) { + let { completion, match } = options[i]; + 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, 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; + } +} +// We allocate a new function instance every time the completion +// changes to force redrawing/repositioning of the tooltip +function completionTooltip(stateField) { + return (view) => new CompletionTooltip(view, stateField); +} +function scrollIntoView(container, element) { + let parent = container.getBoundingClientRect(); + let self = element.getBoundingClientRect(); + if (self.top < parent.top) + container.scrollTop -= parent.top - self.top; + else if (self.bottom > parent.bottom) + container.scrollTop += self.bottom - parent.bottom; +} + +// 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 = [], i = 0; + for (let a of active) + if (a.hasResult()) { + if (a.result.filter === false) { + let getMatch = a.result.getMatch; + for (let option of a.result.options) { + let match = [1e9 - i++]; + if (getMatch) + for (let n of getMatch(option)) + match.push(n); + options.push(new Option(option, a, match)); + } + } + else { + let matcher = new FuzzyMatcher(state.sliceDoc(a.from, a.to)), match; + for (let option of a.result.options) + if (match = matcher.match(option.label)) { + if (option.boost != null) + match[0] += option.boost; + options.push(new Option(option, a, match)); + } + } + } + let result = [], prev = null; + for (let opt of options.sort(cmpOption)) { + if (!prev || prev.label != opt.completion.label || prev.detail != opt.completion.detail || + (prev.type != null && opt.completion.type != null && prev.type != opt.completion.type) || + prev.apply != opt.completion.apply) + 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) { + this.options = options; + this.attrs = attrs; + this.tooltip = tooltip; + this.timestamp = timestamp; + this.selected = selected; + } + setSelected(selected, id) { + return selected == this.selected || selected >= this.options.length ? this + : new CompletionDialog(this.options, makeAttrs(id, selected), this.tooltip, this.timestamp, selected); + } + static build(active, state, id, prev, conf) { + let options = sortOptions(active, state); + if (!options.length) + return null; + let selected = 0; + if (prev && prev.selected) { + 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: completionTooltip(completionState), + above: conf.aboveCursor, + }, prev ? prev.timestamp : Date.now(), selected); + } + map(changes) { + return new CompletionDialog(this.options, this.attrs, Object.assign(Object.assign({}, this.tooltip), { pos: changes.mapPos(this.tooltip.pos) }), this.timestamp, this.selected); + } +} +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 /* Inactive */) ? 1 /* Pending */ : 0 /* 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 = tr.selection || active.some(a => a.hasResult() && tr.changes.touchesRange(a.from, a.to)) || + !sameResults(active, this.active) ? CompletionDialog.build(active, state, this.id, this.open, conf) + : this.open && tr.docChanged ? this.open.map(tr.changes) : this.open; + if (!open && active.every(a => a.state != 1 /* Pending */) && active.some(a => a.hasResult())) + active = active.map(a => a.hasResult() ? new ActiveSource(a.source, 0 /* 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 : baseAttrs; } +} +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" +}; +function makeAttrs(id, selected) { + return { + "aria-autocomplete": "list", + "aria-haspopup": "listbox", + "aria-activedescendant": id + "-" + selected, + "aria-controls": id + }; +} +const none = []; +function cmpOption(a, b) { + let dScore = b.match[0] - a.match[0]; + if (dScore) + return dScore; + return a.completion.label.localeCompare(b.completion.label); +} +function getUserEvent(tr) { + return tr.isUserEvent("input.type") ? "input" : tr.isUserEvent("delete.backward") ? "delete" : null; +} +class ActiveSource { + constructor(source, state, explicitPos = -1) { + this.source = source; + this.state = state; + this.explicitPos = explicitPos; + } + hasResult() { return false; } + update(tr, conf) { + let event = getUserEvent(tr), value = this; + if (event) + value = value.handleUserEvent(tr, event, conf); + else if (tr.docChanged) + value = value.handleChange(tr); + else if (tr.selection && value.state != 0 /* Inactive */) + value = new ActiveSource(value.source, 0 /* Inactive */); + for (let effect of tr.effects) { + if (effect.is(startCompletionEffect)) + value = new ActiveSource(value.source, 1 /* Pending */, effect.value ? cur(tr.state) : -1); + else if (effect.is(closeCompletionEffect)) + value = new ActiveSource(value.source, 0 /* Inactive */); + else if (effect.is(setActiveEffect)) + for (let active of effect.value) + if (active.source == value.source) + value = active; + } + return value; + } + handleUserEvent(tr, type, conf) { + return type == "delete" || !conf.activateOnTyping ? this.map(tr.changes) : new ActiveSource(this.source, 1 /* Pending */); + } + handleChange(tr) { + return tr.changes.touchesRange(cur(tr.startState)) ? new ActiveSource(this.source, 0 /* Inactive */) : this.map(tr.changes); + } + map(changes) { + return changes.empty || this.explicitPos < 0 ? this : new ActiveSource(this.source, this.state, changes.mapPos(this.explicitPos)); + } +} +class ActiveResult extends ActiveSource { + constructor(source, explicitPos, result, from, to) { + super(source, 2 /* Result */, explicitPos); + this.result = result; + this.from = from; + this.to = to; + } + hasResult() { return true; } + handleUserEvent(tr, type, conf) { + var _a; + let from = tr.changes.mapPos(this.from), to = tr.changes.mapPos(this.to, 1); + let pos = cur(tr.state); + if ((this.explicitPos < 0 ? pos <= from : pos < this.from) || + pos > to || + type == "delete" && cur(tr.startState) == this.from) + return new ActiveSource(this.source, type == "input" && conf.activateOnTyping ? 1 /* Pending */ : 0 /* Inactive */); + let explicitPos = this.explicitPos < 0 ? -1 : tr.changes.mapPos(this.explicitPos), updated; + if (checkValid(this.result.validFor, tr.state, from, to)) + return new ActiveResult(this.source, explicitPos, this.result, from, to); + if (this.result.update && + (updated = this.result.update(this.result, from, to, new CompletionContext(tr.state, pos, explicitPos >= 0)))) + return new ActiveResult(this.source, explicitPos, updated, updated.from, (_a = updated.to) !== null && _a !== void 0 ? _a : cur(tr.state)); + return new ActiveSource(this.source, 1 /* Pending */, explicitPos); + } + handleChange(tr) { + return tr.changes.touchesRange(this.from, this.to) ? new ActiveSource(this.source, 0 /* Inactive */) : this.map(tr.changes); + } + map(mapping) { + return mapping.empty ? this : + new ActiveResult(this.source, this.explicitPos < 0 ? -1 : mapping.mapPos(this.explicitPos), this.result, mapping.mapPos(this.from), mapping.mapPos(this.to, 1)); + } +} +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 startCompletionEffect = /*@__PURE__*/StateEffect.define(); +const closeCompletionEffect = /*@__PURE__*/StateEffect.define(); +const setActiveEffect = /*@__PURE__*/StateEffect.define({ + map(sources, mapping) { return sources.map(s => s.map(mapping)); } +}); +const setSelectedEffect = /*@__PURE__*/StateEffect.define(); +const completionState = /*@__PURE__*/StateField.define({ + create() { return CompletionState.start(); }, + update(value, tr) { return value.update(tr); }, + provide: f => [ + showTooltip.from(f, val => val.tooltip), + EditorView.contentAttributes.from(f, state => state.attrs) + ] +}); + +const CompletionInteractMargin = 75; +/** +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 || Date.now() - cState.open.timestamp < CompletionInteractMargin) + return false; + let step = 1, tooltip; + if (by == "page" && (tooltip = getTooltip(view, cState.open.tooltip))) + step = Math.max(2, Math.floor(tooltip.dom.offsetHeight / + tooltip.dom.querySelector("li").offsetHeight) - 1); + let selected = cState.open.selected + step * (forward ? 1 : -1), { length } = cState.open.options; + 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 || Date.now() - cState.open.timestamp < CompletionInteractMargin) + return false; + applyCompletion(view, cState.open.options[cState.open.selected]); + return true; +}; +/** +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 /* 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 DebounceTime = 50, MaxUpdateCount = 50, MinAbortTime = 1000; +const completionPlugin = /*@__PURE__*/ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.debounceUpdate = -1; + this.running = []; + this.debounceAccept = -1; + this.composing = 0 /* None */; + for (let active of view.state.field(completionState).active) + if (active.state == 1 /* Pending */) + this.startQuery(active); + } + update(update) { + let cState = update.state.field(completionState); + if (!update.selectionSet && !update.docChanged && update.startState.field(completionState) == cState) + return; + let doesReset = update.transactions.some(tr => { + return (tr.selection || tr.docChanged) && !getUserEvent(tr); + }); + for (let i = 0; i < this.running.length; i++) { + let query = this.running[i]; + if (doesReset || + query.updates.length + update.transactions.length > MaxUpdateCount && Date.now() - query.time > MinAbortTime) { + for (let handler of query.context.abortListeners) { + try { + handler(); + } + catch (e) { + 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); + this.debounceUpdate = cState.active.some(a => a.state == 1 /* Pending */ && !this.running.some(q => q.active.source == a.source)) + ? setTimeout(() => this.startUpdate(), DebounceTime) : -1; + if (this.composing != 0 /* None */) + for (let tr of update.transactions) { + if (getUserEvent(tr) == "input") + this.composing = 2 /* Changed */; + else if (this.composing == 2 /* Changed */ && tr.selection) + this.composing = 3 /* ChangedAndMoved */; + } + } + startUpdate() { + this.debounceUpdate = -1; + let { state } = this.view, cState = state.field(completionState); + for (let active of cState.active) { + if (active.state == 1 /* Pending */ && !this.running.some(r => r.active.source == active.source)) + this.startQuery(active); + } + } + startQuery(active) { + let { state } = this.view, pos = cur(state); + let context = new CompletionContext(state, pos, active.explicitPos == pos); + 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) }); + 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(), DebounceTime); + } + // 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); + 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 active = new ActiveResult(query.active.source, query.active.explicitPos, query.done, query.done.from, (_a = query.done.to) !== null && _a !== void 0 ? _a : cur(query.updates.length ? query.updates[0].startState : this.view.state)); + // 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 = this.view.state.field(completionState).active.find(a => a.source == query.active.source); + if (current && current.state == 1 /* Pending */) { + 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 /* Inactive */); + for (let tr of query.updates) + active = active.update(tr, conf); + if (active.state != 1 /* Pending */) + updated.push(active); + } + else { + // Cleared by subsequent transactions. Restart. + this.startQuery(current); + } + } + } + if (updated.length) + this.view.dispatch({ effects: setActiveEffect.of(updated) }); + } +}, { + eventHandlers: { + blur() { + let state = this.view.state.field(completionState, false); + if (state && state.tooltip && this.view.state.facet(completionConfig).closeOnBlur) + this.view.dispatch({ effects: closeCompletionEffect.of(null) }); + }, + compositionstart() { + this.composing = 1 /* Started */; + }, + compositionend() { + if (this.composing == 3 /* 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 /* None */; + } + } +}); + +const baseTheme = /*@__PURE__*/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", + listStyle: "none", + margin: 0, + padding: 0, + "& > li": { + overflowX: "hidden", + textOverflow: "ellipsis", + cursor: "pointer", + padding: "1px 3px", + lineHeight: 1.2 + }, + } + }, + "&light .cm-tooltip-autocomplete ul li[aria-selected]": { + background: "#17c", + color: "white", + }, + "&dark .cm-tooltip-autocomplete ul li[aria-selected]": { + background: "#347", + color: "white", + }, + ".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: "300px", + }, + ".cm-completionInfo.cm-completionInfo-left": { right: "100%" }, + ".cm-completionInfo.cm-completionInfo-right": { left: "100%" }, + "&light .cm-snippetField": { backgroundColor: "#00000022" }, + "&dark .cm-snippetField": { backgroundColor: "#ffffff22" }, + ".cm-snippetFieldPosition": { + verticalAlign: "text-top", + width: 0, + height: "1.15em", + 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" + }, + ".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, name = m[2] || m[3] || "", found = -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++; + } + positions.push(new FieldPos(found, lines.length, m.index, m.index + name.length)); + line = line.slice(0, m.index) + name + line.slice(m.index + m[0].length); + } + for (let esc; esc = /([$#])\\{/.exec(line);) { + line = line.slice(0, esc.index) + esc[1] + "{" + line.slice(esc.index + esc[0].length); + for (let pos of positions) + if (pos.line == lines.length && pos.from > esc.index) { + pos.from--; + pos.to--; + } + } + lines.push(line); + } + return new Snippet(lines, positions); + } +} +let fieldMarker = /*@__PURE__*/Decoration.widget({ widget: /*@__PURE__*/new class extends WidgetType { + toDOM() { + let span = document.createElement("span"); + span.className = "cm-snippetFieldPosition"; + return span; + } + ignoreEvent() { return false; } + } }); +let fieldRange = /*@__PURE__*/Decoration.mark({ class: "cm-snippetField" }); +class ActiveSnippet { + constructor(ranges, active) { + this.ranges = ranges; + this.active = active; + this.deco = Decoration.set(ranges.map(r => (r.from == r.to ? fieldMarker : fieldRange).range(r.from, r.to))); + } + 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__*/StateEffect.define({ + map(value, changes) { return value && value.map(changes); } +}); +const moveToField = /*@__PURE__*/StateEffect.define(); +const snippetState = /*@__PURE__*/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 => EditorView.decorations.from(f, val => val ? val.deco : Decoration.none) +}); +function fieldSelection(ranges, field) { + return EditorSelection.create(ranges.filter(r => r.field == field).map(r => 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 after the dollar or hash and before the brace (`$\\{`). +This will be removed and the sequence will not be interpreted as a +placeholder. +*/ +function snippet(template) { + let snippet = Snippet.parse(template); + return (editor, _completion, from, to) => { + let { text, ranges } = snippet.instantiate(editor.state, from); + let spec = { + changes: { from, to, insert: Text.of(text) }, + scrollIntoView: true + }; + if (ranges.length) + spec.selection = fieldSelection(ranges, 0); + if (ranges.length > 1) { + 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, 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)) + })); + 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); +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__*/Facet.define({ + combine(maps) { return maps.length ? maps[0] : defaultSnippetKeymap; } +}); +const addSnippetKeymap = /*@__PURE__*/Prec.highest(/*@__PURE__*/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 Object.assign(Object.assign({}, completion), { apply: snippet(template) }); +} +const snippetPointerHandler = /*@__PURE__*/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) + }); + 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__*/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 /* MaxList */) + return; + } + } + pos += value.length + 1; + } +} +function collectWords(doc, cache, wordRE, to, ignoreAt) { + let big = doc.length >= 1000 /* 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 /* 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 /* 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 /* Range */, from); + return { from, options, validFor: mapRE(re, s => "^" + s) }; +}; + +const defaults = { + brackets: ["(", "[", "{", "'", '"'], + before: ")]}:;>" +}; +const closeBracketEffect = /*@__PURE__*/StateEffect.define({ + map(value, mapping) { + let mapped = mapping.mapPos(value, -1, MapMode.TrackAfter); + return mapped == null ? undefined : mapped; + } +}); +const skipBracketEffect = /*@__PURE__*/StateEffect.define({ + map(value, mapping) { return mapping.mapPos(value); } +}); +const closedBracket = /*@__PURE__*/new class extends RangeValue { +}; +closedBracket.startSide = 1; +closedBracket.endSide = -1; +const bracketState = /*@__PURE__*/StateField.define({ + create() { return RangeSet.empty; }, + update(value, tr) { + if (tr.selection) { + let lineStart = tr.state.doc.lineAt(tr.selection.main.head).from; + let prevLineStart = tr.startState.doc.lineAt(tr.startState.selection.main.head).from; + if (lineStart != tr.changes.mapPos(prevLineStart, -1)) + value = RangeSet.empty; + } + value = value.map(tr.changes); + for (let effect of tr.effects) { + if (effect.is(closeBracketEffect)) + value = value.update({ add: [closedBracket.range(effect.value, effect.value + 1)] }); + else if (effect.is(skipBracketEffect)) + value = value.update({ filter: from => from != effect.value }); + } + 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 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__*/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 && codePointSize(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(codePointAt(token, 0))) + return { changes: { from: range.head - token.length, to: range.head + token.length }, + range: EditorSelection.cursor(range.head - token.length), + userEvent: "delete.backward" }; + } + } + return { range: dont = range }; + }); + if (!dont) + dispatch(state.update(changes, { scrollIntoView: true })); + 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(codePointAt(tok, 0)); + if (bracket == tok) + return closed == tok ? handleSame(state, tok, tokens.indexOf(tok + tok + tok) > -1) + : 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, codePointSize(codePointAt(next, 0))); +} +function prevChar(doc, pos) { + let prev = doc.sliceString(pos - 2, pos); + return codePointSize(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: 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: 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, moved = state.selection.ranges.map(range => { + if (range.empty && nextChar(state.doc, range.head) == close) + return EditorSelection.cursor(range.head + close.length); + return dont = range; + }); + return dont ? null : state.update({ + selection: EditorSelection.create(moved, state.selection.mainIndex), + scrollIntoView: true, + effects: state.selection.ranges.map(({ from }) => skipBracketEffect.of(from)) + }); +} +// 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) { + 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: EditorSelection.range(range.anchor + token.length, range.head + token.length) }; + let pos = range.head, next = nextChar(state.doc, pos); + if (next == token) { + if (nodeStart(state, pos)) { + return { changes: { insert: token + token, from: pos }, + effects: closeBracketEffect.of(pos + token.length), + range: EditorSelection.cursor(pos + token.length) }; + } + else if (closedBracketAt(state, pos)) { + let isTriple = allowTriple && state.sliceDoc(pos, pos + token.length * 3) == token + token + token; + return { range: EditorSelection.cursor(pos + token.length * (isTriple ? 3 : 1)), + effects: skipBracketEffect.of(pos) }; + } + } + else if (allowTriple && state.sliceDoc(pos - 2 * token.length, pos) == token + token && + nodeStart(state, pos - 2 * token.length)) { + return { changes: { insert: token + token + token + token, from: pos }, + effects: closeBracketEffect.of(pos + token.length), + range: EditorSelection.cursor(pos + token.length) }; + } + else if (state.charCategorizer(pos)(next) != CharCategory.Word) { + let prev = state.sliceDoc(pos - 1, pos); + if (prev != token && state.charCategorizer(pos)(prev) != CharCategory.Word && !probablyInString(state, pos, token)) + return { changes: { insert: token + token, from: pos }, + effects: closeBracketEffect.of(pos + token.length), + range: 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 = syntaxTree(state).resolveInner(pos + 1); + return tree.parent && tree.from == pos; +} +function probablyInString(state, pos, quoteToken) { + let node = syntaxTree(state).resolveInner(pos, -1); + for (let i = 0; i < 5; i++) { + if (state.sliceDoc(node.from, node.from + quoteToken.length) == quoteToken) + return true; + let parent = node.to == pos && node.parent; + if (!parent) + break; + node = parent; + } + return false; +} + +/** +Returns an extension that enables autocompletion. +*/ +function autocompletion(config = {}) { + return [ + completionState, + completionConfig.of(config), + completionPlugin, + completionKeymapExt, + baseTheme + ]; +} +/** +Basic keybindings for autocompletion. + + - Ctrl-Space: [`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")` + - PageDown: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(true, "page")` + - Enter: [`acceptCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.acceptCompletion) +*/ +const completionKeymap = [ + { key: "Ctrl-Space", 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__*/Prec.highest(/*@__PURE__*/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.state == 1 /* Pending */) ? "pending" + : cState && cState.active.some(a => a.state != 0 /* 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) + 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.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.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); +} + +export { CompletionContext, acceptCompletion, autocompletion, clearSnippet, closeBrackets, closeBracketsKeymap, closeCompletion, completeAnyWord, completeFromList, completionKeymap, completionStatus, currentCompletions, deleteBracketPair, ifIn, ifNotIn, insertBracket, insertCompletionText, moveCompletionSelection, nextSnippetField, pickedCompletion, prevSnippetField, selectedCompletion, selectedCompletionIndex, setSelectedCompletion, snippet, snippetCompletion, snippetKeymap, startCompletion }; diff --git a/node_modules/@codemirror/autocomplete/package.json b/node_modules/@codemirror/autocomplete/package.json new file mode 100644 index 0000000000..72313f2ba4 --- /dev/null +++ b/node_modules/@codemirror/autocomplete/package.json @@ -0,0 +1,41 @@ +{ + "name": "@codemirror/autocomplete", + "version": "6.0.1", + "description": "Autocompletion for the CodeMirror code editor", + "scripts": { + "test": "cm-runtests", + "prepare": "cm-buildhelper src/index.ts" + }, + "keywords": [ + "editor", + "code" + ], + "author": { + "name": "Marijn Haverbeke", + "email": "marijnh@gmail.com", + "url": "http://marijnhaverbeke.nl" + }, + "type": "module", + "main": "dist/index.cjs", + "exports": { + "import": "./dist/index.js", + "require": "./dist/index.cjs" + }, + "types": "dist/index.d.ts", + "module": "dist/index.js", + "sideEffects": false, + "license": "MIT", + "dependencies": { + "@codemirror/language": "^6.0.0", + "@codemirror/state": "^6.0.0", + "@codemirror/view": "^6.0.0", + "@lezer/common": "^1.0.0" + }, + "devDependencies": { + "@codemirror/buildhelper": "^0.1.5" + }, + "repository": { + "type": "git", + "url": "https://github.com/codemirror/autocomplete.git" + } +} diff --git a/node_modules/@codemirror/commands/.github/workflows/dispatch.yml b/node_modules/@codemirror/commands/.github/workflows/dispatch.yml new file mode 100644 index 0000000000..955205089e --- /dev/null +++ b/node_modules/@codemirror/commands/.github/workflows/dispatch.yml @@ -0,0 +1,16 @@ +name: Trigger CI +on: push + +jobs: + build: + name: Dispatch to main repo + runs-on: ubuntu-latest + steps: + - name: Emit repository_dispatch + uses: mvasigh/dispatch-action@main + with: + # You should create a personal access token and store it in your repository + token: ${{ secrets.DISPATCH_AUTH }} + repo: codemirror.next + owner: codemirror + event_type: push diff --git a/node_modules/@codemirror/commands/CHANGELOG.md b/node_modules/@codemirror/commands/CHANGELOG.md new file mode 100644 index 0000000000..9436099409 --- /dev/null +++ b/node_modules/@codemirror/commands/CHANGELOG.md @@ -0,0 +1,174 @@ +## 6.0.0 (2022-06-08) + +### Bug fixes + +Fix a bug where by-page selection commands sometimes moved one line too far. + +## 0.20.0 (2022-04-20) + +### Breaking changes + +There is no longer a separate `commentKeymap`. Those bindings are now part of `defaultKeymap`. + +### Bug fixes + +Make `cursorPageUp` and `cursorPageDown` move by window height when the editor is higher than the window. + +Make sure the default behavior of Home/End is prevented, since it could produce unexpected results on macOS. + +### New features + +The exports from @codemirror/comment are now available in this package. + +The exports from the @codemirror/history package are now available from this package. + +## 0.19.8 (2022-01-26) + +### Bug fixes + +`deleteCharBackward` now removes extending characters one at a time, rather than deleting the entire glyph at once. + +Alt-v is no longer bound in `emacsStyleKeymap` and macOS's `standardKeymap`, because macOS doesn't bind it by default and it conflicts with some keyboard layouts. + +## 0.19.7 (2022-01-11) + +### Bug fixes + +Don't bind Alt-\< and Alt-> on macOS by default, since those interfere with some keyboard layouts. Make cursorPageUp/Down scroll the view to keep the cursor in place + +`cursorPageUp` and `cursorPageDown` now scroll the view by the amount that the cursor moved. + +## 0.19.6 (2021-12-10) + +### Bug fixes + +The standard keymap no longer overrides Shift-Delete, in order to allow the native behavior of that key to happen on platforms that support it. + +## 0.19.5 (2021-09-21) + +### New features + +Adds an `insertBlankLine` command which creates an empty line below the selection, and binds it to Mod-Enter in the default keymap. + +## 0.19.4 (2021-09-13) + +### Bug fixes + +Make commands that affect the editor's content check `state.readOnly` and return false when that is true. + +## 0.19.3 (2021-09-09) + +### Bug fixes + +Make by-line cursor motion commands move the cursor to the start/end of the document when they hit the first/last line. + +Fix a bug where `deleteCharForward`/`Backward` behaved incorrectly when deleting directly before or after an atomic range. + +## 0.19.2 (2021-08-24) + +### New features + +New commands `cursorSubwordForward`, `cursorSubwordBackward`, `selectSubwordForward`, and `selectSubwordBackward` which implement motion by camel case subword. + +## 0.19.1 (2021-08-11) + +### Bug fixes + +Fix incorrect versions for @lezer dependencies. + +## 0.19.0 (2021-08-11) + +### Breaking changes + +Change default binding for backspace to `deleteCharBackward`, drop `deleteCodePointBackward`/`Forward` from the library. + +`defaultTabBinding` was removed. + +### Bug fixes + +Drop Alt-d, Alt-f, and Alt-b bindings from `emacsStyleKeymap` (and thus from the default macOS bindings). + +`deleteCharBackward` and `deleteCharForward` now take atomic ranges into account. + +### New features + +Attach more granular user event strings to transactions. + +The module exports a new binding `indentWithTab` that binds tab and shift-tab to `indentMore` and `indentLess`. + +## 0.18.3 (2021-06-11) + +### Bug fixes + +`moveLineDown` will no longer incorrectly grow the selection. + +Line-based commands will no longer include lines where a range selection ends right at the start of the line. + +## 0.18.2 (2021-05-06) + +### Bug fixes + +Use Ctrl-l, not Alt-l, to bind `selectLine` on macOS, to avoid conflicting with special-character-insertion bindings. + +Make the macOS Command-ArrowLeft/Right commands behave more like their native versions. + +## 0.18.1 (2021-04-08) + +### Bug fixes + +Also bind Shift-Backspace and Shift-Delete in the default keymap (to do the same thing as the Shift-less binding). + +### New features + +Adds a `deleteToLineStart` command. + +Adds bindings for Cmd-Delete and Cmd-Backspace on macOS. + +## 0.18.0 (2021-03-03) + +### Breaking changes + +Update dependencies to 0.18. + +## 0.17.5 (2021-02-25) + +### Bug fixes + +Use Alt-l for the default `selectLine` binding, because Mod-l already has an important meaning in the browser. + +Make `deleteGroupBackward`/`deleteGroupForward` delete groups of whitespace when bigger than a single space. + +Don't change lines that have the end of a range selection directly at their start in `indentLess`, `indentMore`, and `indentSelection`. + +## 0.17.4 (2021-02-18) + +### Bug fixes + +Fix a bug where `deleteToLineEnd` would delete the rest of the document when at the end of a line. + +## 0.17.3 (2021-02-16) + +### Bug fixes + +Fix an issue where `insertNewlineAndIndent` behaved strangely with the cursor between brackets that sat on different lines. + +## 0.17.2 (2021-01-22) + +### New features + +The new `insertTab` command inserts a tab when nothing is selected, and defers to `indentMore` otherwise. + +The package now exports a `defaultTabBinding` object that provides a recommended binding for tab (if you must bind tab). + +## 0.17.1 (2021-01-06) + +### New features + +The package now also exports a CommonJS module. + +## 0.17.0 (2020-12-29) + +### Breaking changes + +First numbered release. + diff --git a/node_modules/@codemirror/commands/LICENSE b/node_modules/@codemirror/commands/LICENSE new file mode 100644 index 0000000000..3af12e62d9 --- /dev/null +++ b/node_modules/@codemirror/commands/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (C) 2018-2021 by Marijn Haverbeke and others + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/node_modules/@codemirror/commands/README.md b/node_modules/@codemirror/commands/README.md new file mode 100644 index 0000000000..889ec26b9e --- /dev/null +++ b/node_modules/@codemirror/commands/README.md @@ -0,0 +1,18 @@ +# @codemirror/commands [![NPM version](https://img.shields.io/npm/v/@codemirror/commands.svg)](https://www.npmjs.org/package/@codemirror/commands) + +[ [**WEBSITE**](https://codemirror.net/6/) | [**DOCS**](https://codemirror.net/6/docs/ref/#commands) | [**ISSUES**](https://github.com/codemirror/codemirror.next/issues) | [**FORUM**](https://discuss.codemirror.net/c/next/) | [**CHANGELOG**](https://github.com/codemirror/commands/blob/main/CHANGELOG.md) ] + +This package implements a collection of editing commands for the +[CodeMirror](https://codemirror.net/6/) code editor. + +The [project page](https://codemirror.net/6/) has more information, a +number of [examples](https://codemirror.net/6/examples/) and the +[documentation](https://codemirror.net/6/docs/). + +This code is released under an +[MIT license](https://github.com/codemirror/commands/tree/main/LICENSE). + +We aim to be an inclusive, welcoming community. To make that explicit, +we have a [code of +conduct](http://contributor-covenant.org/version/1/1/0/) that applies +to communication around the project. diff --git a/node_modules/@codemirror/commands/dist/index.cjs b/node_modules/@codemirror/commands/dist/index.cjs new file mode 100644 index 0000000000..6d03a7405f --- /dev/null +++ b/node_modules/@codemirror/commands/dist/index.cjs @@ -0,0 +1,1631 @@ +'use strict'; + +Object.defineProperty(exports, '__esModule', { value: true }); + +var state = require('@codemirror/state'); +var view = require('@codemirror/view'); +var language = require('@codemirror/language'); +var common = require('@lezer/common'); + +/** +Comment or uncomment the current selection. Will use line comments +if available, otherwise falling back to block comments. +*/ +const toggleComment = target => { + let config = getConfig(target.state); + 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 = command(changeLineComment, 0 /* Toggle */); +/** +Comment the current selection using line comments. +*/ +const lineComment = command(changeLineComment, 1 /* Comment */); +/** +Uncomment the current selection using line comments. +*/ +const lineUncomment = command(changeLineComment, 2 /* 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 = command(changeBlockComment, 0 /* Toggle */); +/** +Comment the current selection using block comments. +*/ +const blockComment = command(changeBlockComment, 1 /* Comment */); +/** +Uncomment the current selection using block comments. +*/ +const blockUncomment = command(changeBlockComment, 2 /* Uncomment */); +/** +Comment or uncomment the lines around the current selection using +block comments. +*/ +const toggleBlockCommentByLine = command((o, s) => changeBlockComment(o, s, selectedLineRanges(s)), 0 /* Toggle */); +function getConfig(state, pos = state.selection.main.head) { + let data = state.languageDataAt("commentTokens", pos); + 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); + let last = ranges.length - 1; + if (last >= 0 && ranges[last].to > fromLine.from) + ranges[last].to = toLine.to; + else + ranges.push({ from: fromLine.from, 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 /* 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 /* 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; + 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 token = getConfig(state, pos).line; + if (!token) + continue; + 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 /* 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 /* 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 = state.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 = state.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 = state.Facet.define(); +const historyConfig = state.Facet.define({ + combine(configs) { + return state.combineConfig(configs, { + minDepth: 100, + newGroupDelay: 500 + }, { minDepth: Math.max, newGroupDelay: Math.min }); + } +}); +function changeEnd(changes) { + let end = 0; + changes.iterChangedRanges((_, to) => end = to); + return end; +} +const historyField_ = state.StateField.define({ + create() { + return HistoryState.empty; + }, + update(state$1, tr) { + let config = tr.state.facet(historyConfig); + let fromHist = tr.annotation(fromHistory); + if (fromHist) { + let selection = tr.docChanged ? state.EditorSelection.single(changeEnd(tr.changes)) : undefined; + let item = HistEvent.fromTransaction(tr, selection), from = fromHist.side; + let other = from == 0 /* Done */ ? state$1.undone : state$1.done; + if (item) + other = updateBranch(other, other.length, config.minDepth, item); + else + other = addSelection(other, tr.startState.selection); + return new HistoryState(from == 0 /* Done */ ? fromHist.rest : other, from == 0 /* Done */ ? other : fromHist.rest); + } + let isolate = tr.annotation(isolateHistory); + if (isolate == "full" || isolate == "before") + state$1 = state$1.isolate(); + if (tr.annotation(state.Transaction.addToHistory) === false) + return !tr.changes.empty ? state$1.addMapping(tr.changes.desc) : state$1; + let event = HistEvent.fromTransaction(tr); + let time = tr.annotation(state.Transaction.time), userEvent = tr.annotation(state.Transaction.userEvent); + if (event) + state$1 = state$1.addChanges(event, time, userEvent, config.newGroupDelay, config.minDepth); + else if (tr.selection) + state$1 = state$1.addSelection(tr.startState.selection, time, userEvent, config.newGroupDelay); + if (isolate == "full" || isolate == "after") + state$1 = state$1.isolate(); + return state$1; + }, + 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), + view.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 = 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 = cmd(0 /* Done */, false); +/** +Redo a group of history events. Returns false if no group was +available. +*/ +const redo = cmd(1 /* Undone */, false); +/** +Undo a change or selection change. +*/ +const undoSelection = cmd(0 /* Done */, true); +/** +Redo a change or selection change. +*/ +const redoSelection = cmd(1 /* Undone */, true); +function depth(side) { + return function (state) { + let histState = state.field(historyField_, false); + if (!histState) + return 0; + let branch = side == 0 /* 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 = depth(0 /* Done */); +/** +The amount of redoable change events available in a given state. +*/ +const redoDepth = depth(1 /* 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, 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 && state.ChangeSet.fromJSON(json.changes), [], json.mapped && state.ChangeDesc.fromJSON(json.mapped), json.startSelection && state.EditorSelection.fromJSON(json.startSelection), json.selectionsAfter.map(state.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, state.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, newGroupDelay, maxLen) { + 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 < newGroupDelay && + 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, maxLen, new HistEvent(event.changes.compose(lastEvent.changes), conc(event.effects, lastEvent.effects), lastEvent.mapped, lastEvent.startSelection, none)); + } + else { + done = updateBranch(done, done.length, maxLen, 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, selection) { + let branch = side == 0 /* Done */ ? this.done : this.undone; + if (branch.length == 0) + return null; + let event = branch[branch.length - 1]; + if (selection && event.selectionsAfter.length) { + return state.update({ + selection: event.selectionsAfter[event.selectionsAfter.length - 1], + annotations: fromHistory.of({ side, rest: popSelection(branch) }), + userEvent: side == 0 /* 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 }), + filter: false, + userEvent: side == 0 /* Done */ ? "undo" : "redo", + scrollIntoView: true + }); + } + } +} +HistoryState.empty = 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): [`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 }, + { key: "Mod-u", run: undoSelection, preventDefault: true }, + { key: "Alt-u", mac: "Mod-Shift-u", run: redoSelection, preventDefault: true } +]; + +function updateSel(sel, by) { + return state.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)) + return false; + dispatch(setSel(state, selection)); + return true; +} +function rangeEnd(range, forward) { + return state.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$1) { + return view$1.textDirectionAt(view$1.state.selection.main.head) == view.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 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 moveBySubword(view, range, forward) { + let categorize = view.state.charCategorizer(range.from); + return view.moveByChar(range, forward, start => { + let cat = state.CharCategory.Space, pos = range.from; + 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 (cat == state.CharCategory.Space) + cat = nextCat; + if (cat != nextCat) + return false; + if (cat == state.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)) == state.CharCategory.Word && + ahead.toLowerCase() == ahead) + return false; + sawUpper = true; + } + } + return true; + }; + step(start); + return step; + }); +} +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$1, start, forward) { + let pos = language.syntaxTree(state$1).resolveInner(start.head); + let bracketProp = forward ? common.NodeProp.closedBy : common.NodeProp.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$1, next, bracketProp)) + pos = next; + else + at = forward ? next.to : next.from; + } + let bracket = pos.type.prop(bracketProp), match, newPos; + if (bracket && (match = forward ? language.matchBrackets(state$1, pos.from, 1) : language.matchBrackets(state$1, pos.to, -1)) && match.matched) + newPos = forward ? match.end.to : match.end.from; + else + newPos = forward ? pos.to : pos.from; + return state.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 pageHeight(view) { + return Math.max(view.defaultLineHeight, Math.min(view.dom.clientHeight, innerHeight) - 5); +} +function cursorByPage(view$1, forward) { + let { state } = view$1, selection = updateSel(state.selection, range => { + return range.empty ? view$1.moveVertically(range, forward, pageHeight(view$1)) : rangeEnd(range, forward); + }); + if (selection.eq(state.selection)) + return false; + let startPos = view$1.coordsAtPos(state.selection.main.head); + let scrollRect = view$1.scrollDOM.getBoundingClientRect(); + let effect; + if (startPos && startPos.top > scrollRect.top && startPos.bottom < scrollRect.bottom && + startPos.top - scrollRect.top <= view$1.scrollDOM.scrollHeight - view$1.scrollDOM.scrollTop - view$1.scrollDOM.clientHeight) + effect = view.EditorView.scrollIntoView(selection.main.head, { y: "start", yMargin: startPos.top - scrollRect.top }); + view$1.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 = state.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 to the start of the line. +*/ +const cursorLineStart = view => moveSel(view, range => state.EditorSelection.cursor(view.lineBlockAt(range.head).from, 1)); +/** +Move the selection to the end of the line. +*/ +const cursorLineEnd = view => moveSel(view, range => state.EditorSelection.cursor(view.lineBlockAt(range.head).to, -1)); +function toMatchingBracket(state$1, dispatch, extend) { + let found = false, selection = updateSel(state$1.selection, range => { + let matching = language.matchBrackets(state$1, range.head, -1) + || language.matchBrackets(state$1, range.head, 1) + || (range.head > 0 && language.matchBrackets(state$1, range.head - 1, 1)) + || (range.head < state$1.doc.length && language.matchBrackets(state$1, 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 ? state.EditorSelection.range(range.anchor, head) : state.EditorSelection.cursor(head); + }); + if (!found) + return false; + dispatch(setSel(state$1, 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(view, how) { + let selection = updateSel(view.state.selection, range => { + let head = how(range); + return state.EditorSelection.range(range.anchor, head.head, head.goalColumn); + }); + if (selection.eq(view.state.selection)) + return false; + view.dispatch(setSel(view.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); +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); +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, pageHeight(view))); +} +/** +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 to the start of the line. +*/ +const selectLineStart = view => extendSel(view, range => state.EditorSelection.cursor(view.lineBlockAt(range.head).from)); +/** +Move the selection head to the end of the line. +*/ +const selectLineEnd = view => extendSel(view, range => state.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: state$1, dispatch }) => { + let ranges = selectedLineBlocks(state$1).map(({ from, to }) => state.EditorSelection.range(from, Math.min(to + 1, state$1.doc.length))); + dispatch(state$1.update({ selection: state.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: state$1, dispatch }) => { + let selection = updateSel(state$1.selection, range => { + var _a; + let context = language.syntaxTree(state$1).resolveInner(range.head, 1); + while (!((context.from < range.from && context.to >= range.to) || + (context.to > range.to && context.from <= range.from) || + !((_a = context.parent) === null || _a === void 0 ? void 0 : _a.parent))) + context = context.parent; + return state.EditorSelection.range(context.to, context.from); + }); + dispatch(setSel(state$1, selection)); + return 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: state$1, dispatch }) => { + let cur = state$1.selection, selection = null; + if (cur.ranges.length > 1) + selection = state.EditorSelection.create([cur.main]); + else if (!cur.main.empty) + selection = state.EditorSelection.create([state.EditorSelection.cursor(cur.main.head)]); + if (!selection) + return false; + dispatch(setSel(state$1, selection)); + return true; +}; +function deleteBy({ state: state$1, dispatch }, by) { + if (state$1.readOnly) + return false; + let event = "delete.selection"; + let changes = state$1.changeByRange(range => { + let { from, to } = range; + if (from == to) { + let towards = by(from); + if (towards < from) + event = "delete.backward"; + else if (towards > from) + event = "delete.forward"; + from = Math.min(from, towards); + to = Math.max(to, towards); + } + return from == to ? { range } : { changes: { from, to }, range: state.EditorSelection.cursor(from) }; + }); + if (changes.changes.empty) + return false; + dispatch(state$1.update(changes, { scrollIntoView: true, userEvent: event })); + return true; +} +function skipAtomic(target, pos, forward) { + if (target instanceof view.EditorView) + for (let ranges of target.state.facet(view.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) => deleteBy(target, pos => { + let { state: state$1 } = target, line = state$1.doc.lineAt(pos), before, targetPos; + if (!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 = state.countColumn(before, state$1.tabSize), drop = col % language.getIndentUnit(state$1) || language.getIndentUnit(state$1); + for (let i = 0; i < drop && before[before.length - 1 - i] == " "; i++) + pos--; + targetPos = pos; + } + else { + targetPos = state.findClusterBreak(line.text, pos - line.from, forward, forward) + line.from; + if (targetPos == pos && line.number != (forward ? state$1.doc.lines : 1)) + targetPos += forward ? 1 : -1; + } + return skipAtomic(target, targetPos, forward); +}); +/** +Delete the selection, or, for cursor selections, the character +before the cursor. +*/ +const deleteCharBackward = view => deleteByChar(view, false); +/** +Delete the selection or the character after the cursor. +*/ +const deleteCharForward = view => deleteByChar(view, true); +const deleteByGroup = (target, forward) => deleteBy(target, start => { + let pos = start, { state: state$1 } = target, line = state$1.doc.lineAt(pos); + let categorize = state$1.charCategorizer(pos); + for (let cat = null;;) { + if (pos == (forward ? line.to : line.from)) { + if (pos == start && line.number != (forward ? state$1.doc.lines : 1)) + pos += forward ? 1 : -1; + break; + } + let next = state.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 != start) + cat = nextCat; + pos = next; + } + return skipAtomic(target, pos, forward); +}); +/** +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); +/** +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, pos => { + let lineEnd = view.lineBlockAt(pos).to; + return skipAtomic(view, pos < lineEnd ? lineEnd : Math.min(view.state.doc.length, pos + 1), true); +}); +/** +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, pos => { + let lineStart = view.lineBlockAt(pos).from; + return skipAtomic(view, pos > lineStart ? lineStart : Math.max(0, pos - 1), false); +}); +/** +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: state$1, dispatch }) => { + if (state$1.readOnly) + return false; + let changes = state$1.changeByRange(range => { + return { changes: { from: range.from, to: range.to, insert: state.Text.of(["", ""]) }, + range: state.EditorSelection.cursor(range.from) }; + }); + dispatch(state$1.update(changes, { scrollIntoView: true, userEvent: "input" })); + return true; +}; +/** +Flip the characters before and after the cursor(s). +*/ +const transposeChars = ({ state: state$1, dispatch }) => { + if (state$1.readOnly) + return false; + let changes = state$1.changeByRange(range => { + if (!range.empty || range.from == 0 || range.from == state$1.doc.length) + return { range }; + let pos = range.from, line = state$1.doc.lineAt(pos); + let from = pos == line.from ? pos - 1 : state.findClusterBreak(line.text, pos - line.from, false) + line.from; + let to = pos == line.to ? pos + 1 : state.findClusterBreak(line.text, pos - line.from, true) + line.from; + return { changes: { from, to, insert: state$1.doc.slice(pos, to).append(state$1.doc.slice(from, pos)) }, + range: state.EditorSelection.cursor(to) }; + }); + if (changes.changes.empty) + return false; + dispatch(state$1.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$1, dispatch, forward) { + if (state$1.readOnly) + return false; + let changes = [], ranges = []; + for (let block of selectedLineBlocks(state$1)) { + if (forward ? block.to == state$1.doc.length : block.from == 0) + continue; + let nextLine = state$1.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$1.lineBreak }); + for (let r of block.ranges) + ranges.push(state.EditorSelection.range(Math.min(state$1.doc.length, r.anchor + size), Math.min(state$1.doc.length, r.head + size))); + } + else { + changes.push({ from: nextLine.from, to: block.from }, { from: block.to, insert: state$1.lineBreak + nextLine.text }); + for (let r of block.ranges) + ranges.push(state.EditorSelection.range(r.anchor - size, r.head - size)); + } + } + if (!changes.length) + return false; + dispatch(state$1.update({ + changes, + scrollIntoView: true, + selection: state.EditorSelection.create(ranges, state$1.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 => view.moveVertically(range, true)).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; +}; +function isBetweenBrackets(state, pos) { + if (/\(\)|\[\]|\{\}/.test(state.sliceDoc(pos - 1, pos + 1))) + return { from: pos, to: pos }; + let context = language.syntaxTree(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(common.NodeProp.closedBy)) && closedBy.indexOf(after.name) > -1 && + state.doc.lineAt(before.to).from == state.doc.lineAt(after.from).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 = newlineAndIndent(false); +/** +Create a blank, indented line below the current line. +*/ +const insertBlankLine = newlineAndIndent(true); +function newlineAndIndent(atEof) { + return ({ state: state$1, dispatch }) => { + if (state$1.readOnly) + return false; + let changes = state$1.changeByRange(range => { + let { from, to } = range, line = state$1.doc.lineAt(from); + let explode = !atEof && from == to && isBetweenBrackets(state$1, from); + if (atEof) + from = to = (to <= line.to ? line : state$1.doc.lineAt(to)).to; + let cx = new language.IndentContext(state$1, { simulateBreak: from, simulateDoubleBreak: !!explode }); + let indent = language.getIndentation(cx, from); + if (indent == null) + indent = /^\s*/.exec(state$1.doc.lineAt(from).text)[0].length; + 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 = ["", language.indentString(state$1, indent)]; + if (explode) + insert.push(language.indentString(state$1, cx.lineIndent(line.from, -1))); + return { changes: { from, to, insert: state.Text.of(insert) }, + range: state.EditorSelection.cursor(from + 1 + insert[1].length) }; + }); + dispatch(state$1.update(changes, { scrollIntoView: true, userEvent: "input" })); + return true; + }; +} +function changeBySelectedLine(state$1, f) { + let atLine = -1; + return state$1.changeByRange(range => { + let changes = []; + for (let pos = range.from; pos <= range.to;) { + let line = state$1.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$1.changes(changes); + return { changes, + range: state.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 language.IndentContext(state, { overrideIndentation: start => { + let found = updated[start]; + return found == null ? -1 : found; + } }); + let changes = changeBySelectedLine(state, (line, changes, range) => { + let indent = language.getIndentation(context, line.from); + if (indent == null) + return; + if (!/\S/.test(line.text)) + indent = 0; + let cur = /^\s*/.exec(line.text)[0]; + let norm = language.indentString(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(language.indentUnit) }); + }), { 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: state$1, dispatch }) => { + if (state$1.readOnly) + return false; + dispatch(state$1.update(changeBySelectedLine(state$1, (line, changes) => { + let space = /^\s*/.exec(line.text)[0]; + if (!space) + return; + let col = state.countColumn(space, state$1.tabSize), keep = 0; + let insert = language.indentString(state$1, Math.max(0, col - language.getIndentUnit(state$1))); + 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; +}; +/** +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: [`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): [`deleteToLineStart`](https://codemirror.net/6/docs/ref/#commands.deleteToLineStart). + - Cmd-Delete (macOS): [`deleteToLineEnd`](https://codemirror.net/6/docs/ref/#commands.deleteToLineEnd). +*/ +const standardKeymap = [ + { key: "ArrowLeft", run: cursorCharLeft, shift: selectCharLeft, preventDefault: true }, + { key: "Mod-ArrowLeft", mac: "Alt-ArrowLeft", run: cursorGroupLeft, shift: selectGroupLeft }, + { mac: "Cmd-ArrowLeft", run: cursorLineBoundaryBackward, shift: selectLineBoundaryBackward }, + { key: "ArrowRight", run: cursorCharRight, shift: selectCharRight, preventDefault: true }, + { key: "Mod-ArrowRight", mac: "Alt-ArrowRight", run: cursorGroupRight, shift: selectGroupRight }, + { mac: "Cmd-ArrowRight", run: cursorLineBoundaryForward, shift: selectLineBoundaryForward }, + { 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 }, + { key: "Mod-a", run: selectAll }, + { key: "Backspace", run: deleteCharBackward, shift: deleteCharBackward }, + { key: "Delete", run: deleteCharForward }, + { key: "Mod-Backspace", mac: "Alt-Backspace", run: deleteGroupBackward }, + { key: "Mod-Delete", mac: "Alt-Delete", run: deleteGroupForward }, + { mac: "Mod-Backspace", run: deleteToLineStart }, + { mac: "Mod-Delete", run: deleteToLineEnd } +].concat(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) +- Escape: [`simplifySelection`](https://codemirror.net/6/docs/ref/#commands.simplifySelection) +- Ctrl-Enter (Comd-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). +*/ +const defaultKeymap = [ + { 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: "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 } +].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 }; + +exports.blockComment = blockComment; +exports.blockUncomment = blockUncomment; +exports.copyLineDown = copyLineDown; +exports.copyLineUp = copyLineUp; +exports.cursorCharBackward = cursorCharBackward; +exports.cursorCharForward = cursorCharForward; +exports.cursorCharLeft = cursorCharLeft; +exports.cursorCharRight = cursorCharRight; +exports.cursorDocEnd = cursorDocEnd; +exports.cursorDocStart = cursorDocStart; +exports.cursorGroupBackward = cursorGroupBackward; +exports.cursorGroupForward = cursorGroupForward; +exports.cursorGroupLeft = cursorGroupLeft; +exports.cursorGroupRight = cursorGroupRight; +exports.cursorLineBoundaryBackward = cursorLineBoundaryBackward; +exports.cursorLineBoundaryForward = cursorLineBoundaryForward; +exports.cursorLineDown = cursorLineDown; +exports.cursorLineEnd = cursorLineEnd; +exports.cursorLineStart = cursorLineStart; +exports.cursorLineUp = cursorLineUp; +exports.cursorMatchingBracket = cursorMatchingBracket; +exports.cursorPageDown = cursorPageDown; +exports.cursorPageUp = cursorPageUp; +exports.cursorSubwordBackward = cursorSubwordBackward; +exports.cursorSubwordForward = cursorSubwordForward; +exports.cursorSyntaxLeft = cursorSyntaxLeft; +exports.cursorSyntaxRight = cursorSyntaxRight; +exports.defaultKeymap = defaultKeymap; +exports.deleteCharBackward = deleteCharBackward; +exports.deleteCharForward = deleteCharForward; +exports.deleteGroupBackward = deleteGroupBackward; +exports.deleteGroupForward = deleteGroupForward; +exports.deleteLine = deleteLine; +exports.deleteToLineEnd = deleteToLineEnd; +exports.deleteToLineStart = deleteToLineStart; +exports.deleteTrailingWhitespace = deleteTrailingWhitespace; +exports.emacsStyleKeymap = emacsStyleKeymap; +exports.history = history; +exports.historyField = historyField; +exports.historyKeymap = historyKeymap; +exports.indentLess = indentLess; +exports.indentMore = indentMore; +exports.indentSelection = indentSelection; +exports.indentWithTab = indentWithTab; +exports.insertBlankLine = insertBlankLine; +exports.insertNewline = insertNewline; +exports.insertNewlineAndIndent = insertNewlineAndIndent; +exports.insertTab = insertTab; +exports.invertedEffects = invertedEffects; +exports.isolateHistory = isolateHistory; +exports.lineComment = lineComment; +exports.lineUncomment = lineUncomment; +exports.moveLineDown = moveLineDown; +exports.moveLineUp = moveLineUp; +exports.redo = redo; +exports.redoDepth = redoDepth; +exports.redoSelection = redoSelection; +exports.selectAll = selectAll; +exports.selectCharBackward = selectCharBackward; +exports.selectCharForward = selectCharForward; +exports.selectCharLeft = selectCharLeft; +exports.selectCharRight = selectCharRight; +exports.selectDocEnd = selectDocEnd; +exports.selectDocStart = selectDocStart; +exports.selectGroupBackward = selectGroupBackward; +exports.selectGroupForward = selectGroupForward; +exports.selectGroupLeft = selectGroupLeft; +exports.selectGroupRight = selectGroupRight; +exports.selectLine = selectLine; +exports.selectLineBoundaryBackward = selectLineBoundaryBackward; +exports.selectLineBoundaryForward = selectLineBoundaryForward; +exports.selectLineDown = selectLineDown; +exports.selectLineEnd = selectLineEnd; +exports.selectLineStart = selectLineStart; +exports.selectLineUp = selectLineUp; +exports.selectMatchingBracket = selectMatchingBracket; +exports.selectPageDown = selectPageDown; +exports.selectPageUp = selectPageUp; +exports.selectParentSyntax = selectParentSyntax; +exports.selectSubwordBackward = selectSubwordBackward; +exports.selectSubwordForward = selectSubwordForward; +exports.selectSyntaxLeft = selectSyntaxLeft; +exports.selectSyntaxRight = selectSyntaxRight; +exports.simplifySelection = simplifySelection; +exports.splitLine = splitLine; +exports.standardKeymap = standardKeymap; +exports.toggleBlockComment = toggleBlockComment; +exports.toggleBlockCommentByLine = toggleBlockCommentByLine; +exports.toggleComment = toggleComment; +exports.toggleLineComment = toggleLineComment; +exports.transposeChars = transposeChars; +exports.undo = undo; +exports.undoDepth = undoDepth; +exports.undoSelection = undoSelection; diff --git a/node_modules/@codemirror/commands/dist/index.d.ts b/node_modules/@codemirror/commands/dist/index.d.ts new file mode 100644 index 0000000000..e7115deb01 --- /dev/null +++ b/node_modules/@codemirror/commands/dist/index.d.ts @@ -0,0 +1,543 @@ +import * as _codemirror_state from '@codemirror/state'; +import { StateCommand, Facet, Transaction, StateEffect, Extension, StateField, EditorState } from '@codemirror/state'; +import { KeyBinding, Command } from '@codemirror/view'; + +/** +An object of this type can be provided as [language +data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) under a `"commentTokens"` +property to configure comment syntax for a language. +*/ +interface CommentTokens { + /** + The block comment syntax, if any. For example, for HTML + you'd provide `{open: ""}`. + */ + block?: { + open: string; + close: string; + }; + /** + The line comment syntax. For example `"//"`. + */ + line?: string; +} +/** +Comment or uncomment the current selection. Will use line comments +if available, otherwise falling back to block comments. +*/ +declare const toggleComment: StateCommand; +/** +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). +*/ +declare const toggleLineComment: StateCommand; +/** +Comment the current selection using line comments. +*/ +declare const lineComment: StateCommand; +/** +Uncomment the current selection using line comments. +*/ +declare const lineUncomment: StateCommand; +/** +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). +*/ +declare const toggleBlockComment: StateCommand; +/** +Comment the current selection using block comments. +*/ +declare const blockComment: StateCommand; +/** +Uncomment the current selection using block comments. +*/ +declare const blockUncomment: StateCommand; +/** +Comment or uncomment the lines around the current selection using +block comments. +*/ +declare const toggleBlockCommentByLine: StateCommand; + +/** +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. +*/ +declare const isolateHistory: _codemirror_state.AnnotationType<"after" | "before" | "full">; +/** +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). +*/ +declare const invertedEffects: Facet<(tr: Transaction) => readonly StateEffect[], readonly ((tr: Transaction) => readonly StateEffect[])[]>; +interface HistoryConfig { + /** + The minimum depth (amount of events) to store. Defaults to 100. + */ + minDepth?: number; + /** + The maximum time (in milliseconds) that adjacent events can be + apart and still be grouped together. Defaults to 500. + */ + newGroupDelay?: number; +} +/** +Create a history extension with the given configuration. +*/ +declare function history(config?: HistoryConfig): Extension; +/** +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. +*/ +declare const historyField: StateField; +/** +Undo a single group of history events. Returns false if no group +was available. +*/ +declare const undo: StateCommand; +/** +Redo a group of history events. Returns false if no group was +available. +*/ +declare const redo: StateCommand; +/** +Undo a change or selection change. +*/ +declare const undoSelection: StateCommand; +/** +Redo a change or selection change. +*/ +declare const redoSelection: StateCommand; +/** +The amount of undoable change events available in a given state. +*/ +declare const undoDepth: (state: EditorState) => number; +/** +The amount of redoable change events available in a given state. +*/ +declare const redoDepth: (state: EditorState) => number; +/** +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): [`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). +*/ +declare const historyKeymap: readonly KeyBinding[]; + +/** +Move the selection one character to the left (which is backward in +left-to-right text, forward in right-to-left text). +*/ +declare const cursorCharLeft: Command; +/** +Move the selection one character to the right. +*/ +declare const cursorCharRight: Command; +/** +Move the selection one character forward. +*/ +declare const cursorCharForward: Command; +/** +Move the selection one character backward. +*/ +declare const cursorCharBackward: Command; +/** +Move the selection to the left across one group of word or +non-word (but also non-space) characters. +*/ +declare const cursorGroupLeft: Command; +/** +Move the selection one group to the right. +*/ +declare const cursorGroupRight: Command; +/** +Move the selection one group forward. +*/ +declare const cursorGroupForward: Command; +/** +Move the selection one group backward. +*/ +declare const cursorGroupBackward: Command; +/** +Move the selection one group or camel-case subword forward. +*/ +declare const cursorSubwordForward: Command; +/** +Move the selection one group or camel-case subword backward. +*/ +declare const cursorSubwordBackward: Command; +/** +Move the cursor over the next syntactic element to the left. +*/ +declare const cursorSyntaxLeft: Command; +/** +Move the cursor over the next syntactic element to the right. +*/ +declare const cursorSyntaxRight: Command; +/** +Move the selection one line up. +*/ +declare const cursorLineUp: Command; +/** +Move the selection one line down. +*/ +declare const cursorLineDown: Command; +/** +Move the selection one page up. +*/ +declare const cursorPageUp: Command; +/** +Move the selection one page down. +*/ +declare const cursorPageDown: Command; +/** +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. +*/ +declare const cursorLineBoundaryForward: Command; +/** +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. +*/ +declare const cursorLineBoundaryBackward: Command; +/** +Move the selection to the start of the line. +*/ +declare const cursorLineStart: Command; +/** +Move the selection to the end of the line. +*/ +declare const cursorLineEnd: Command; +/** +Move the selection to the bracket matching the one it is currently +on, if any. +*/ +declare const cursorMatchingBracket: StateCommand; +/** +Extend the selection to the bracket matching the one the selection +head is currently on, if any. +*/ +declare const selectMatchingBracket: StateCommand; +/** +Move the selection head one character to the left, while leaving +the anchor in place. +*/ +declare const selectCharLeft: Command; +/** +Move the selection head one character to the right. +*/ +declare const selectCharRight: Command; +/** +Move the selection head one character forward. +*/ +declare const selectCharForward: Command; +/** +Move the selection head one character backward. +*/ +declare const selectCharBackward: Command; +/** +Move the selection head one [group](https://codemirror.net/6/docs/ref/#commands.cursorGroupLeft) to +the left. +*/ +declare const selectGroupLeft: Command; +/** +Move the selection head one group to the right. +*/ +declare const selectGroupRight: Command; +/** +Move the selection head one group forward. +*/ +declare const selectGroupForward: Command; +/** +Move the selection head one group backward. +*/ +declare const selectGroupBackward: Command; +/** +Move the selection head one group or camel-case subword forward. +*/ +declare const selectSubwordForward: Command; +/** +Move the selection head one group or subword backward. +*/ +declare const selectSubwordBackward: Command; +/** +Move the selection head over the next syntactic element to the left. +*/ +declare const selectSyntaxLeft: Command; +/** +Move the selection head over the next syntactic element to the right. +*/ +declare const selectSyntaxRight: Command; +/** +Move the selection head one line up. +*/ +declare const selectLineUp: Command; +/** +Move the selection head one line down. +*/ +declare const selectLineDown: Command; +/** +Move the selection head one page up. +*/ +declare const selectPageUp: Command; +/** +Move the selection head one page down. +*/ +declare const selectPageDown: Command; +/** +Move the selection head to the next line boundary. +*/ +declare const selectLineBoundaryForward: Command; +/** +Move the selection head to the previous line boundary. +*/ +declare const selectLineBoundaryBackward: Command; +/** +Move the selection head to the start of the line. +*/ +declare const selectLineStart: Command; +/** +Move the selection head to the end of the line. +*/ +declare const selectLineEnd: Command; +/** +Move the selection to the start of the document. +*/ +declare const cursorDocStart: StateCommand; +/** +Move the selection to the end of the document. +*/ +declare const cursorDocEnd: StateCommand; +/** +Move the selection head to the start of the document. +*/ +declare const selectDocStart: StateCommand; +/** +Move the selection head to the end of the document. +*/ +declare const selectDocEnd: StateCommand; +/** +Select the entire document. +*/ +declare const selectAll: StateCommand; +/** +Expand the selection to cover entire lines. +*/ +declare const selectLine: StateCommand; +/** +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. +*/ +declare const selectParentSyntax: StateCommand; +/** +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. +*/ +declare const simplifySelection: StateCommand; +/** +Delete the selection, or, for cursor selections, the character +before the cursor. +*/ +declare const deleteCharBackward: Command; +/** +Delete the selection or the character after the cursor. +*/ +declare const deleteCharForward: Command; +/** +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. +*/ +declare const deleteGroupBackward: StateCommand; +/** +Delete the selection or forward until the end of the next group. +*/ +declare const deleteGroupForward: StateCommand; +/** +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. +*/ +declare const deleteToLineEnd: Command; +/** +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. +*/ +declare const deleteToLineStart: Command; +/** +Delete all whitespace directly before a line end from the +document. +*/ +declare const deleteTrailingWhitespace: StateCommand; +/** +Replace each selection range with a line break, leaving the cursor +on the line before the break. +*/ +declare const splitLine: StateCommand; +/** +Flip the characters before and after the cursor(s). +*/ +declare const transposeChars: StateCommand; +/** +Move the selected lines up one line. +*/ +declare const moveLineUp: StateCommand; +/** +Move the selected lines down one line. +*/ +declare const moveLineDown: StateCommand; +/** +Create a copy of the selected lines. Keep the selection in the top copy. +*/ +declare const copyLineUp: StateCommand; +/** +Create a copy of the selected lines. Keep the selection in the bottom copy. +*/ +declare const copyLineDown: StateCommand; +/** +Delete selected lines. +*/ +declare const deleteLine: Command; +/** +Replace the selection with a newline. +*/ +declare const insertNewline: StateCommand; +/** +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. +*/ +declare const insertNewlineAndIndent: StateCommand; +/** +Create a blank, indented line below the current line. +*/ +declare const insertBlankLine: StateCommand; +/** +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. +*/ +declare const indentSelection: StateCommand; +/** +Add a [unit](https://codemirror.net/6/docs/ref/#language.indentUnit) of indentation to all selected +lines. +*/ +declare const indentMore: StateCommand; +/** +Remove a [unit](https://codemirror.net/6/docs/ref/#language.indentUnit) of indentation from all +selected lines. +*/ +declare const indentLess: StateCommand; +/** +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. +*/ +declare const insertTab: StateCommand; +/** +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) +*/ +declare const emacsStyleKeymap: readonly KeyBinding[]; +/** +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: [`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): [`deleteToLineStart`](https://codemirror.net/6/docs/ref/#commands.deleteToLineStart). + - Cmd-Delete (macOS): [`deleteToLineEnd`](https://codemirror.net/6/docs/ref/#commands.deleteToLineEnd). +*/ +declare const standardKeymap: readonly KeyBinding[]; +/** +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) +- Escape: [`simplifySelection`](https://codemirror.net/6/docs/ref/#commands.simplifySelection) +- Ctrl-Enter (Comd-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). +*/ +declare const defaultKeymap: readonly KeyBinding[]; +/** +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. +*/ +declare const indentWithTab: KeyBinding; + +export { CommentTokens, blockComment, blockUncomment, copyLineDown, copyLineUp, cursorCharBackward, cursorCharForward, cursorCharLeft, cursorCharRight, cursorDocEnd, cursorDocStart, cursorGroupBackward, cursorGroupForward, cursorGroupLeft, cursorGroupRight, cursorLineBoundaryBackward, cursorLineBoundaryForward, cursorLineDown, cursorLineEnd, cursorLineStart, cursorLineUp, cursorMatchingBracket, cursorPageDown, cursorPageUp, cursorSubwordBackward, cursorSubwordForward, cursorSyntaxLeft, cursorSyntaxRight, defaultKeymap, deleteCharBackward, deleteCharForward, deleteGroupBackward, deleteGroupForward, deleteLine, deleteToLineEnd, deleteToLineStart, deleteTrailingWhitespace, emacsStyleKeymap, history, historyField, historyKeymap, indentLess, indentMore, indentSelection, indentWithTab, insertBlankLine, insertNewline, insertNewlineAndIndent, insertTab, invertedEffects, isolateHistory, lineComment, lineUncomment, moveLineDown, moveLineUp, redo, redoDepth, redoSelection, selectAll, selectCharBackward, selectCharForward, selectCharLeft, selectCharRight, selectDocEnd, selectDocStart, selectGroupBackward, selectGroupForward, selectGroupLeft, selectGroupRight, selectLine, selectLineBoundaryBackward, selectLineBoundaryForward, selectLineDown, selectLineEnd, selectLineStart, selectLineUp, selectMatchingBracket, selectPageDown, selectPageUp, selectParentSyntax, selectSubwordBackward, selectSubwordForward, selectSyntaxLeft, selectSyntaxRight, simplifySelection, splitLine, standardKeymap, toggleBlockComment, toggleBlockCommentByLine, toggleComment, toggleLineComment, transposeChars, undo, undoDepth, undoSelection }; diff --git a/node_modules/@codemirror/commands/dist/index.js b/node_modules/@codemirror/commands/dist/index.js new file mode 100644 index 0000000000..23914f46bb --- /dev/null +++ b/node_modules/@codemirror/commands/dist/index.js @@ -0,0 +1,1534 @@ +import { Annotation, Facet, combineConfig, StateField, EditorSelection, Transaction, ChangeSet, ChangeDesc, StateEffect, Text, findClusterBreak, countColumn, CharCategory } from '@codemirror/state'; +import { EditorView, Direction } from '@codemirror/view'; +import { IndentContext, getIndentation, indentString, indentUnit, getIndentUnit, matchBrackets, syntaxTree } from '@codemirror/language'; +import { NodeProp } from '@lezer/common'; + +/** +Comment or uncomment the current selection. Will use line comments +if available, otherwise falling back to block comments. +*/ +const toggleComment = target => { + let config = getConfig(target.state); + 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 /* Toggle */); +/** +Comment the current selection using line comments. +*/ +const lineComment = /*@__PURE__*/command(changeLineComment, 1 /* Comment */); +/** +Uncomment the current selection using line comments. +*/ +const lineUncomment = /*@__PURE__*/command(changeLineComment, 2 /* 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 /* Toggle */); +/** +Comment the current selection using block comments. +*/ +const blockComment = /*@__PURE__*/command(changeBlockComment, 1 /* Comment */); +/** +Uncomment the current selection using block comments. +*/ +const blockUncomment = /*@__PURE__*/command(changeBlockComment, 2 /* 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 /* Toggle */); +function getConfig(state, pos = state.selection.main.head) { + let data = state.languageDataAt("commentTokens", pos); + 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); + let last = ranges.length - 1; + if (last >= 0 && ranges[last].to > fromLine.from) + ranges[last].to = toLine.to; + else + ranges.push({ from: fromLine.from, 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 /* 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 /* 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; + 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 token = getConfig(state, pos).line; + if (!token) + continue; + 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 /* 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 /* 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__*/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__*/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__*/Facet.define(); +const historyConfig = /*@__PURE__*/Facet.define({ + combine(configs) { + return combineConfig(configs, { + minDepth: 100, + newGroupDelay: 500 + }, { minDepth: Math.max, newGroupDelay: Math.min }); + } +}); +function changeEnd(changes) { + let end = 0; + changes.iterChangedRanges((_, to) => end = to); + return end; +} +const historyField_ = /*@__PURE__*/StateField.define({ + create() { + return HistoryState.empty; + }, + update(state, tr) { + let config = tr.state.facet(historyConfig); + let fromHist = tr.annotation(fromHistory); + if (fromHist) { + let selection = tr.docChanged ? EditorSelection.single(changeEnd(tr.changes)) : undefined; + let item = HistEvent.fromTransaction(tr, selection), from = fromHist.side; + let other = from == 0 /* 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 /* Done */ ? fromHist.rest : other, from == 0 /* Done */ ? other : fromHist.rest); + } + let isolate = tr.annotation(isolateHistory); + if (isolate == "full" || isolate == "before") + state = state.isolate(); + if (tr.annotation(Transaction.addToHistory) === false) + return !tr.changes.empty ? state.addMapping(tr.changes.desc) : state; + let event = HistEvent.fromTransaction(tr); + let time = tr.annotation(Transaction.time), userEvent = tr.annotation(Transaction.userEvent); + if (event) + state = state.addChanges(event, time, userEvent, config.newGroupDelay, config.minDepth); + 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), + 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 = 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 /* Done */, false); +/** +Redo a group of history events. Returns false if no group was +available. +*/ +const redo = /*@__PURE__*/cmd(1 /* Undone */, false); +/** +Undo a change or selection change. +*/ +const undoSelection = /*@__PURE__*/cmd(0 /* Done */, true); +/** +Redo a change or selection change. +*/ +const redoSelection = /*@__PURE__*/cmd(1 /* Undone */, true); +function depth(side) { + return function (state) { + let histState = state.field(historyField_, false); + if (!histState) + return 0; + let branch = side == 0 /* 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__*/depth(0 /* Done */); +/** +The amount of redoable change events available in a given state. +*/ +const redoDepth = /*@__PURE__*/depth(1 /* 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, 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 && ChangeSet.fromJSON(json.changes), [], json.mapped && ChangeDesc.fromJSON(json.mapped), json.startSelection && EditorSelection.fromJSON(json.startSelection), json.selectionsAfter.map(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, 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, newGroupDelay, maxLen) { + 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 < newGroupDelay && + 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, maxLen, new HistEvent(event.changes.compose(lastEvent.changes), conc(event.effects, lastEvent.effects), lastEvent.mapped, lastEvent.startSelection, none)); + } + else { + done = updateBranch(done, done.length, maxLen, 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, selection) { + let branch = side == 0 /* Done */ ? this.done : this.undone; + if (branch.length == 0) + return null; + let event = branch[branch.length - 1]; + if (selection && event.selectionsAfter.length) { + return state.update({ + selection: event.selectionsAfter[event.selectionsAfter.length - 1], + annotations: fromHistory.of({ side, rest: popSelection(branch) }), + userEvent: side == 0 /* 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 }), + filter: false, + userEvent: side == 0 /* 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): [`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 }, + { key: "Mod-u", run: undoSelection, preventDefault: true }, + { key: "Alt-u", mac: "Mod-Shift-u", run: redoSelection, preventDefault: true } +]; + +function updateSel(sel, by) { + return 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)) + return false; + dispatch(setSel(state, selection)); + return true; +} +function rangeEnd(range, forward) { + return 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) == 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 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 moveBySubword(view, range, forward) { + let categorize = view.state.charCategorizer(range.from); + return view.moveByChar(range, forward, start => { + let cat = CharCategory.Space, pos = range.from; + 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 (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; + } + } + return true; + }; + step(start); + return step; + }); +} +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 = syntaxTree(state).resolveInner(start.head); + let bracketProp = forward ? NodeProp.closedBy : NodeProp.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 ? matchBrackets(state, pos.from, 1) : matchBrackets(state, pos.to, -1)) && match.matched) + newPos = forward ? match.end.to : match.end.from; + else + newPos = forward ? pos.to : pos.from; + return 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 pageHeight(view) { + return Math.max(view.defaultLineHeight, Math.min(view.dom.clientHeight, innerHeight) - 5); +} +function cursorByPage(view, forward) { + let { state } = view, selection = updateSel(state.selection, range => { + return range.empty ? view.moveVertically(range, forward, pageHeight(view)) : rangeEnd(range, forward); + }); + if (selection.eq(state.selection)) + return false; + let startPos = view.coordsAtPos(state.selection.main.head); + let scrollRect = view.scrollDOM.getBoundingClientRect(); + let effect; + if (startPos && startPos.top > scrollRect.top && startPos.bottom < scrollRect.bottom && + startPos.top - scrollRect.top <= view.scrollDOM.scrollHeight - view.scrollDOM.scrollTop - view.scrollDOM.clientHeight) + effect = EditorView.scrollIntoView(selection.main.head, { y: "start", yMargin: startPos.top - scrollRect.top }); + 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 = 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 to the start of the line. +*/ +const cursorLineStart = view => moveSel(view, range => EditorSelection.cursor(view.lineBlockAt(range.head).from, 1)); +/** +Move the selection to the end of the line. +*/ +const cursorLineEnd = view => moveSel(view, range => EditorSelection.cursor(view.lineBlockAt(range.head).to, -1)); +function toMatchingBracket(state, dispatch, extend) { + let found = false, selection = updateSel(state.selection, range => { + let matching = matchBrackets(state, range.head, -1) + || matchBrackets(state, range.head, 1) + || (range.head > 0 && matchBrackets(state, range.head - 1, 1)) + || (range.head < state.doc.length && matchBrackets(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 ? EditorSelection.range(range.anchor, head) : 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(view, how) { + let selection = updateSel(view.state.selection, range => { + let head = how(range); + return EditorSelection.range(range.anchor, head.head, head.goalColumn); + }); + if (selection.eq(view.state.selection)) + return false; + view.dispatch(setSel(view.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); +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); +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, pageHeight(view))); +} +/** +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 to the start of the line. +*/ +const selectLineStart = view => extendSel(view, range => EditorSelection.cursor(view.lineBlockAt(range.head).from)); +/** +Move the selection head to the end of the line. +*/ +const selectLineEnd = view => extendSel(view, range => 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 }) => EditorSelection.range(from, Math.min(to + 1, state.doc.length))); + dispatch(state.update({ selection: 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 => { + var _a; + let context = syntaxTree(state).resolveInner(range.head, 1); + while (!((context.from < range.from && context.to >= range.to) || + (context.to > range.to && context.from <= range.from) || + !((_a = context.parent) === null || _a === void 0 ? void 0 : _a.parent))) + context = context.parent; + return EditorSelection.range(context.to, context.from); + }); + dispatch(setSel(state, selection)); + return 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 = EditorSelection.create([cur.main]); + else if (!cur.main.empty) + selection = EditorSelection.create([EditorSelection.cursor(cur.main.head)]); + if (!selection) + return false; + dispatch(setSel(state, selection)); + return true; +}; +function deleteBy({ state, dispatch }, by) { + if (state.readOnly) + return false; + let event = "delete.selection"; + let changes = state.changeByRange(range => { + let { from, to } = range; + if (from == to) { + let towards = by(from); + if (towards < from) + event = "delete.backward"; + else if (towards > from) + event = "delete.forward"; + from = Math.min(from, towards); + to = Math.max(to, towards); + } + return from == to ? { range } : { changes: { from, to }, range: EditorSelection.cursor(from) }; + }); + if (changes.changes.empty) + return false; + dispatch(state.update(changes, { scrollIntoView: true, userEvent: event })); + return true; +} +function skipAtomic(target, pos, forward) { + if (target instanceof EditorView) + for (let ranges of target.state.facet(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) => deleteBy(target, pos => { + let { state } = target, line = state.doc.lineAt(pos), before, targetPos; + if (!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 = countColumn(before, state.tabSize), drop = col % getIndentUnit(state) || getIndentUnit(state); + for (let i = 0; i < drop && before[before.length - 1 - i] == " "; i++) + pos--; + targetPos = pos; + } + else { + targetPos = findClusterBreak(line.text, pos - line.from, forward, forward) + line.from; + if (targetPos == pos && line.number != (forward ? state.doc.lines : 1)) + targetPos += forward ? 1 : -1; + } + return skipAtomic(target, targetPos, forward); +}); +/** +Delete the selection, or, for cursor selections, the character +before the cursor. +*/ +const deleteCharBackward = view => deleteByChar(view, false); +/** +Delete the selection or the character after the cursor. +*/ +const deleteCharForward = view => deleteByChar(view, true); +const deleteByGroup = (target, forward) => deleteBy(target, start => { + let pos = start, { 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 == start && line.number != (forward ? state.doc.lines : 1)) + pos += forward ? 1 : -1; + break; + } + let next = 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 != start) + cat = nextCat; + pos = next; + } + return skipAtomic(target, pos, forward); +}); +/** +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); +/** +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, pos => { + let lineEnd = view.lineBlockAt(pos).to; + return skipAtomic(view, pos < lineEnd ? lineEnd : Math.min(view.state.doc.length, pos + 1), true); +}); +/** +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, pos => { + let lineStart = view.lineBlockAt(pos).from; + return skipAtomic(view, pos > lineStart ? lineStart : Math.max(0, pos - 1), false); +}); +/** +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: Text.of(["", ""]) }, + range: 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 : findClusterBreak(line.text, pos - line.from, false) + line.from; + let to = pos == line.to ? pos + 1 : 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: 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(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(EditorSelection.range(r.anchor - size, r.head - size)); + } + } + if (!changes.length) + return false; + dispatch(state.update({ + changes, + scrollIntoView: true, + selection: 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 => view.moveVertically(range, true)).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; +}; +function isBetweenBrackets(state, pos) { + if (/\(\)|\[\]|\{\}/.test(state.sliceDoc(pos - 1, pos + 1))) + return { from: pos, to: pos }; + let context = syntaxTree(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(NodeProp.closedBy)) && closedBy.indexOf(after.name) > -1 && + state.doc.lineAt(before.to).from == state.doc.lineAt(after.from).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 IndentContext(state, { simulateBreak: from, simulateDoubleBreak: !!explode }); + let indent = getIndentation(cx, from); + if (indent == null) + indent = /^\s*/.exec(state.doc.lineAt(from).text)[0].length; + 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 = ["", indentString(state, indent)]; + if (explode) + insert.push(indentString(state, cx.lineIndent(line.from, -1))); + return { changes: { from, to, insert: Text.of(insert) }, + range: 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: 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 IndentContext(state, { overrideIndentation: start => { + let found = updated[start]; + return found == null ? -1 : found; + } }); + let changes = changeBySelectedLine(state, (line, changes, range) => { + let indent = getIndentation(context, line.from); + if (indent == null) + return; + if (!/\S/.test(line.text)) + indent = 0; + let cur = /^\s*/.exec(line.text)[0]; + let norm = indentString(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(indentUnit) }); + }), { 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 = countColumn(space, state.tabSize), keep = 0; + let insert = indentString(state, Math.max(0, col - getIndentUnit(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; +}; +/** +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: [`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): [`deleteToLineStart`](https://codemirror.net/6/docs/ref/#commands.deleteToLineStart). + - Cmd-Delete (macOS): [`deleteToLineEnd`](https://codemirror.net/6/docs/ref/#commands.deleteToLineEnd). +*/ +const standardKeymap = /*@__PURE__*/[ + { key: "ArrowLeft", run: cursorCharLeft, shift: selectCharLeft, preventDefault: true }, + { key: "Mod-ArrowLeft", mac: "Alt-ArrowLeft", run: cursorGroupLeft, shift: selectGroupLeft }, + { mac: "Cmd-ArrowLeft", run: cursorLineBoundaryBackward, shift: selectLineBoundaryBackward }, + { key: "ArrowRight", run: cursorCharRight, shift: selectCharRight, preventDefault: true }, + { key: "Mod-ArrowRight", mac: "Alt-ArrowRight", run: cursorGroupRight, shift: selectGroupRight }, + { mac: "Cmd-ArrowRight", run: cursorLineBoundaryForward, shift: selectLineBoundaryForward }, + { 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 }, + { key: "Mod-a", run: selectAll }, + { key: "Backspace", run: deleteCharBackward, shift: deleteCharBackward }, + { key: "Delete", run: deleteCharForward }, + { key: "Mod-Backspace", mac: "Alt-Backspace", run: deleteGroupBackward }, + { key: "Mod-Delete", mac: "Alt-Delete", run: deleteGroupForward }, + { mac: "Mod-Backspace", run: deleteToLineStart }, + { mac: "Mod-Delete", run: deleteToLineEnd } +].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) +- Escape: [`simplifySelection`](https://codemirror.net/6/docs/ref/#commands.simplifySelection) +- Ctrl-Enter (Comd-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). +*/ +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: "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 } +].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 }; + +export { blockComment, blockUncomment, copyLineDown, copyLineUp, cursorCharBackward, cursorCharForward, cursorCharLeft, cursorCharRight, cursorDocEnd, cursorDocStart, cursorGroupBackward, cursorGroupForward, cursorGroupLeft, cursorGroupRight, cursorLineBoundaryBackward, cursorLineBoundaryForward, cursorLineDown, cursorLineEnd, cursorLineStart, cursorLineUp, cursorMatchingBracket, cursorPageDown, cursorPageUp, cursorSubwordBackward, cursorSubwordForward, cursorSyntaxLeft, cursorSyntaxRight, defaultKeymap, deleteCharBackward, deleteCharForward, deleteGroupBackward, deleteGroupForward, deleteLine, deleteToLineEnd, deleteToLineStart, deleteTrailingWhitespace, emacsStyleKeymap, history, historyField, historyKeymap, indentLess, indentMore, indentSelection, indentWithTab, insertBlankLine, insertNewline, insertNewlineAndIndent, insertTab, invertedEffects, isolateHistory, lineComment, lineUncomment, moveLineDown, moveLineUp, redo, redoDepth, redoSelection, selectAll, selectCharBackward, selectCharForward, selectCharLeft, selectCharRight, selectDocEnd, selectDocStart, selectGroupBackward, selectGroupForward, selectGroupLeft, selectGroupRight, selectLine, selectLineBoundaryBackward, selectLineBoundaryForward, selectLineDown, selectLineEnd, selectLineStart, selectLineUp, selectMatchingBracket, selectPageDown, selectPageUp, selectParentSyntax, selectSubwordBackward, selectSubwordForward, selectSyntaxLeft, selectSyntaxRight, simplifySelection, splitLine, standardKeymap, toggleBlockComment, toggleBlockCommentByLine, toggleComment, toggleLineComment, transposeChars, undo, undoDepth, undoSelection }; diff --git a/node_modules/@codemirror/commands/package.json b/node_modules/@codemirror/commands/package.json new file mode 100644 index 0000000000..aa8c1e7b6a --- /dev/null +++ b/node_modules/@codemirror/commands/package.json @@ -0,0 +1,42 @@ +{ + "name": "@codemirror/commands", + "version": "6.0.0", + "description": "Collection of editing commands for the CodeMirror code editor", + "scripts": { + "test": "cm-runtests", + "prepare": "cm-buildhelper src/commands.ts" + }, + "keywords": [ + "editor", + "code" + ], + "author": { + "name": "Marijn Haverbeke", + "email": "marijnh@gmail.com", + "url": "http://marijnhaverbeke.nl" + }, + "type": "module", + "main": "dist/index.cjs", + "exports": { + "import": "./dist/index.js", + "require": "./dist/index.cjs" + }, + "types": "dist/index.d.ts", + "module": "dist/index.js", + "sideEffects": false, + "license": "MIT", + "dependencies": { + "@codemirror/language": "^6.0.0", + "@codemirror/state": "^6.0.0", + "@codemirror/view": "^6.0.0", + "@lezer/common": "^1.0.0" + }, + "devDependencies": { + "@codemirror/buildhelper": "^0.1.5", + "@codemirror/lang-javascript": "^6.0.0" + }, + "repository": { + "type": "git", + "url": "https://github.com/codemirror/commands.git" + } +} diff --git a/node_modules/@codemirror/language/.github/workflows/dispatch.yml b/node_modules/@codemirror/language/.github/workflows/dispatch.yml new file mode 100644 index 0000000000..955205089e --- /dev/null +++ b/node_modules/@codemirror/language/.github/workflows/dispatch.yml @@ -0,0 +1,16 @@ +name: Trigger CI +on: push + +jobs: + build: + name: Dispatch to main repo + runs-on: ubuntu-latest + steps: + - name: Emit repository_dispatch + uses: mvasigh/dispatch-action@main + with: + # You should create a personal access token and store it in your repository + token: ${{ secrets.DISPATCH_AUTH }} + repo: codemirror.next + owner: codemirror + event_type: push diff --git a/node_modules/@codemirror/language/CHANGELOG.md b/node_modules/@codemirror/language/CHANGELOG.md new file mode 100644 index 0000000000..a3f521484e --- /dev/null +++ b/node_modules/@codemirror/language/CHANGELOG.md @@ -0,0 +1,194 @@ +## 6.0.0 (2022-06-08) + +### New features + +The `foldingChanged` option to `foldGutter` can now be used to trigger a recomputation of the fold markers. + +## 0.20.2 (2022-05-20) + +### Bug fixes + +List style-mod as a dependency. + +## 0.20.1 (2022-05-18) + +### Bug fixes + +Make sure `all` styles in the CSS generated for a `HighlightStyle` have a lower precedence than the other rules defined for the style. Use a shorthand property + +## 0.20.0 (2022-04-20) + +### Breaking changes + +`HighlightStyle.get` is now called `highlightingFor`. + +`HighlightStyles` no longer function as extensions (to improve tree shaking), and must be wrapped with `syntaxHighlighting` to add to an editor configuration. + +`Language` objects no longer have a `topNode` property. + +### New features + +`HighlightStyle` and `defaultHighlightStyle` from the now-removed @codemirror/highlight package now live in this package. + +The new `forceParsing` function can be used to run the parser forward on an editor view. + +The exports that used to live in @codemirror/matchbrackets are now exported from this package. + +The @codemirror/fold package has been merged into this one. + +The exports from the old @codemirror/stream-parser package now live in this package. + +## 0.19.10 (2022-03-31) + +### Bug fixes + +Autocompletion may now also trigger automatic indentation on input. + +## 0.19.9 (2022-03-30) + +### Bug fixes + +Make sure nodes that end at the end of a partial parse aren't treated as valid fold targets. + +Fix an issue where the parser sometimes wouldn't reuse parsing work done in the background on transactions. + +## 0.19.8 (2022-03-03) + +### Bug fixes + +Fix an issue that could cause indentation logic to use the wrong line content when indenting multiple lines at once. + +## 0.19.7 (2021-12-02) + +### Bug fixes + +Fix an issue where the parse worker could incorrectly stop working when the parse tree has skipped gaps in it. + +## 0.19.6 (2021-11-26) + +### Bug fixes + +Fixes an issue where the background parse work would be scheduled too aggressively, degrading responsiveness on a newly-created editor with a large document. + +Improve initial highlight for mixed-language editors and limit the amount of parsing done on state creation for faster startup. + +## 0.19.5 (2021-11-17) + +### New features + +The new function `syntaxTreeAvailable` can be used to check if a fully-parsed syntax tree is available up to a given document position. + +The module now exports `syntaxParserRunning`, which tells you whether the background parser is still planning to do more work for a given editor view. + +## 0.19.4 (2021-11-13) + +### New features + +`LanguageDescription.of` now takes an optional already-loaded extension. + +## 0.19.3 (2021-09-13) + +### Bug fixes + +Fix an issue where a parse that skipped content with `skipUntilInView` would in some cases not be restarted when the range came into view. + +## 0.19.2 (2021-08-11) + +### Bug fixes + +Fix a bug that caused `indentOnInput` to fire for the wrong kinds of transactions. + +Fix a bug that could cause `indentOnInput` to apply its changes incorrectly. + +## 0.19.1 (2021-08-11) + +### Bug fixes + +Fix incorrect versions for @lezer dependencies. + +## 0.19.0 (2021-08-11) + +### Breaking changes + +CodeMirror now uses lezer 0.15, which means different package names (scoped with @lezer) and some breaking changes in the library. + +`EditorParseContext` is now called `ParseContext`. It is no longer passed to parsers, but must be retrieved with `ParseContext.get`. + +`IndentContext.lineIndent` now takes a position, not a `Line` object, as argument. + +`LezerLanguage` was renamed to `LRLanguage` (because all languages must emit Lezer-style trees, the name was misleading). + +`Language.parseString` no longer exists. You can just call `.parser.parse(...)` instead. + +### New features + +New `IndentContext.lineAt` method to access lines in a way that is aware of simulated line breaks. + +`IndentContext` now provides a `simulatedBreak` property through which client code can query whether the context has a simulated line break. + +## 0.18.2 (2021-06-01) + +### Bug fixes + +Fix an issue where asynchronous re-parsing (with dynamically loaded languages) sometimes failed to fully happen. + +## 0.18.1 (2021-03-31) + +### Breaking changes + +`EditorParseContext.getSkippingParser` now replaces `EditorParseContext.skippingParser` and allows you to provide a promise that'll cause parsing to start again. (The old property remains available until the next major release.) + +### Bug fixes + +Fix an issue where nested parsers could see past the end of the nested region. + +## 0.18.0 (2021-03-03) + +### Breaking changes + +Update dependencies to 0.18. + +### Breaking changes + +The `Language` constructor takes an additional argument that provides the top node type. + +### New features + +`Language` instances now have a `topNode` property giving their top node type. + +`TreeIndentContext` now has a `continue` method that allows an indenter to defer to the indentation of the parent nodes. + +## 0.17.5 (2021-02-19) + +### New features + +This package now exports a `foldInside` helper function, a fold function that should work for most delimited node types. + +## 0.17.4 (2021-01-15) + +## 0.17.3 (2021-01-15) + +### Bug fixes + +Parse scheduling has been improved to reduce the likelyhood of the user looking at unparsed code in big documents. + +Prevent parser from running too far past the current viewport in huge documents. + +## 0.17.2 (2021-01-06) + +### New features + +The package now also exports a CommonJS module. + +## 0.17.1 (2020-12-30) + +### Bug fixes + +Fix a bug where changing the editor configuration wouldn't update the language parser used. + +## 0.17.0 (2020-12-29) + +### Breaking changes + +First numbered release. + diff --git a/node_modules/@codemirror/language/LICENSE b/node_modules/@codemirror/language/LICENSE new file mode 100644 index 0000000000..3af12e62d9 --- /dev/null +++ b/node_modules/@codemirror/language/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (C) 2018-2021 by Marijn Haverbeke and others + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/node_modules/@codemirror/language/README.md b/node_modules/@codemirror/language/README.md new file mode 100644 index 0000000000..f1a3942f19 --- /dev/null +++ b/node_modules/@codemirror/language/README.md @@ -0,0 +1,18 @@ +# @codemirror/language [![NPM version](https://img.shields.io/npm/v/@codemirror/language.svg)](https://www.npmjs.org/package/@codemirror/language) + +[ [**WEBSITE**](https://codemirror.net/6/) | [**DOCS**](https://codemirror.net/6/docs/ref/#language) | [**ISSUES**](https://github.com/codemirror/codemirror.next/issues) | [**FORUM**](https://discuss.codemirror.net/c/next/) | [**CHANGELOG**](https://github.com/codemirror/language/blob/main/CHANGELOG.md) ] + +This package implements the language support infrastructure for the +[CodeMirror](https://codemirror.net/6/) code editor. + +The [project page](https://codemirror.net/6/) has more information, a +number of [examples](https://codemirror.net/6/examples/) and the +[documentation](https://codemirror.net/6/docs/). + +This code is released under an +[MIT license](https://github.com/codemirror/language/tree/main/LICENSE). + +We aim to be an inclusive, welcoming community. To make that explicit, +we have a [code of +conduct](http://contributor-covenant.org/version/1/1/0/) that applies +to communication around the project. diff --git a/node_modules/@codemirror/language/dist/index.cjs b/node_modules/@codemirror/language/dist/index.cjs new file mode 100644 index 0000000000..f4bb75befc --- /dev/null +++ b/node_modules/@codemirror/language/dist/index.cjs @@ -0,0 +1,2360 @@ +'use strict'; + +Object.defineProperty(exports, '__esModule', { value: true }); + +var common = require('@lezer/common'); +var state = require('@codemirror/state'); +var view = require('@codemirror/view'); +var highlight = require('@lezer/highlight'); +var styleMod = require('style-mod'); + +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 = new common.NodeProp(); +/** +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 + }); +} +/** +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 = []) { + this.data = data; + // 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) => state.facet(languageDataFacetAt(state, pos, side))) + ].concat(extraExtensions); + } + /** + Query whether this language is active at the given position. + */ + isActiveAt(state, pos, side = -1) { + return languageDataFacetAt(state, pos, side) == 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(common.NodeProp.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 common.Tree) + 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 = state.StateEffect.define(); +function languageDataFacetAt(state, pos, side) { + let topLang = state.facet(language); + if (!topLang) + return null; + let facet = topLang.data; + if (topLang.allowsNesting) { + for (let node = syntaxTree(state).topNode; node; node = node.enter(pos, side, common.IterMode.ExcludeBuffers)) + facet = node.type.prop(languageDataProp) || facet; + } + return facet; +} +/** +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) { + super(data, parser); + 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)] + })); + } + /** + Create a new instance of this language with a reconfigured + version of its parser. + */ + configure(options) { + return new LRLanguage(this.data, this.parser.configure(options)); + } + 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 : common.Tree.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; + return !parse ? null : parse.isDone(upto) || parse.work(timeout, upto) ? parse.tree : null; +} +/** +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 object for a Text document. +class DocInput { + constructor(doc, length = doc.length) { + this.doc = doc; + this.length = length; + this.cursorPos = 0; + this.string = ""; + this.cursor = doc.iter(); + } + 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, [], common.Tree.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 != common.Tree.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(common.TreeFragment.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(common.TreeFragment.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 = common.TreeFragment.applyChanges(fragments, ranges); + tree = common.Tree.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 common.Parser { + 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 common.Tree(common.NodeType.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 common.TreeFragment.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 /* Apply */, upto)) + newCx.takeTree(); + return new LanguageState(newCx); + } + static init(state) { + let vpTo = Math.min(3000 /* InitViewport */, state.doc.length); + let parseState = ParseContext.create(state.facet(language).parser, state, { from: 0, to: vpTo }); + if (!parseState.work(20 /* Apply */, vpTo)) + parseState.takeTree(); + return new LanguageState(parseState); + } +} +Language.state = 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 /* MaxPause */); + return () => clearTimeout(timeout); +}; +if (typeof requestIdleCallback != "undefined") + requestIdle = (callback) => { + let idle = -1, timeout = setTimeout(() => { + idle = requestIdleCallback(callback, { timeout: 500 /* MaxPause */ - 100 /* MinPause */ }); + }, 100 /* 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 = 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) { + if (this.view.hasFocus) + this.chunkBudget += 50 /* 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 /* ChunkTime */; + this.chunkBudget = 3000 /* 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 /* MaxParseAhead */)) + return; + let endTime = Date.now() + Math.min(this.chunkBudget, 100 /* Slice */, deadline && !isInputPending ? Math.max(25 /* 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 /* 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 => 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. +*/ +const language = state.Facet.define({ + combine(languages) { return languages.length ? languages[0] : null; }, + enables: [Language.state, parseWorker] +}); +/** +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 at the start of a given line, or +`null` to indicate no appropriate indentation could be determined. +*/ +const indentService = state.Facet.define(); +/** +Facet for overriding the unit by which indentation happens. +Should be a string consisting either entirely of spaces or +entirely of tabs. When not set, this defaults to 2 spaces. +*/ +const indentUnit = state.Facet.define({ + combine: values => { + if (!values.length) + return " "; + if (!/^(?: +|\t+)$/.test(values[0])) + throw new Error("Invalid indent unit: " + JSON.stringify(values[0])); + return values[0]; + } +}); +/** +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; + if (state.facet(indentUnit).charCodeAt(0) == 9) + while (cols >= ts) { + result += "\t"; + cols -= ts; + } + for (let i = 0; i < cols; i++) + result += " "; + return result; +} +/** +Get the indentation 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 != null) + return result; + } + let tree = syntaxTree(context.state); + return tree ? syntaxIndentation(context, tree, pos) : null; +} +/** +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 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 or null, where null indicates that no +definitive indentation can be determined. +*/ +const indentNodeProp = new common.NodeProp(); +// Compute the indentation for a given position from the syntax tree. +function syntaxIndentation(cx, ast, pos) { + return indentFrom(ast.resolveInner(pos).enterUnfinishedNodesBefore(pos), pos, cx); +} +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(common.NodeProp.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 indentFrom(node, pos, base) { + for (; node; node = node.parent) { + let strategy = indentStrategy(node); + if (strategy) + return strategy(TreeIndentContext.create(base, pos, node)); + } + return 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, + /** + The syntax tree node to which the indentation strategy + applies. + */ + node) { + super(base.state, base.options); + this.base = base; + this.pos = pos; + this.node = node; + } + /** + @internal + */ + static create(base, pos, node) { + return new TreeIndentContext(base, pos, node); + } + /** + 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() { + let line = this.state.doc.lineAt(this.node.from); + // Skip line starts that are covered by a sibling (or cousin, etc) + for (;;) { + let atBreak = this.node.resolve(line.from); + while (atBreak.parent && atBreak.parent.from == atBreak.from) + atBreak = atBreak.parent; + if (isParent(atBreak, this.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() { + let parent = this.node.parent; + return parent ? indentFrom(parent, this.pos, this.base) : 0; + } +} +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) + return next.from < lineEnd ? openToken : null; + 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 = 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 = new common.NodeProp(); +/** +[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 inner = tree.resolveInner(end); + let found = null; + for (let cur = inner; cur; cur = cur.parent) { + 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 = state.StateEffect.define({ map: mapRange }); +/** +State effect that unfolds the given range (if it was folded). +*/ +const unfoldEffect = 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; +} +const foldState = state.StateField.define({ + create() { + return view.Decoration.none; + }, + update(folded, tr) { + folded = folded.map(tr.changes); + for (let e of tr.effects) { + if (e.is(foldEffect) && !foldExists(folded, e.value.from, e.value.to)) + folded = folded.update({ add: [foldWidget.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) { + let onSelection = false, { head } = tr.selection.main; + folded.between(head, head, (a, b) => { if (a < head && b > head) + onSelection = true; }); + if (onSelection) + folded = folded.update({ + filterFrom: head, + filterTo: head, + filter: (a, b) => b <= head || a >= head + }); + } + return folded; + }, + provide: f => view.EditorView.decorations.from(f) +}); +/** +Get a [range set](https://codemirror.net/6/docs/ref/#state.RangeSet) containing the folded ranges +in the given state. +*/ +function foldedRanges(state$1) { + return state$1.field(foldState, false) || state.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$1, other) { + return state$1.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$1, range, fold = true) { + let lineFrom = view$1.state.doc.lineAt(range.from).number, lineTo = view$1.state.doc.lineAt(range.to).number; + return view.EditorView.announce.of(`${view$1.state.phrase(fold ? "Folded lines" : "Unfolded lines")} ${lineFrom} ${view$1.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; +}; +/** +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, + placeholderText: "…" +}; +const foldConfig = state.Facet.define({ + combine(values) { return 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; +} +const foldWidget = view.Decoration.replace({ widget: new class extends view.WidgetType { + toDOM(view) { + 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); + 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 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 = Object.assign(Object.assign({}, 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, + 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: Object.assign(Object.assign({}, 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 = 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(spec, options) { + let modSpec; + function def(spec) { + let cls = styleMod.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 = highlight.tagHighlighter(spec.map(style => ({ + tag: style.tag, + class: style.class || def(Object.assign({}, style, { tag: null })) + })), { + all, + }).style; + this.module = modSpec ? new styleMod.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 = state.Facet.define(); +const fallbackHighlighter = 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)); + } + update(update) { + let tree = syntaxTree(update.state), highlighters = getHighlighters(update.state); + let styleChange = highlighters != getHighlighters(update.startState); + if (tree.length < update.view.viewport.to && !styleChange && tree.type == this.tree.type) { + this.decorations = this.decorations.map(update.changes); + } + else if (tree != this.tree || update.viewportChanged || styleChange) { + this.tree = tree; + this.decorations = this.buildDeco(update.view, highlighters); + } + } + buildDeco(view$1, highlighters) { + if (!highlighters || !this.tree.length) + return view.Decoration.none; + let builder = new state.RangeSetBuilder(); + for (let { from, to } of view$1.visibleRanges) { + highlight.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 = state.Prec.high(view.ViewPlugin.fromClass(TreeHighlighter, { + decorations: v => v.decorations +})); +/** +A default highlight style (works well with light themes). +*/ +const defaultHighlightStyle = HighlightStyle.define([ + { tag: highlight.tags.meta, + color: "#7a757a" }, + { tag: highlight.tags.link, + textDecoration: "underline" }, + { tag: highlight.tags.heading, + textDecoration: "underline", + fontWeight: "bold" }, + { tag: highlight.tags.emphasis, + fontStyle: "italic" }, + { tag: highlight.tags.strong, + fontWeight: "bold" }, + { tag: highlight.tags.strikethrough, + textDecoration: "line-through" }, + { tag: highlight.tags.keyword, + color: "#708" }, + { tag: [highlight.tags.atom, highlight.tags.bool, highlight.tags.url, highlight.tags.contentSeparator, highlight.tags.labelName], + color: "#219" }, + { tag: [highlight.tags.literal, highlight.tags.inserted], + color: "#164" }, + { tag: [highlight.tags.string, highlight.tags.deleted], + color: "#a11" }, + { tag: [highlight.tags.regexp, highlight.tags.escape, highlight.tags.special(highlight.tags.string)], + color: "#e40" }, + { tag: highlight.tags.definition(highlight.tags.variableName), + color: "#00f" }, + { tag: highlight.tags.local(highlight.tags.variableName), + color: "#30a" }, + { tag: [highlight.tags.typeName, highlight.tags.namespace], + color: "#085" }, + { tag: highlight.tags.className, + color: "#167" }, + { tag: [highlight.tags.special(highlight.tags.variableName), highlight.tags.macroName], + color: "#256" }, + { tag: highlight.tags.definition(highlight.tags.propertyName), + color: "#00c" }, + { tag: highlight.tags.comment, + color: "#940" }, + { tag: highlight.tags.invalid, + color: "#f00" } +]); + +const baseTheme = view.EditorView.baseTheme({ + "&.cm-focused .cm-matchingBracket": { backgroundColor: "#328c8252" }, + "&.cm-focused .cm-nonmatchingBracket": { backgroundColor: "#bb555544" } +}); +const DefaultScanDist = 10000, DefaultBrackets = "()[]{}"; +const bracketMatchingConfig = state.Facet.define({ + combine(configs) { + return state.combineConfig(configs, { + afterCursor: true, + brackets: DefaultBrackets, + maxScanDistance: DefaultScanDist, + renderMatch: defaultRenderMatch + }); + } +}); +const matchingMark = view.Decoration.mark({ class: "cm-matchingBracket" }), nonmatchingMark = 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 = 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]; +} +function matchingNodes(node, dir, brackets) { + let byProp = node.prop(dir < 0 ? common.NodeProp.openedBy : common.NodeProp.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; +} +/** +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) + return matchMarkedBrackets(state, pos, dir, cur, matches, brackets); + } + return matchPlainBrackets(state, pos, dir, tree, node.type, maxScanDistance, brackets); +} +function matchMarkedBrackets(_state, _pos, dir, token, matching, brackets) { + let parent = token.parent, firstToken = { from: token.from, to: token.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) { + return { start: firstToken, end: { from: cursor.from, to: cursor.to }, matched: true }; + } + else if (matchingNodes(cursor.type, dir, brackets)) { + depth++; + } + else if (matchingNodes(cursor.type, -dir, brackets)) { + depth--; + if (depth == 0) + return { + start: firstToken, + end: cursor.from == cursor.to ? undefined : { from: cursor.from, to: cursor.to }, + matched: false + }; + } + } + } 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.resolve(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) { + this.string = string; + this.tabSize = tabSize; + this.indentUnit = indentUnit; + /** + 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() { + return 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 { + 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 + }; +} +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; +} +/** +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 common.Parser { + createParse(input, fragments, ranges) { + return new Parse(self, input, fragments, ranges); + } + }; + super(data, impl, [indentService.of((cx, pos) => this.getIndent(cx, pos))]); + this.topNode = docID(data); + self = this; + this.streamParser = p; + this.stateAfter = new common.NodeProp({ perNode: true }); + this.tokenTable = parser.tokenTable ? new TokenTable(p.tokenTable) : defaultTokenTable; + } + /** + Define a stream language. + */ + static define(spec) { return new StreamLanguage(spec); } + getIndent(cx, pos) { + let tree = syntaxTree(cx.state), at = tree.resolve(pos); + while (at && at.type != this.topNode) + at = at.parent; + if (!at) + return null; + let start = findState(this, tree, 0, at.from, pos), statePos, state; + if (start) { + state = start.state; + statePos = start.pos + 1; + } + else { + state = this.streamParser.startState(cx.unit); + statePos = 0; + } + if (pos - statePos > 10000 /* MaxIndentScanDist */) + return null; + while (statePos < pos) { + let line = cx.state.doc.lineAt(statePos), end = Math.min(pos, line.to); + if (line.length) { + let stream = new StringStream(line.text, cx.state.tabSize, cx.unit); + while (stream.pos < end - line.from) + readToken(this.streamParser.token, stream, state); + } + else { + this.streamParser.blankLine(state, cx.unit); + } + if (end == pos) + break; + statePos = line.to + 1; + } + let { text } = cx.lineAt(pos); + return this.streamParser.indent(state, /^\s*(.*)/.exec(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 common.Tree && 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 && 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 common.Tree) { + if (!(inner = cutTree(lang, child, from - pos, to - pos, inside))) + break; + return !inside ? inner + : new common.Tree(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, 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 && (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: common.Tree.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, 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 /* MaxDistanceBeforeViewport */) { + 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 + 2048 /* 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, size, offset) { + 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; + } + 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, 4, offset); + if (stream.start > 10000 /* MaxLineLength */) + break; + } + } + this.parsedPos = end; + this.moveRangeIndex(); + if (this.parsedPos < this.to) + this.parsedPos++; + } + finishChunk() { + let tree = common.Tree.build({ + buffer: this.chunk, + start: this.chunkStart, + length: this.parsedPos - this.chunkStart, + nodeSet, + topID: 0, + maxBufferLength: 2048 /* ChunkSize */, + reused: this.chunkReused + }); + tree = new common.Tree(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 common.Tree(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 = Object.create(null); +const typeArray = [common.NodeType.none]; +const nodeSet = new common.NodeSet(typeArray); +const warned = []; +const defaultTable = Object.create(null); +for (let [legacyName, name] of [ + ["variable", "variableName"], + ["variable-2", "variableName.special"], + ["string-2", "string.special"], + ["def", "variableName.definition"], + ["tag", "typeName"], + ["attribute", "propertyName"], + ["type", "typeName"], + ["builtin", "variableName.standard"], + ["qualifier", "modifier"], + ["error", "invalid"], + ["header", "heading"], + ["property", "propertyName"] +]) + defaultTable[legacyName] = 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 = new TokenTable(noTokens); +function warnForPart(part, msg) { + if (warned.indexOf(part) > -1) + return; + warned.push(part); + console.warn(msg); +} +function createTokenType(extra, tagStr) { + let tag = null; + for (let part of tagStr.split(".")) { + let value = (extra[part] || highlight.tags[part]); + if (!value) { + warnForPart(part, `Unknown highlighting tag ${part}`); + } + else if (typeof value == "function") { + if (!tag) + warnForPart(part, `Modifier ${part} used at start of tag`); + else + tag = value(tag); + } + else { + if (tag) + warnForPart(part, `Tag ${part} used as modifier`); + else + tag = value; + } + } + if (!tag) + return 0; + let name = tagStr.replace(/ /g, "_"), type = common.NodeType.define({ + id: typeArray.length, + name, + props: [highlight.styleTags({ [name]: tag })] + }); + typeArray.push(type); + return type.id; +} +function docID(data) { + let type = common.NodeType.define({ id: typeArray.length, name: "Document", props: [languageDataProp.add(() => data)] }); + typeArray.push(type); + return type; +} + +exports.HighlightStyle = HighlightStyle; +exports.IndentContext = IndentContext; +exports.LRLanguage = LRLanguage; +exports.Language = Language; +exports.LanguageDescription = LanguageDescription; +exports.LanguageSupport = LanguageSupport; +exports.ParseContext = ParseContext; +exports.StreamLanguage = StreamLanguage; +exports.StringStream = StringStream; +exports.TreeIndentContext = TreeIndentContext; +exports.bracketMatching = bracketMatching; +exports.codeFolding = codeFolding; +exports.continuedIndent = continuedIndent; +exports.defaultHighlightStyle = defaultHighlightStyle; +exports.defineLanguageFacet = defineLanguageFacet; +exports.delimitedIndent = delimitedIndent; +exports.ensureSyntaxTree = ensureSyntaxTree; +exports.flatIndent = flatIndent; +exports.foldAll = foldAll; +exports.foldCode = foldCode; +exports.foldEffect = foldEffect; +exports.foldGutter = foldGutter; +exports.foldInside = foldInside; +exports.foldKeymap = foldKeymap; +exports.foldNodeProp = foldNodeProp; +exports.foldService = foldService; +exports.foldable = foldable; +exports.foldedRanges = foldedRanges; +exports.forceParsing = forceParsing; +exports.getIndentUnit = getIndentUnit; +exports.getIndentation = getIndentation; +exports.highlightingFor = highlightingFor; +exports.indentNodeProp = indentNodeProp; +exports.indentOnInput = indentOnInput; +exports.indentService = indentService; +exports.indentString = indentString; +exports.indentUnit = indentUnit; +exports.language = language; +exports.languageDataProp = languageDataProp; +exports.matchBrackets = matchBrackets; +exports.syntaxHighlighting = syntaxHighlighting; +exports.syntaxParserRunning = syntaxParserRunning; +exports.syntaxTree = syntaxTree; +exports.syntaxTreeAvailable = syntaxTreeAvailable; +exports.unfoldAll = unfoldAll; +exports.unfoldCode = unfoldCode; +exports.unfoldEffect = unfoldEffect; diff --git a/node_modules/@codemirror/language/dist/index.d.ts b/node_modules/@codemirror/language/dist/index.d.ts new file mode 100644 index 0000000000..c40fcc0aca --- /dev/null +++ b/node_modules/@codemirror/language/dist/index.d.ts @@ -0,0 +1,1064 @@ +import { NodeProp, Parser, Tree, TreeFragment, SyntaxNode, NodeType } from '@lezer/common'; +import { LRParser, ParserConfig } from '@lezer/lr'; +import * as _codemirror_state from '@codemirror/state'; +import { Facet, Extension, EditorState, Range } from '@codemirror/state'; +import { EditorView, DecorationSet, Command, KeyBinding, ViewUpdate, BlockInfo, Decoration } from '@codemirror/view'; +import { Highlighter, Tag } from '@lezer/highlight'; +import { StyleModule, StyleSpec } from 'style-mod'; + +/** +Node prop stored in a parser's top syntax node to provide the +facet that stores language-specific data for that language. +*/ +declare const languageDataProp: NodeProp>; +/** +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). +*/ +declare function defineLanguageFacet(baseData?: { + [name: string]: any; +}): Facet<{ + [name: string]: any; +}, readonly { + [name: string]: any; +}[]>; +/** +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. +*/ +declare class Language { + /** + The [language data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) facet + used for this language. + */ + readonly data: Facet<{ + [name: string]: any; + }>; + /** + The extension value to install this as the document language. + */ + readonly extension: Extension; + /** + The parser object. Can be useful when using this as a [nested + parser](https://lezer.codemirror.net/docs/ref#common.Parser). + */ + parser: Parser; + /** + 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: Facet<{ + [name: string]: any; + }>, parser: Parser, extraExtensions?: Extension[]); + /** + Query whether this language is active at the given position. + */ + isActiveAt(state: EditorState, pos: number, side?: -1 | 0 | 1): boolean; + /** + 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: EditorState): { + from: number; + to: number; + }[]; + /** + Indicates whether this language allows nested languages. The + default implementation returns true. + */ + get allowsNesting(): boolean; +} +/** +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. +*/ +declare class LRLanguage extends Language { + readonly parser: LRParser; + private constructor(); + /** + Define a language from a parser. + */ + static define(spec: { + /** + The parser to use. Should already have added editor-relevant + node props (and optionally things like dialect and top rule) + configured. + */ + parser: LRParser; + /** + [Language data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) + to register for this language. + */ + languageData?: { + [name: string]: any; + }; + }): LRLanguage; + /** + Create a new instance of this language with a reconfigured + version of its parser. + */ + configure(options: ParserConfig): LRLanguage; + get allowsNesting(): boolean; +} +/** +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. +*/ +declare function syntaxTree(state: EditorState): Tree; +/** +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. +*/ +declare function ensureSyntaxTree(state: EditorState, upto: number, timeout?: number): Tree | null; +/** +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. +*/ +declare function syntaxTreeAvailable(state: EditorState, upto?: number): boolean; +/** +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. +*/ +declare function forceParsing(view: EditorView, upto?: number, timeout?: number): boolean; +/** +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. +*/ +declare function syntaxParserRunning(view: EditorView): boolean; +/** +A parse context provided to parsers working on the editor content. +*/ +declare class ParseContext { + private parser; + /** + The current editor state. + */ + readonly state: EditorState; + /** + Tree fragments that can be reused by incremental re-parses. + */ + fragments: readonly TreeFragment[]; + /** + 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: { + from: number; + to: number; + }; + private parse; + private constructor(); + private startParse; + private withContext; + private withoutTempSkipped; + /** + 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: number, to: number): void; + /** + 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?: Promise): Parser; + /** + Get the context for the current parse, or `null` if no editor + parse is in progress. + */ + static get(): ParseContext | null; +} +/** +The facet used to associate a language with an editor state. +*/ +declare const language: Facet; +/** +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. +*/ +declare class LanguageSupport { + /** + The language object. + */ + readonly language: 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. + */ + readonly support: Extension; + /** + An extension including both the language and its support + extensions. (Allowing the object to be used as an extension + value itself.) + */ + extension: Extension; + /** + Create a language support object. + */ + constructor( + /** + The language object. + */ + language: 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?: Extension); +} +/** +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. +*/ +declare class LanguageDescription { + /** + The name of this language. + */ + readonly name: string; + /** + Alternative names for the mode (lowercased, includes `this.name`). + */ + readonly alias: readonly string[]; + /** + File extensions associated with this language. + */ + readonly extensions: readonly string[]; + /** + Optional filename pattern that should be associated with this + language. + */ + readonly filename: RegExp | undefined; + private loadFunc; + /** + If the language has been loaded, this will hold its value. + */ + support: LanguageSupport | undefined; + private loading; + private constructor(); + /** + 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(): Promise; + /** + Create a language description. + */ + static of(spec: { + /** + The language's name. + */ + name: string; + /** + An optional array of alternative names. + */ + alias?: readonly string[]; + /** + An optional array of filename extensions associated with this + language. + */ + extensions?: readonly string[]; + /** + An optional filename pattern associated with this language. + */ + filename?: RegExp; + /** + A function that will asynchronously load the language. + */ + load?: () => Promise; + /** + Alternatively to `load`, you can provide an already loaded + support object. Either this or `load` should be provided. + */ + support?: LanguageSupport; + }): LanguageDescription; + /** + 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: readonly LanguageDescription[], filename: string): LanguageDescription | 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: readonly LanguageDescription[], name: string, fuzzy?: boolean): LanguageDescription | null; +} + +/** +Facet that defines a way to provide a function that computes the +appropriate indentation depth at the start of a given line, or +`null` to indicate no appropriate indentation could be determined. +*/ +declare const indentService: Facet<(context: IndentContext, pos: number) => number | null, readonly ((context: IndentContext, pos: number) => number | null)[]>; +/** +Facet for overriding the unit by which indentation happens. +Should be a string consisting either entirely of spaces or +entirely of tabs. When not set, this defaults to 2 spaces. +*/ +declare const indentUnit: Facet; +/** +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. +*/ +declare function getIndentUnit(state: EditorState): number; +/** +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. +*/ +declare function indentString(state: EditorState, cols: number): string; +/** +Get the indentation 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. +*/ +declare function getIndentation(context: IndentContext | EditorState, pos: number): number | null; +/** +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. +*/ +declare class IndentContext { + /** + The editor state. + */ + readonly state: EditorState; + /** + The indent unit (number of columns per indentation level). + */ + unit: number; + /** + Create an indent context. + */ + constructor( + /** + The editor state. + */ + state: EditorState, + /** + @internal + */ + options?: { + /** + Override line indentations provided to the indentation + helper function, which is useful when implementing region + indentation, where indentation for later lines needs to refer + to previous lines, which may have been reindented compared to + the original start state. If given, this function should + return -1 for lines (given by start position) that didn't + change, and an updated indentation otherwise. + */ + overrideIndentation?: (pos: number) => number; + /** + Make it look, to the indent logic, like a line break was + added at the given position (which is mostly just useful for + implementing something like + [`insertNewlineAndIndent`](https://codemirror.net/6/docs/ref/#commands.insertNewlineAndIndent)). + */ + simulateBreak?: number; + /** + When `simulateBreak` is given, this can be used to make the + simulate break behave like a double line break. + */ + simulateDoubleBreak?: boolean; + }); + /** + 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: number, bias?: -1 | 1): { + text: string; + from: number; + }; + /** + Get the text directly after `pos`, either the entire line + or the next 100 characters, whichever is shorter. + */ + textAfterPos(pos: number, bias?: -1 | 1): string; + /** + Find the column for the given position. + */ + column(pos: number, bias?: -1 | 1): number; + /** + Find the column position (taking tabs into account) of the given + position in the given string. + */ + countColumn(line: string, pos?: number): number; + /** + Find the indentation column of the line at the given point. + */ + lineIndent(pos: number, bias?: -1 | 1): number; + /** + Returns the [simulated line + break](https://codemirror.net/6/docs/ref/#language.IndentContext.constructor^options.simulateBreak) + for this context, if any. + */ + get simulatedBreak(): number | 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 or null, where null indicates that no +definitive indentation can be determined. +*/ +declare const indentNodeProp: NodeProp<(context: TreeIndentContext) => number | null>; +/** +Objects of this type provide context information and helper +methods to indentation functions registered on syntax nodes. +*/ +declare class TreeIndentContext extends IndentContext { + private base; + /** + The position at which indentation is being computed. + */ + readonly pos: number; + /** + The syntax tree node to which the indentation strategy + applies. + */ + readonly node: SyntaxNode; + private constructor(); + /** + Get the text directly after `this.pos`, either the entire line + or the next 100 characters, whichever is shorter. + */ + get textAfter(): string; + /** + 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(): number; + /** + Continue looking for indentations in the node's parent nodes, + and return the result of that. + */ + continue(): number | null; +} +/** +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) +*/ +declare function delimitedIndent({ closing, align, units }: { + closing: string; + align?: boolean; + units?: number; +}): (context: TreeIndentContext) => number; +/** +An indentation strategy that aligns a node's content to its base +indentation. +*/ +declare const flatIndent: (context: TreeIndentContext) => number; +/** +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. +*/ +declare function continuedIndent({ except, units }?: { + except?: RegExp; + units?: number; +}): (context: TreeIndentContext) => number; +/** +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. +*/ +declare function indentOnInput(): Extension; + +/** +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. +*/ +declare const foldService: Facet<(state: EditorState, lineStart: number, lineEnd: number) => ({ + from: number; + to: number; +} | null), readonly ((state: EditorState, lineStart: number, lineEnd: number) => ({ + from: number; + to: number; +} | null))[]>; +/** +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. +*/ +declare const foldNodeProp: NodeProp<(node: SyntaxNode, state: EditorState) => ({ + from: number; + to: number; +} | null)>; +/** +[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. +*/ +declare function foldInside(node: SyntaxNode): { + from: number; + to: number; +} | null; +/** +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. +*/ +declare function foldable(state: EditorState, lineStart: number, lineEnd: number): { + from: number; + to: number; +} | null; +declare type DocRange = { + from: number; + to: number; +}; +/** +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.) +*/ +declare const foldEffect: _codemirror_state.StateEffectType; +/** +State effect that unfolds the given range (if it was folded). +*/ +declare const unfoldEffect: _codemirror_state.StateEffectType; +/** +Get a [range set](https://codemirror.net/6/docs/ref/#state.RangeSet) containing the folded ranges +in the given state. +*/ +declare function foldedRanges(state: EditorState): DecorationSet; +/** +Fold the lines that are selected, if possible. +*/ +declare const foldCode: Command; +/** +Unfold folded ranges on selected lines. +*/ +declare const unfoldCode: Command; +/** +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). +*/ +declare const foldAll: Command; +/** +Unfold all folded code. +*/ +declare const unfoldAll: Command; +/** +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). +*/ +declare const foldKeymap: readonly KeyBinding[]; +interface FoldConfig { + /** + A function that creates the DOM element used to indicate the + position of folded code. The `onclick` argument is the default + click event handler, which toggles folding on the line that + holds the element, and should probably be added as an event + handler to the returned element. + + When this option isn't given, the `placeholderText` option will + be used to create the placeholder element. + */ + placeholderDOM?: ((view: EditorView, onclick: (event: Event) => void) => HTMLElement) | null; + /** + Text to use as placeholder for folded text. Defaults to `"…"`. + Will be styled with the `"cm-foldPlaceholder"` class. + */ + placeholderText?: string; +} +/** +Create an extension that configures code folding. +*/ +declare function codeFolding(config?: FoldConfig): Extension; +declare type Handlers = { + [event: string]: (view: EditorView, line: BlockInfo, event: Event) => boolean; +}; +interface FoldGutterConfig { + /** + A function that creates the DOM element used to indicate a + given line is folded or can be folded. + When not given, the `openText`/`closeText` option will be used instead. + */ + markerDOM?: ((open: boolean) => HTMLElement) | null; + /** + Text used to indicate that a given line can be folded. + Defaults to `"⌄"`. + */ + openText?: string; + /** + Text used to indicate that a given line is folded. + Defaults to `"›"`. + */ + closedText?: string; + /** + Supply event handlers for DOM events on this gutter. + */ + domEventHandlers?: Handlers; + /** + When given, if this returns true for a given view update, + recompute the fold markers. + */ + foldingChanged?: (update: ViewUpdate) => boolean; +} +/** +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). +*/ +declare function foldGutter(config?: FoldGutterConfig): Extension; + +/** +A highlight style associates CSS styles with higlighting +[tags](https://lezer.codemirror.net/docs/ref#highlight.Tag). +*/ +declare class HighlightStyle implements Highlighter { + /** + A style module holding the CSS rules for this highlight style. + When using + [`highlightTree`](https://lezer.codemirror.net/docs/ref#highlight.highlightTree) + outside of the editor, you may want to manually mount this + module to show the highlighting. + */ + readonly module: StyleModule | null; + readonly style: (tags: readonly Tag[]) => string | null; + readonly scope: ((type: NodeType) => boolean) | undefined; + private constructor(); + /** + 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: readonly TagStyle[], options?: { + /** + By default, highlighters apply to the entire document. You can + scope them to a single language by providing the language + object or a language's top node type here. + */ + scope?: Language | NodeType; + /** + Add a style to _all_ content. Probably only useful in + combination with `scope`. + */ + all?: string | StyleSpec; + /** + Specify that this highlight style should only be active then + the theme is dark or light. By default, it is active + regardless of theme. + */ + themeType?: "dark" | "light"; + }): HighlightStyle; +} +/** +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. +*/ +declare function syntaxHighlighting(highlighter: Highlighter, options?: { + /** + When enabled, this marks the highlighter as a fallback, which + only takes effect if no other highlighters are registered. + */ + fallback: boolean; +}): Extension; +/** +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). +*/ +declare function highlightingFor(state: EditorState, tags: readonly Tag[], scope?: NodeType): string | null; +/** +The type of object used in +[`HighlightStyle.define`](https://codemirror.net/6/docs/ref/#language.HighlightStyle^define). +Assigns a style to one or more highlighting +[tags](https://lezer.codemirror.net/docs/ref#highlight.Tag), which can either be a fixed class name +(which must be defined elsewhere), or a set of CSS properties, for +which the library will define an anonymous class. +*/ +interface TagStyle { + /** + The tag or tags to target. + */ + tag: Tag | readonly Tag[]; + /** + If given, this maps the tags to a fixed class name. + */ + class?: string; + /** + Any further properties (if `class` isn't given) will be + interpreted as in style objects given to + [style-mod](https://github.com/marijnh/style-mod#documentation). + (The type here is `any` because of TypeScript limitations.) + */ + [styleProperty: string]: any; +} +/** +A default highlight style (works well with light themes). +*/ +declare const defaultHighlightStyle: HighlightStyle; + +interface Config { + /** + Whether the bracket matching should look at the character after + the cursor when matching (if the one before isn't a bracket). + Defaults to true. + */ + afterCursor?: boolean; + /** + The bracket characters to match, as a string of pairs. Defaults + to `"()[]{}"`. Note that these are only used as fallback when + there is no [matching + information](https://lezer.codemirror.net/docs/ref/#common.NodeProp^closedBy) + in the syntax tree. + */ + brackets?: string; + /** + The maximum distance to scan for matching brackets. This is only + relevant for brackets not encoded in the syntax tree. Defaults + to 10 000. + */ + maxScanDistance?: number; + /** + Can be used to configure the way in which brackets are + decorated. The default behavior is to add the + `cm-matchingBracket` class for matching pairs, and + `cm-nonmatchingBracket` for mismatched pairs or single brackets. + */ + renderMatch?: (match: MatchResult, state: EditorState) => readonly Range[]; +} +/** +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. +*/ +declare function bracketMatching(config?: Config): Extension; +/** +The result returned from `matchBrackets`. +*/ +interface MatchResult { + /** + The extent of the bracket token found. + */ + start: { + from: number; + to: number; + }; + /** + The extent of the matched token, if any was found. + */ + end?: { + from: number; + to: number; + }; + /** + Whether the tokens match. This can be false even when `end` has + a value, if that token doesn't match the opening token. + */ + matched: boolean; +} +/** +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. +*/ +declare function matchBrackets(state: EditorState, pos: number, dir: -1 | 1, config?: Config): MatchResult | null; + +/** +Encapsulates a single line of input. Given to stream syntax code, +which uses it to tokenize the content. +*/ +declare class StringStream { + /** + The line. + */ + string: string; + private tabSize; + /** + The current indent unit size. + */ + indentUnit: number; + /** + The current position on the line. + */ + pos: number; + /** + The start position of the current token. + */ + start: number; + private lastColumnPos; + private lastColumnValue; + /** + Create a stream. + */ + constructor( + /** + The line. + */ + string: string, tabSize: number, + /** + The current indent unit size. + */ + indentUnit: number); + /** + True if we are at the end of the line. + */ + eol(): boolean; + /** + True if we are at the start of the line. + */ + sol(): boolean; + /** + Get the next code unit after the current position, or undefined + if we're at the end of the line. + */ + peek(): string | undefined; + /** + Read the next code unit and advance `this.pos`. + */ + next(): string | void; + /** + Match the next character against the given string, regular + expression, or predicate. Consume and return it if it matches. + */ + eat(match: string | RegExp | ((ch: string) => boolean)): string | void; + /** + Continue matching characters that match the given string, + regular expression, or predicate function. Return true if any + characters were consumed. + */ + eatWhile(match: string | RegExp | ((ch: string) => boolean)): boolean; + /** + Consume whitespace ahead of `this.pos`. Return true if any was + found. + */ + eatSpace(): boolean; + /** + Move to the end of the line. + */ + skipToEnd(): void; + /** + Move to directly before the given character, if found on the + current line. + */ + skipTo(ch: string): boolean | void; + /** + Move back `n` characters. + */ + backUp(n: number): void; + /** + Get the column position at `this.pos`. + */ + column(): number; + /** + Get the indentation column of the current line. + */ + indentation(): number; + /** + 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: string | RegExp, consume?: boolean, caseInsensitive?: boolean): boolean | RegExpMatchArray | null; + /** + Get the current token. + */ + current(): string; +} + +/** +A stream parser parses or tokenizes content from start to end, +emitting tokens as it goes over it. It keeps a mutable (but +copyable) object with state, in which it can store information +about the current context. +*/ +interface StreamParser { + /** + Produce a start state for the parser. + */ + startState?(indentUnit: number): State; + /** + Read one token, advancing the stream past it, and returning a + string indicating the token's style tag—either the name of one + of the tags in + [`tags`](https://lezer.codemirror.net/docs/ref#highlight.tags), + or such a name suffixed by one or more tag + [modifier](https://lezer.codemirror.net/docs/ref#highlight.Tag^defineModifier) + names, separated by periods. For example `"keyword"` or + "`variableName.constant"`. + + It is okay to return a zero-length token, but only if that + updates the state so that the next call will return a non-empty + token again. + */ + token(stream: StringStream, state: State): string | null; + /** + This notifies the parser of a blank line in the input. It can + update its state here if it needs to. + */ + blankLine?(state: State, indentUnit: number): void; + /** + Copy a given state. By default, a shallow object copy is done + which also copies arrays held at the top level of the object. + */ + copyState?(state: State): State; + /** + Compute automatic indentation for the line that starts with the + given state and text. + */ + indent?(state: State, textAfter: string, context: IndentContext): number | null; + /** + Default [language data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) to + attach to this language. + */ + languageData?: { + [name: string]: any; + }; + /** + Extra tokens to use in this parser. When the tokenizer returns a + token name that exists as a property in this object, the + corresponding tag will be assigned to the token. + */ + tokenTable?: { + [name: string]: Tag; + }; +} +/** +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). +*/ +declare class StreamLanguage extends Language { + private constructor(); + /** + Define a stream language. + */ + static define(spec: StreamParser): StreamLanguage; + private getIndent; + get allowsNesting(): boolean; +} + +export { Config, HighlightStyle, IndentContext, LRLanguage, Language, LanguageDescription, LanguageSupport, MatchResult, ParseContext, StreamLanguage, StreamParser, StringStream, TagStyle, TreeIndentContext, bracketMatching, codeFolding, continuedIndent, defaultHighlightStyle, defineLanguageFacet, delimitedIndent, ensureSyntaxTree, flatIndent, foldAll, foldCode, foldEffect, foldGutter, foldInside, foldKeymap, foldNodeProp, foldService, foldable, foldedRanges, forceParsing, getIndentUnit, getIndentation, highlightingFor, indentNodeProp, indentOnInput, indentService, indentString, indentUnit, language, languageDataProp, matchBrackets, syntaxHighlighting, syntaxParserRunning, syntaxTree, syntaxTreeAvailable, unfoldAll, unfoldCode, unfoldEffect }; diff --git a/node_modules/@codemirror/language/dist/index.js b/node_modules/@codemirror/language/dist/index.js new file mode 100644 index 0000000000..aa7f7cc44b --- /dev/null +++ b/node_modules/@codemirror/language/dist/index.js @@ -0,0 +1,2310 @@ +import { NodeProp, Tree, IterMode, TreeFragment, Parser, NodeType, NodeSet } from '@lezer/common'; +import { StateEffect, StateField, Facet, EditorState, countColumn, combineConfig, RangeSet, RangeSetBuilder, Prec } from '@codemirror/state'; +import { ViewPlugin, logException, Decoration, EditorView, WidgetType, gutter, GutterMarker } from '@codemirror/view'; +import { tags, tagHighlighter, highlightTree, styleTags } from '@lezer/highlight'; +import { StyleModule } from 'style-mod'; + +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 NodeProp(); +/** +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 Facet.define({ + combine: baseData ? values => values.concat(baseData) : undefined + }); +} +/** +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 = []) { + this.data = data; + // Kludge to define EditorState.tree as a debugging helper, + // without the EditorState package actually knowing about + // languages and lezer trees. + if (!EditorState.prototype.hasOwnProperty("tree")) + Object.defineProperty(EditorState.prototype, "tree", { get() { return syntaxTree(this); } }); + this.parser = parser; + this.extension = [ + language.of(this), + EditorState.languageData.of((state, pos, side) => state.facet(languageDataFacetAt(state, pos, side))) + ].concat(extraExtensions); + } + /** + Query whether this language is active at the given position. + */ + isActiveAt(state, pos, side = -1) { + return languageDataFacetAt(state, pos, side) == 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(NodeProp.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 Tree) + 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__*/StateEffect.define(); +function languageDataFacetAt(state, pos, side) { + let topLang = state.facet(language); + if (!topLang) + return null; + let facet = topLang.data; + if (topLang.allowsNesting) { + for (let node = syntaxTree(state).topNode; node; node = node.enter(pos, side, IterMode.ExcludeBuffers)) + facet = node.type.prop(languageDataProp) || facet; + } + return facet; +} +/** +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) { + super(data, parser); + 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)] + })); + } + /** + Create a new instance of this language with a reconfigured + version of its parser. + */ + configure(options) { + return new LRLanguage(this.data, this.parser.configure(options)); + } + 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 : Tree.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; + return !parse ? null : parse.isDone(upto) || parse.work(timeout, upto) ? parse.tree : null; +} +/** +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 object for a Text document. +class DocInput { + constructor(doc, length = doc.length) { + this.doc = doc; + this.length = length; + this.cursorPos = 0; + this.string = ""; + this.cursor = doc.iter(); + } + 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, [], Tree.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 != Tree.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(TreeFragment.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(TreeFragment.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 = TreeFragment.applyChanges(fragments, ranges); + tree = Tree.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 Parser { + 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 Tree(NodeType.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 TreeFragment.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 /* Apply */, upto)) + newCx.takeTree(); + return new LanguageState(newCx); + } + static init(state) { + let vpTo = Math.min(3000 /* InitViewport */, state.doc.length); + let parseState = ParseContext.create(state.facet(language).parser, state, { from: 0, to: vpTo }); + if (!parseState.work(20 /* Apply */, vpTo)) + parseState.takeTree(); + return new LanguageState(parseState); + } +} +Language.state = /*@__PURE__*/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 /* MaxPause */); + return () => clearTimeout(timeout); +}; +if (typeof requestIdleCallback != "undefined") + requestIdle = (callback) => { + let idle = -1, timeout = setTimeout(() => { + idle = requestIdleCallback(callback, { timeout: 500 /* MaxPause */ - 100 /* MinPause */ }); + }, 100 /* 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__*/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) { + if (this.view.hasFocus) + this.chunkBudget += 50 /* 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 /* ChunkTime */; + this.chunkBudget = 3000 /* 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 /* MaxParseAhead */)) + return; + let endTime = Date.now() + Math.min(this.chunkBudget, 100 /* Slice */, deadline && !isInputPending ? Math.max(25 /* 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 /* 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 => 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. +*/ +const language = /*@__PURE__*/Facet.define({ + combine(languages) { return languages.length ? languages[0] : null; }, + enables: [Language.state, parseWorker] +}); +/** +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 at the start of a given line, or +`null` to indicate no appropriate indentation could be determined. +*/ +const indentService = /*@__PURE__*/Facet.define(); +/** +Facet for overriding the unit by which indentation happens. +Should be a string consisting either entirely of spaces or +entirely of tabs. When not set, this defaults to 2 spaces. +*/ +const indentUnit = /*@__PURE__*/Facet.define({ + combine: values => { + if (!values.length) + return " "; + if (!/^(?: +|\t+)$/.test(values[0])) + throw new Error("Invalid indent unit: " + JSON.stringify(values[0])); + return values[0]; + } +}); +/** +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; + if (state.facet(indentUnit).charCodeAt(0) == 9) + while (cols >= ts) { + result += "\t"; + cols -= ts; + } + for (let i = 0; i < cols; i++) + result += " "; + return result; +} +/** +Get the indentation 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 EditorState) + context = new IndentContext(context); + for (let service of context.state.facet(indentService)) { + let result = service(context, pos); + if (result != null) + return result; + } + let tree = syntaxTree(context.state); + return tree ? syntaxIndentation(context, tree, pos) : null; +} +/** +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 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 or null, where null indicates that no +definitive indentation can be determined. +*/ +const indentNodeProp = /*@__PURE__*/new NodeProp(); +// Compute the indentation for a given position from the syntax tree. +function syntaxIndentation(cx, ast, pos) { + return indentFrom(ast.resolveInner(pos).enterUnfinishedNodesBefore(pos), pos, cx); +} +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(NodeProp.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 indentFrom(node, pos, base) { + for (; node; node = node.parent) { + let strategy = indentStrategy(node); + if (strategy) + return strategy(TreeIndentContext.create(base, pos, node)); + } + return 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, + /** + The syntax tree node to which the indentation strategy + applies. + */ + node) { + super(base.state, base.options); + this.base = base; + this.pos = pos; + this.node = node; + } + /** + @internal + */ + static create(base, pos, node) { + return new TreeIndentContext(base, pos, node); + } + /** + 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() { + let line = this.state.doc.lineAt(this.node.from); + // Skip line starts that are covered by a sibling (or cousin, etc) + for (;;) { + let atBreak = this.node.resolve(line.from); + while (atBreak.parent && atBreak.parent.from == atBreak.from) + atBreak = atBreak.parent; + if (isParent(atBreak, this.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() { + let parent = this.node.parent; + return parent ? indentFrom(parent, this.pos, this.base) : 0; + } +} +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) + return next.from < lineEnd ? openToken : null; + 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 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__*/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 NodeProp(); +/** +[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 inner = tree.resolveInner(end); + let found = null; + for (let cur = inner; cur; cur = cur.parent) { + 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__*/StateEffect.define({ map: mapRange }); +/** +State effect that unfolds the given range (if it was folded). +*/ +const unfoldEffect = /*@__PURE__*/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; +} +const foldState = /*@__PURE__*/StateField.define({ + create() { + return Decoration.none; + }, + update(folded, tr) { + folded = folded.map(tr.changes); + for (let e of tr.effects) { + if (e.is(foldEffect) && !foldExists(folded, e.value.from, e.value.to)) + folded = folded.update({ add: [foldWidget.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) { + let onSelection = false, { head } = tr.selection.main; + folded.between(head, head, (a, b) => { if (a < head && b > head) + onSelection = true; }); + if (onSelection) + folded = folded.update({ + filterFrom: head, + filterTo: head, + filter: (a, b) => b <= head || a >= head + }); + } + return folded; + }, + provide: f => EditorView.decorations.from(f) +}); +/** +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(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 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; +}; +/** +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, + placeholderText: "…" +}; +const foldConfig = /*@__PURE__*/Facet.define({ + combine(values) { return 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; +} +const foldWidget = /*@__PURE__*/Decoration.replace({ widget: /*@__PURE__*/new class extends WidgetType { + toDOM(view) { + 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); + 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 foldGutterDefaults = { + openText: "⌄", + closedText: "›", + markerDOM: null, + domEventHandlers: {}, + foldingChanged: () => false +}; +class FoldMarker extends 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 = Object.assign(Object.assign({}, foldGutterDefaults), config); + let canFold = new FoldMarker(fullConfig, true), canUnfold = new FoldMarker(fullConfig, false); + let markers = 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 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, + gutter({ + class: "cm-foldGutter", + markers(view) { var _a; return ((_a = view.plugin(markers)) === null || _a === void 0 ? void 0 : _a.markers) || RangeSet.empty; }, + initialSpacer() { + return new FoldMarker(fullConfig, false); + }, + domEventHandlers: Object.assign(Object.assign({}, 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__*/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(spec, options) { + 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(spec.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__*/Facet.define(); +const fallbackHighlighter = /*@__PURE__*/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(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([EditorView.darkTheme], state => { + return state.facet(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)); + } + update(update) { + let tree = syntaxTree(update.state), highlighters = getHighlighters(update.state); + let styleChange = highlighters != getHighlighters(update.startState); + if (tree.length < update.view.viewport.to && !styleChange && tree.type == this.tree.type) { + this.decorations = this.decorations.map(update.changes); + } + else if (tree != this.tree || update.viewportChanged || styleChange) { + this.tree = tree; + this.decorations = this.buildDeco(update.view, highlighters); + } + } + buildDeco(view, highlighters) { + if (!highlighters || !this.tree.length) + return Decoration.none; + let builder = new 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] = Decoration.mark({ class: style }))); + }, from, to); + } + return builder.finish(); + } +} +const treeHighlighter = /*@__PURE__*/Prec.high(/*@__PURE__*/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: "#7a757a" }, + { 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__*/EditorView.baseTheme({ + "&.cm-focused .cm-matchingBracket": { backgroundColor: "#328c8252" }, + "&.cm-focused .cm-nonmatchingBracket": { backgroundColor: "#bb555544" } +}); +const DefaultScanDist = 10000, DefaultBrackets = "()[]{}"; +const bracketMatchingConfig = /*@__PURE__*/Facet.define({ + combine(configs) { + return combineConfig(configs, { + afterCursor: true, + brackets: DefaultBrackets, + maxScanDistance: DefaultScanDist, + renderMatch: defaultRenderMatch + }); + } +}); +const matchingMark = /*@__PURE__*/Decoration.mark({ class: "cm-matchingBracket" }), nonmatchingMark = /*@__PURE__*/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__*/StateField.define({ + create() { return 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 Decoration.set(decorations, true); + }, + provide: f => 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]; +} +function matchingNodes(node, dir, brackets) { + let byProp = node.prop(dir < 0 ? NodeProp.openedBy : NodeProp.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; +} +/** +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) + return matchMarkedBrackets(state, pos, dir, cur, matches, brackets); + } + return matchPlainBrackets(state, pos, dir, tree, node.type, maxScanDistance, brackets); +} +function matchMarkedBrackets(_state, _pos, dir, token, matching, brackets) { + let parent = token.parent, firstToken = { from: token.from, to: token.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) { + return { start: firstToken, end: { from: cursor.from, to: cursor.to }, matched: true }; + } + else if (matchingNodes(cursor.type, dir, brackets)) { + depth++; + } + else if (matchingNodes(cursor.type, -dir, brackets)) { + depth--; + if (depth == 0) + return { + start: firstToken, + end: cursor.from == cursor.to ? undefined : { from: cursor.from, to: cursor.to }, + matched: false + }; + } + } + } 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.resolve(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) { + this.string = string; + this.tabSize = tabSize; + this.indentUnit = indentUnit; + /** + 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() { + return 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 { + 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 + }; +} +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; +} +/** +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 Parser { + createParse(input, fragments, ranges) { + return new Parse(self, input, fragments, ranges); + } + }; + super(data, impl, [indentService.of((cx, pos) => this.getIndent(cx, pos))]); + this.topNode = docID(data); + self = this; + this.streamParser = p; + this.stateAfter = new NodeProp({ perNode: true }); + this.tokenTable = parser.tokenTable ? new TokenTable(p.tokenTable) : defaultTokenTable; + } + /** + Define a stream language. + */ + static define(spec) { return new StreamLanguage(spec); } + getIndent(cx, pos) { + let tree = syntaxTree(cx.state), at = tree.resolve(pos); + while (at && at.type != this.topNode) + at = at.parent; + if (!at) + return null; + let start = findState(this, tree, 0, at.from, pos), statePos, state; + if (start) { + state = start.state; + statePos = start.pos + 1; + } + else { + state = this.streamParser.startState(cx.unit); + statePos = 0; + } + if (pos - statePos > 10000 /* MaxIndentScanDist */) + return null; + while (statePos < pos) { + let line = cx.state.doc.lineAt(statePos), end = Math.min(pos, line.to); + if (line.length) { + let stream = new StringStream(line.text, cx.state.tabSize, cx.unit); + while (stream.pos < end - line.from) + readToken(this.streamParser.token, stream, state); + } + else { + this.streamParser.blankLine(state, cx.unit); + } + if (end == pos) + break; + statePos = line.to + 1; + } + let { text } = cx.lineAt(pos); + return this.streamParser.indent(state, /^\s*(.*)/.exec(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 Tree && 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 && 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 Tree) { + if (!(inner = cutTree(lang, child, from - pos, to - pos, inside))) + break; + return !inside ? inner + : new Tree(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, 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 && (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: Tree.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, 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 /* MaxDistanceBeforeViewport */) { + 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 + 2048 /* 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, size, offset) { + 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; + } + 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, 4, offset); + if (stream.start > 10000 /* MaxLineLength */) + break; + } + } + this.parsedPos = end; + this.moveRangeIndex(); + if (this.parsedPos < this.to) + this.parsedPos++; + } + finishChunk() { + let tree = Tree.build({ + buffer: this.chunk, + start: this.chunkStart, + length: this.parsedPos - this.chunkStart, + nodeSet, + topID: 0, + maxBufferLength: 2048 /* ChunkSize */, + reused: this.chunkReused + }); + tree = new Tree(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 Tree(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 = [NodeType.none]; +const nodeSet = /*@__PURE__*/new NodeSet(typeArray); +const warned = []; +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", "typeName"], + ["attribute", "propertyName"], + ["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 tag = null; + for (let part of tagStr.split(".")) { + let value = (extra[part] || tags[part]); + if (!value) { + warnForPart(part, `Unknown highlighting tag ${part}`); + } + else if (typeof value == "function") { + if (!tag) + warnForPart(part, `Modifier ${part} used at start of tag`); + else + tag = value(tag); + } + else { + if (tag) + warnForPart(part, `Tag ${part} used as modifier`); + else + tag = value; + } + } + if (!tag) + return 0; + let name = tagStr.replace(/ /g, "_"), type = NodeType.define({ + id: typeArray.length, + name, + props: [styleTags({ [name]: tag })] + }); + typeArray.push(type); + return type.id; +} +function docID(data) { + let type = NodeType.define({ id: typeArray.length, name: "Document", props: [languageDataProp.add(() => data)] }); + typeArray.push(type); + return type; +} + +export { HighlightStyle, IndentContext, LRLanguage, Language, LanguageDescription, LanguageSupport, ParseContext, StreamLanguage, StringStream, TreeIndentContext, bracketMatching, codeFolding, continuedIndent, defaultHighlightStyle, defineLanguageFacet, delimitedIndent, ensureSyntaxTree, flatIndent, foldAll, foldCode, foldEffect, foldGutter, foldInside, foldKeymap, foldNodeProp, foldService, foldable, foldedRanges, forceParsing, getIndentUnit, getIndentation, highlightingFor, indentNodeProp, indentOnInput, indentService, indentString, indentUnit, language, languageDataProp, matchBrackets, syntaxHighlighting, syntaxParserRunning, syntaxTree, syntaxTreeAvailable, unfoldAll, unfoldCode, unfoldEffect }; diff --git a/node_modules/@codemirror/language/package.json b/node_modules/@codemirror/language/package.json new file mode 100644 index 0000000000..50a827caa2 --- /dev/null +++ b/node_modules/@codemirror/language/package.json @@ -0,0 +1,44 @@ +{ + "name": "@codemirror/language", + "version": "6.0.0", + "description": "Language support infrastructure for the CodeMirror code editor", + "scripts": { + "test": "cm-runtests", + "prepare": "cm-buildhelper src/index.ts" + }, + "keywords": [ + "editor", + "code" + ], + "author": { + "name": "Marijn Haverbeke", + "email": "marijnh@gmail.com", + "url": "http://marijnhaverbeke.nl" + }, + "type": "module", + "main": "dist/index.cjs", + "exports": { + "import": "./dist/index.js", + "require": "./dist/index.cjs" + }, + "types": "dist/index.d.ts", + "module": "dist/index.js", + "sideEffects": false, + "license": "MIT", + "dependencies": { + "@codemirror/state": "^6.0.0", + "@codemirror/view": "^6.0.0", + "@lezer/common": "^1.0.0", + "@lezer/highlight": "^1.0.0", + "@lezer/lr": "^1.0.0", + "style-mod": "^4.0.0" + }, + "devDependencies": { + "@codemirror/buildhelper": "^0.1.5", + "@lezer/javascript": "^1.0.0" + }, + "repository": { + "type": "git", + "url": "https://github.com/codemirror/language.git" + } +} diff --git a/node_modules/@codemirror/lint/.github/workflows/dispatch.yml b/node_modules/@codemirror/lint/.github/workflows/dispatch.yml new file mode 100644 index 0000000000..955205089e --- /dev/null +++ b/node_modules/@codemirror/lint/.github/workflows/dispatch.yml @@ -0,0 +1,16 @@ +name: Trigger CI +on: push + +jobs: + build: + name: Dispatch to main repo + runs-on: ubuntu-latest + steps: + - name: Emit repository_dispatch + uses: mvasigh/dispatch-action@main + with: + # You should create a personal access token and store it in your repository + token: ${{ secrets.DISPATCH_AUTH }} + repo: codemirror.next + owner: codemirror + event_type: push diff --git a/node_modules/@codemirror/lint/CHANGELOG.md b/node_modules/@codemirror/lint/CHANGELOG.md new file mode 100644 index 0000000000..1708eb4227 --- /dev/null +++ b/node_modules/@codemirror/lint/CHANGELOG.md @@ -0,0 +1,150 @@ +## 6.0.0 (2022-06-08) + +### Breaking changes + +Update dependencies to 6.0.0 + +## 0.20.3 (2022-05-25) + +### New features + +Diagnostic objects may now have a `renderMessage` method to render their message to the DOM. + +## 0.20.2 (2022-05-02) + +### New features + +The package now exports the `LintSource` function type. + +The new `markerFilter` and `tooltipFilter` options to `linter` and `lintGutter` allow more control over which diagnostics are visible and which have tooltips. + +## 0.20.1 (2022-04-22) + +### Bug fixes + +Hide lint tooltips when the document is changed. + +## 0.20.0 (2022-04-20) + +### Breaking changes + +Update dependencies to 0.20.0 + +## 0.19.6 (2022-03-04) + +### Bug fixes + +Fix a bug where hovering over the icons in the lint gutter would sometimes fail to show a tooltip or show the tooltip for another line. + +## 0.19.5 (2022-02-25) + +### Bug fixes + +Make sure the lint gutter tooltips are positioned under their icon, even when the line is wrapped. + +## 0.19.4 (2022-02-25) + +### Bug fixes + +Fix an issue where an outdated marker could stick around on the lint gutter after all diagnostics were removed. + +### New features + +Add a `hoverTime` option to the lint gutter. Change default hover time to 300 + +## 0.19.3 (2021-11-09) + +### New features + +Export a function `lintGutter` which returns an extension that installs a gutter marking lines with diagnostics. + +The package now exports the effect used to update the diagnostics (`setDiagnosticsEffect`). + +## 0.19.2 (2021-09-29) + +### Bug fixes + +Fix a bug where reconfiguring the lint source didn't restart linting. + +## 0.19.1 (2021-09-17) + +### Bug fixes + +Prevent decorations that cover just a line break from being invisible by showing a widget instead of range for them. + +### New features + +The `diagnosticCount` method can now be used to determine whether there are active diagnostics. + +## 0.19.0 (2021-08-11) + +### Breaking changes + +Update dependencies to 0.19.0 + +## 0.18.6 (2021-08-08) + +### Bug fixes + +Fix a crash in the key handler of the lint panel when no diagnostics are available. + +## 0.18.5 (2021-08-07) + +### Bug fixes + +Fix an issue that caused `openLintPanel` to not actually open the panel when ran before the editor had any lint state loaded. + +### New features + +The package now exports a `forceLinting` function that forces pending lint queries to run immediately. + +## 0.18.4 (2021-06-07) + +### Bug fixes + +Multiple `linter` extensions can now be added to an editor without disrupting each other. + +Fix poor layout on lint tooltips due to changes in @codemirror/tooltip. + +## 0.18.3 (2021-05-10) + +### Bug fixes + +Fix a regression where using `setDiagnostics` when linting hadn't been abled yet ignored the first set of diagnostics. + +## 0.18.2 (2021-04-16) + +### Bug fixes + +Newlines in line messages are now shown as line breaks to the user. + +### New features + +You can now pass a delay option to `linter` to configure how long it waits before calling the linter. + +## 0.18.1 (2021-03-15) + +### Bug fixes + +Adjust to current @codemirror/panel and @codemirror/tooltip interfaces. + +## 0.18.0 (2021-03-03) + +### Bug fixes + +Make sure action access keys are discoverable for screen reader users. + +Selection in the lint panel should now be properly visible to screen readers. + +## 0.17.1 (2021-01-06) + +### New features + +The package now also exports a CommonJS module. + +## 0.17.0 (2020-12-29) + +### Breaking changes + +First numbered release. + diff --git a/node_modules/@codemirror/lint/LICENSE b/node_modules/@codemirror/lint/LICENSE new file mode 100644 index 0000000000..3af12e62d9 --- /dev/null +++ b/node_modules/@codemirror/lint/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (C) 2018-2021 by Marijn Haverbeke and others + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/node_modules/@codemirror/lint/README.md b/node_modules/@codemirror/lint/README.md new file mode 100644 index 0000000000..eb0b24bbce --- /dev/null +++ b/node_modules/@codemirror/lint/README.md @@ -0,0 +1,18 @@ +# @codemirror/lint [![NPM version](https://img.shields.io/npm/v/@codemirror/lint.svg)](https://www.npmjs.org/package/@codemirror/lint) + +[ [**WEBSITE**](https://codemirror.net/6/) | [**DOCS**](https://codemirror.net/6/docs/ref/#lint) | [**ISSUES**](https://github.com/codemirror/codemirror.next/issues) | [**FORUM**](https://discuss.codemirror.net/c/next/) | [**CHANGELOG**](https://github.com/codemirror/lint/blob/main/CHANGELOG.md) ] + +This package implements linting support for the +[CodeMirror](https://codemirror.net/6/) code editor. + +The [project page](https://codemirror.net/6/) has more information, a +number of [examples](https://codemirror.net/6/examples/) and the +[documentation](https://codemirror.net/6/docs/). + +This code is released under an +[MIT license](https://github.com/codemirror/lint/tree/main/LICENSE). + +We aim to be an inclusive, welcoming community. To make that explicit, +we have a [code of +conduct](http://contributor-covenant.org/version/1/1/0/) that applies +to communication around the project. diff --git a/node_modules/@codemirror/lint/dist/index.cjs b/node_modules/@codemirror/lint/dist/index.cjs new file mode 100644 index 0000000000..349d568314 --- /dev/null +++ b/node_modules/@codemirror/lint/dist/index.cjs @@ -0,0 +1,749 @@ +'use strict'; + +Object.defineProperty(exports, '__esModule', { value: true }); + +var view = require('@codemirror/view'); +var state = require('@codemirror/state'); +var elt = require('crelt'); + +function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; } + +var elt__default = /*#__PURE__*/_interopDefaultLegacy(elt); + +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 markedDiagnostics = diagnostics; + let diagnosticFilter = state.facet(lintConfig).markerFilter; + if (diagnosticFilter) + markedDiagnostics = diagnosticFilter(markedDiagnostics); + let ranges = view.Decoration.set(markedDiagnostics.map((d) => { + // For zero-length ranges or ranges covering only a line break, create a widget + return d.from == d.to || (d.from == d.to - 1 && state.doc.lineAt(d.from).to == d.from) + ? view.Decoration.widget({ + widget: new DiagnosticWidget(d), + diagnostic: d + }).range(d.from) + : view.Decoration.mark({ + attributes: { class: "cm-lintRange cm-lintRange-" + d.severity }, + diagnostic: d + }).range(d.from, d.to); + }), true); + return new LintState(ranges, panel, findDiagnostic(ranges)); + } +} +function findDiagnostic(diagnostics, diagnostic = null, after = 0) { + let found = null; + diagnostics.between(after, 1e9, (from, to, { spec }) => { + if (diagnostic && spec.diagnostic != diagnostic) + return; + found = new SelectedDiagnostic(from, to, spec.diagnostic); + return false; + }); + return found; +} +function hideTooltip(tr, tooltip) { + return !!(tr.effects.some(e => e.is(setDiagnosticsEffect)) || tr.changes.touchesRange(tooltip.pos)); +} +function maybeEnableLint(state$1, effects) { + return state$1.field(lintState, false) ? effects : effects.concat(state.StateEffect.appendConfig.of([ + lintState, + 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) + ]); + }), + view.hoverTooltip(lintTooltip, { hideOn: hideTooltip }), + baseTheme + ])); +} +/** +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 = state.StateEffect.define(); +const togglePanel = state.StateEffect.define(); +const movePanelSelection = state.StateEffect.define(); +const lintState = state.StateField.define({ + create() { + return new LintState(view.Decoration.none, null, null); + }, + update(value, tr) { + if (tr.docChanged) { + let mapped = value.diagnostics.map(tr.changes), selected = null; + if (value.selected) { + let selPos = tr.changes.mapPos(value.selected.from, 1); + selected = findDiagnostic(mapped, value.selected.diagnostic, selPos) || findDiagnostic(mapped, null, selPos); + } + value = new LintState(mapped, value.panel, selected); + } + for (let effect of tr.effects) { + if (effect.is(setDiagnosticsEffect)) { + value = LintState.init(effect.value, value.panel, tr.state); + } + else if (effect.is(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 = view.Decoration.mark({ class: "cm-lintRange cm-lintRange-active" }); +function lintTooltip(view, pos, side) { + let { diagnostics } = view.state.field(lintState); + let found = [], stackStart = 2e8, stackEnd = 0; + 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.push(spec.diagnostic); + stackStart = Math.min(from, stackStart); + stackEnd = Math.max(to, stackEnd); + } + }); + let diagnosticFilter = view.state.facet(lintConfig).tooltipFilter; + if (diagnosticFilter) + found = diagnosticFilter(found); + if (!found.length) + return null; + return { + pos: stackStart, + end: stackEnd, + above: view.state.doc.lineAt(stackStart).to < stackEnd, + create() { + return { dom: diagnosticsTooltip(view, found) }; + } + }; +} +function diagnosticsTooltip(view, diagnostics) { + return elt__default["default"]("ul", { class: "cm-tooltip-lint" }, diagnostics.map(d => renderDiagnostic(view, d, false))); +} +/** +Command to open and focus the lint panel. +*/ +const openLintPanel = (view$1) => { + let field = view$1.state.field(lintState, false); + if (!field || !field.panel) + view$1.dispatch({ effects: maybeEnableLint(view$1.state, [togglePanel.of(true)]) }); + let panel = view.getPanel(view$1, 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: 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; +}; +/** +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 }, + { key: "F8", run: nextDiagnostic } +]; +const lintPlugin = view.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() { + let now = Date.now(); + if (now < this.lintTime - 10) { + setTimeout(this.run, this.lintTime - now); + } + else { + this.set = false; + let { state } = this.view, { sources } = state.facet(lintConfig); + Promise.all(sources.map(source => Promise.resolve(source(this.view)))).then(annotations => { + let all = annotations.reduce((a, b) => a.concat(b)); + if (this.view.state.doc == state.doc) + this.view.dispatch(setDiagnostics(this.view.state, all)); + }, error => { view.logException(this.view.state, error); }); + } + } + update(update) { + let config = update.state.facet(lintConfig); + if (update.docChanged || config != update.startState.facet(lintConfig)) { + 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); + } +}); +const lintConfig = state.Facet.define({ + combine(input) { + return Object.assign({ sources: input.map(i => i.source) }, state.combineConfig(input.map(i => i.config), { + delay: 750, + markerFilter: null, + tooltipFilter: null + })); + }, + enables: lintPlugin +}); +/** +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). +*/ +function linter(source, config = {}) { + return lintConfig.of({ source, config }); +} +/** +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 elt__default["default"]("li", { class: "cm-diagnostic cm-diagnostic-" + diagnostic.severity }, elt__default["default"]("span", { class: "cm-diagnosticText" }, diagnostic.renderMessage ? diagnostic.renderMessage() : diagnostic.message), (_a = diagnostic.actions) === null || _a === void 0 ? void 0 : _a.map((action, i) => { + let click = (e) => { + e.preventDefault(); + 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), + elt__default["default"]("u", name.slice(keyIndex, keyIndex + 1)), + name.slice(keyIndex + 1)]; + return elt__default["default"]("button", { + type: "button", + class: "cm-diagnosticAction", + onclick: click, + onmousedown: click, + "aria-label": ` Action: ${name}${keyIndex < 0 ? "" : ` (access key "${keys[i]})"`}.` + }, nameElt); + }), diagnostic.source && elt__default["default"]("div", { class: "cm-diagnosticSource" }, diagnostic.source)); +} +class DiagnosticWidget extends view.WidgetType { + constructor(diagnostic) { + super(); + this.diagnostic = diagnostic; + } + eq(other) { return other.diagnostic == this.diagnostic; } + toDOM() { + return elt__default["default"]("span", { class: "cm-lintPoint cm-lintPoint-" + this.diagnostic.severity }); + } +} +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 = elt__default["default"]("ul", { + tabIndex: 0, + role: "listbox", + "aria-label": this.view.state.phrase("Diagnostics"), + onkeydown, + onclick + }); + this.dom = elt__default["default"]("div", { class: "cm-panel-lint" }, this.list, elt__default["default"]("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; + diagnostics.between(0, this.view.state.doc.length, (_start, _end, { spec }) => { + let found = -1, item; + for (let j = i; j < this.items.length; j++) + if (this.items[j].diagnostic == spec.diagnostic) { + found = j; + break; + } + if (found < 0) { + item = new PanelItem(this.view, spec.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 }) => { + if (sel.top < panel.top) + this.list.scrollTop -= panel.top - sel.top; + else if (sel.bottom > panel.bottom) + this.list.scrollTop += sel.bottom - panel.bottom; + } + }); + } + 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,${encodeURIComponent(content)}')`; +} +function underline(color) { + return svg(``, `width="6" height="3"`); +} +const baseTheme = 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-diagnosticAction": { + font: "inherit", + border: "none", + padding: "2px 4px", + backgroundColor: "#444", + color: "white", + borderRadius: "3px", + marginLeft: "8px" + }, + ".cm-diagnosticSource": { + fontSize: "70%", + opacity: .7 + }, + ".cm-lintRange": { + backgroundPosition: "left bottom", + backgroundRepeat: "repeat-x", + paddingBottom: "0.7px", + }, + ".cm-lintRange-error": { backgroundImage: underline("#d11") }, + ".cm-lintRange-warning": { backgroundImage: underline("orange") }, + ".cm-lintRange-info": { backgroundImage: underline("#999") }, + ".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-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 + } + } +}); +class LintGutterMarker extends view.GutterMarker { + constructor(diagnostics) { + super(); + this.diagnostics = diagnostics; + this.severity = diagnostics.reduce((max, d) => { + let s = d.severity; + return s == "error" || s == "warning" && max == "info" ? s : max; + }, "info"); + } + 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); + 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 /* Margin */ && event.clientX < rect.right + 10 /* Margin */ && + event.clientY > rect.top - 10 /* Margin */ && event.clientY < rect.bottom + 10 /* 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, + 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 = view.gutter({ + class: "cm-gutter-lint", + markers: view => view.state.field(lintGutterMarkers), +}); +const lintGutterMarkers = 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 || []); + markers = markersForDiagnostics(tr.state.doc, diagnostics.slice(0)); + } + } + return markers; + } +}); +const setLintGutterTooltip = state.StateEffect.define(); +const lintGutterTooltip = state.StateField.define({ + create() { return null; }, + update(tooltip, tr) { + if (tooltip && tr.docChanged) + tooltip = hideTooltip(tr, tooltip) ? null : Object.assign(Object.assign({}, 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 = 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: svg(``) + }, + ".cm-lint-marker-warning": { + content: svg(``), + }, + ".cm-lint-marker-error:before": { + content: svg(``) + }, +}); +const lintGutterConfig = state.Facet.define({ + combine(configs) { + return state.combineConfig(configs, { + hoverTime: 300 /* 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]; +} + +exports.closeLintPanel = closeLintPanel; +exports.diagnosticCount = diagnosticCount; +exports.forceLinting = forceLinting; +exports.lintGutter = lintGutter; +exports.lintKeymap = lintKeymap; +exports.linter = linter; +exports.nextDiagnostic = nextDiagnostic; +exports.openLintPanel = openLintPanel; +exports.setDiagnostics = setDiagnostics; +exports.setDiagnosticsEffect = setDiagnosticsEffect; diff --git a/node_modules/@codemirror/lint/dist/index.d.ts b/node_modules/@codemirror/lint/dist/index.d.ts new file mode 100644 index 0000000000..c4f9951ead --- /dev/null +++ b/node_modules/@codemirror/lint/dist/index.d.ts @@ -0,0 +1,149 @@ +import * as _codemirror_state from '@codemirror/state'; +import { EditorState, TransactionSpec, Extension } from '@codemirror/state'; +import { EditorView, Command, KeyBinding } from '@codemirror/view'; + +/** +Describes a problem or hint for a piece of code. +*/ +interface Diagnostic { + /** + The start position of the relevant text. + */ + from: number; + /** + The end position. May be equal to `from`, though actually + covering text is preferable. + */ + to: number; + /** + The severity of the problem. This will influence how it is + displayed. + */ + severity: "info" | "warning" | "error"; + /** + An optional source string indicating where the diagnostic is + coming from. You can put the name of your linter here, if + applicable. + */ + source?: string; + /** + The message associated with this diagnostic. + */ + message: string; + /** + An optional custom rendering function that displays the message + as a DOM node. + */ + renderMessage?: () => Node; + /** + An optional array of actions that can be taken on this + diagnostic. + */ + actions?: readonly Action[]; +} +/** +An action associated with a diagnostic. +*/ +interface Action { + /** + The label to show to the user. Should be relatively short. + */ + name: string; + /** + The function to call when the user activates this action. Is + given the diagnostic's _current_ position, which may have + changed since the creation of the diagnostic, due to editing. + */ + apply: (view: EditorView, from: number, to: number) => void; +} +declare type DiagnosticFilter = (diagnostics: readonly Diagnostic[]) => Diagnostic[]; +interface LintConfig { + /** + Time to wait (in milliseconds) after a change before running + the linter. Defaults to 750ms. + */ + delay?: number; + /** + Optional filter to determine which diagnostics produce markers + in the content. + */ + markerFilter?: null | DiagnosticFilter; + /** + Filter applied to a set of diagnostics shown in a tooltip. No + tooltip will appear if the empty set is returned. + */ + tooltipFilter?: null | DiagnosticFilter; +} +interface LintGutterConfig { + /** + The delay before showing a tooltip when hovering over a lint gutter marker. + */ + hoverTime?: number; + /** + Optional filter determining which diagnostics show a marker in + the gutter. + */ + markerFilter?: null | DiagnosticFilter; + /** + Optional filter for diagnostics displayed in a tooltip, which + can also be used to prevent a tooltip appearing. + */ + tooltipFilter?: null | DiagnosticFilter; +} +/** +Returns a transaction spec which updates the current set of +diagnostics, and enables the lint extension if if wasn't already +active. +*/ +declare function setDiagnostics(state: EditorState, diagnostics: readonly Diagnostic[]): TransactionSpec; +/** +The state effect that updates the set of active diagnostics. Can +be useful when writing an extension that needs to track these. +*/ +declare const setDiagnosticsEffect: _codemirror_state.StateEffectType; +/** +Returns the number of active lint diagnostics in the given state. +*/ +declare function diagnosticCount(state: EditorState): number; +/** +Command to open and focus the lint panel. +*/ +declare const openLintPanel: Command; +/** +Command to close the lint panel, when open. +*/ +declare const closeLintPanel: Command; +/** +Move the selection to the next diagnostic. +*/ +declare const nextDiagnostic: Command; +/** +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) +*/ +declare const lintKeymap: readonly KeyBinding[]; +/** +The type of a function that produces diagnostics. +*/ +declare type LintSource = (view: EditorView) => readonly Diagnostic[] | Promise; +/** +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). +*/ +declare function linter(source: LintSource, config?: LintConfig): Extension; +/** +Forces any linters [configured](https://codemirror.net/6/docs/ref/#lint.linter) to run when the +editor is idle to run right away. +*/ +declare function forceLinting(view: EditorView): void; +/** +Returns an extension that installs a gutter showing markers for +each line that has diagnostics, which can be hovered over to see +the diagnostics. +*/ +declare function lintGutter(config?: LintGutterConfig): Extension; + +export { Action, Diagnostic, LintSource, closeLintPanel, diagnosticCount, forceLinting, lintGutter, lintKeymap, linter, nextDiagnostic, openLintPanel, setDiagnostics, setDiagnosticsEffect }; diff --git a/node_modules/@codemirror/lint/dist/index.js b/node_modules/@codemirror/lint/dist/index.js new file mode 100644 index 0000000000..de139bab45 --- /dev/null +++ b/node_modules/@codemirror/lint/dist/index.js @@ -0,0 +1,732 @@ +import { Decoration, showPanel, EditorView, ViewPlugin, hoverTooltip, logException, gutter, showTooltip, getPanel, WidgetType, GutterMarker } from '@codemirror/view'; +import { StateEffect, StateField, Facet, combineConfig, RangeSet } from '@codemirror/state'; +import elt from 'crelt'; + +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 markedDiagnostics = diagnostics; + let diagnosticFilter = state.facet(lintConfig).markerFilter; + if (diagnosticFilter) + markedDiagnostics = diagnosticFilter(markedDiagnostics); + let ranges = Decoration.set(markedDiagnostics.map((d) => { + // For zero-length ranges or ranges covering only a line break, create a widget + return d.from == d.to || (d.from == d.to - 1 && state.doc.lineAt(d.from).to == d.from) + ? Decoration.widget({ + widget: new DiagnosticWidget(d), + diagnostic: d + }).range(d.from) + : Decoration.mark({ + attributes: { class: "cm-lintRange cm-lintRange-" + d.severity }, + diagnostic: d + }).range(d.from, d.to); + }), true); + return new LintState(ranges, panel, findDiagnostic(ranges)); + } +} +function findDiagnostic(diagnostics, diagnostic = null, after = 0) { + let found = null; + diagnostics.between(after, 1e9, (from, to, { spec }) => { + if (diagnostic && spec.diagnostic != diagnostic) + return; + found = new SelectedDiagnostic(from, to, spec.diagnostic); + return false; + }); + return found; +} +function hideTooltip(tr, tooltip) { + return !!(tr.effects.some(e => e.is(setDiagnosticsEffect)) || tr.changes.touchesRange(tooltip.pos)); +} +function maybeEnableLint(state, effects) { + return state.field(lintState, false) ? effects : effects.concat(StateEffect.appendConfig.of([ + lintState, + EditorView.decorations.compute([lintState], state => { + let { selected, panel } = state.field(lintState); + return !selected || !panel || selected.from == selected.to ? Decoration.none : Decoration.set([ + activeMark.range(selected.from, selected.to) + ]); + }), + hoverTooltip(lintTooltip, { hideOn: hideTooltip }), + baseTheme + ])); +} +/** +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__*/StateEffect.define(); +const togglePanel = /*@__PURE__*/StateEffect.define(); +const movePanelSelection = /*@__PURE__*/StateEffect.define(); +const lintState = /*@__PURE__*/StateField.define({ + create() { + return new LintState(Decoration.none, null, null); + }, + update(value, tr) { + if (tr.docChanged) { + let mapped = value.diagnostics.map(tr.changes), selected = null; + if (value.selected) { + let selPos = tr.changes.mapPos(value.selected.from, 1); + selected = findDiagnostic(mapped, value.selected.diagnostic, selPos) || findDiagnostic(mapped, null, selPos); + } + value = new LintState(mapped, value.panel, selected); + } + for (let effect of tr.effects) { + if (effect.is(setDiagnosticsEffect)) { + value = LintState.init(effect.value, value.panel, tr.state); + } + else if (effect.is(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 => [showPanel.from(f, val => val.panel), + 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__*/Decoration.mark({ class: "cm-lintRange cm-lintRange-active" }); +function lintTooltip(view, pos, side) { + let { diagnostics } = view.state.field(lintState); + let found = [], stackStart = 2e8, stackEnd = 0; + 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.push(spec.diagnostic); + stackStart = Math.min(from, stackStart); + stackEnd = Math.max(to, stackEnd); + } + }); + let diagnosticFilter = view.state.facet(lintConfig).tooltipFilter; + if (diagnosticFilter) + found = diagnosticFilter(found); + if (!found.length) + return null; + return { + pos: stackStart, + end: stackEnd, + above: view.state.doc.lineAt(stackStart).to < stackEnd, + create() { + return { dom: diagnosticsTooltip(view, found) }; + } + }; +} +function diagnosticsTooltip(view, diagnostics) { + return elt("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, [togglePanel.of(true)]) }); + let panel = 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: 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; +}; +/** +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 }, + { key: "F8", run: nextDiagnostic } +]; +const lintPlugin = /*@__PURE__*/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() { + let now = Date.now(); + if (now < this.lintTime - 10) { + setTimeout(this.run, this.lintTime - now); + } + else { + this.set = false; + let { state } = this.view, { sources } = state.facet(lintConfig); + Promise.all(sources.map(source => Promise.resolve(source(this.view)))).then(annotations => { + let all = annotations.reduce((a, b) => a.concat(b)); + if (this.view.state.doc == state.doc) + this.view.dispatch(setDiagnostics(this.view.state, all)); + }, error => { logException(this.view.state, error); }); + } + } + update(update) { + let config = update.state.facet(lintConfig); + if (update.docChanged || config != update.startState.facet(lintConfig)) { + 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); + } +}); +const lintConfig = /*@__PURE__*/Facet.define({ + combine(input) { + return Object.assign({ sources: input.map(i => i.source) }, combineConfig(input.map(i => i.config), { + delay: 750, + markerFilter: null, + tooltipFilter: null + })); + }, + enables: lintPlugin +}); +/** +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). +*/ +function linter(source, config = {}) { + return lintConfig.of({ source, config }); +} +/** +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 elt("li", { class: "cm-diagnostic cm-diagnostic-" + diagnostic.severity }, elt("span", { class: "cm-diagnosticText" }, diagnostic.renderMessage ? diagnostic.renderMessage() : diagnostic.message), (_a = diagnostic.actions) === null || _a === void 0 ? void 0 : _a.map((action, i) => { + let click = (e) => { + e.preventDefault(); + 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), + elt("u", name.slice(keyIndex, keyIndex + 1)), + name.slice(keyIndex + 1)]; + return elt("button", { + type: "button", + class: "cm-diagnosticAction", + onclick: click, + onmousedown: click, + "aria-label": ` Action: ${name}${keyIndex < 0 ? "" : ` (access key "${keys[i]})"`}.` + }, nameElt); + }), diagnostic.source && elt("div", { class: "cm-diagnosticSource" }, diagnostic.source)); +} +class DiagnosticWidget extends WidgetType { + constructor(diagnostic) { + super(); + this.diagnostic = diagnostic; + } + eq(other) { return other.diagnostic == this.diagnostic; } + toDOM() { + return elt("span", { class: "cm-lintPoint cm-lintPoint-" + this.diagnostic.severity }); + } +} +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 = elt("ul", { + tabIndex: 0, + role: "listbox", + "aria-label": this.view.state.phrase("Diagnostics"), + onkeydown, + onclick + }); + this.dom = elt("div", { class: "cm-panel-lint" }, this.list, elt("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; + diagnostics.between(0, this.view.state.doc.length, (_start, _end, { spec }) => { + let found = -1, item; + for (let j = i; j < this.items.length; j++) + if (this.items[j].diagnostic == spec.diagnostic) { + found = j; + break; + } + if (found < 0) { + item = new PanelItem(this.view, spec.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 }) => { + if (sel.top < panel.top) + this.list.scrollTop -= panel.top - sel.top; + else if (sel.bottom > panel.bottom) + this.list.scrollTop += sel.bottom - panel.bottom; + } + }); + } + 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,${encodeURIComponent(content)}')`; +} +function underline(color) { + return svg(``, `width="6" height="3"`); +} +const baseTheme = /*@__PURE__*/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-diagnosticAction": { + font: "inherit", + border: "none", + padding: "2px 4px", + backgroundColor: "#444", + color: "white", + borderRadius: "3px", + marginLeft: "8px" + }, + ".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-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-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 + } + } +}); +class LintGutterMarker extends GutterMarker { + constructor(diagnostics) { + super(); + this.diagnostics = diagnostics; + this.severity = diagnostics.reduce((max, d) => { + let s = d.severity; + return s == "error" || s == "warning" && max == "info" ? s : max; + }, "info"); + } + 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); + 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 /* Margin */ && event.clientX < rect.right + 10 /* Margin */ && + event.clientY > rect.top - 10 /* Margin */ && event.clientY < rect.bottom + 10 /* 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, + 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 RangeSet.of(markers, true); +} +const lintGutterExtension = /*@__PURE__*/gutter({ + class: "cm-gutter-lint", + markers: view => view.state.field(lintGutterMarkers), +}); +const lintGutterMarkers = /*@__PURE__*/StateField.define({ + create() { + return 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 || []); + markers = markersForDiagnostics(tr.state.doc, diagnostics.slice(0)); + } + } + return markers; + } +}); +const setLintGutterTooltip = /*@__PURE__*/StateEffect.define(); +const lintGutterTooltip = /*@__PURE__*/StateField.define({ + create() { return null; }, + update(tooltip, tr) { + if (tooltip && tr.docChanged) + tooltip = hideTooltip(tr, tooltip) ? null : Object.assign(Object.assign({}, tooltip), { pos: tr.changes.mapPos(tooltip.pos) }); + return tr.effects.reduce((t, e) => e.is(setLintGutterTooltip) ? e.value : t, tooltip); + }, + provide: field => showTooltip.from(field) +}); +const lintGutterTheme = /*@__PURE__*/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(``) + }, + ".cm-lint-marker-warning": { + content: /*@__PURE__*/svg(``), + }, + ".cm-lint-marker-error:before": { + content: /*@__PURE__*/svg(``) + }, +}); +const lintGutterConfig = /*@__PURE__*/Facet.define({ + combine(configs) { + return combineConfig(configs, { + hoverTime: 300 /* 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]; +} + +export { closeLintPanel, diagnosticCount, forceLinting, lintGutter, lintKeymap, linter, nextDiagnostic, openLintPanel, setDiagnostics, setDiagnosticsEffect }; diff --git a/node_modules/@codemirror/lint/package.json b/node_modules/@codemirror/lint/package.json new file mode 100644 index 0000000000..70c0769029 --- /dev/null +++ b/node_modules/@codemirror/lint/package.json @@ -0,0 +1,40 @@ +{ + "name": "@codemirror/lint", + "version": "6.0.0", + "description": "Linting support for the CodeMirror code editor", + "scripts": { + "test": "cm-runtests", + "prepare": "cm-buildhelper src/lint.ts" + }, + "keywords": [ + "editor", + "code" + ], + "author": { + "name": "Marijn Haverbeke", + "email": "marijnh@gmail.com", + "url": "http://marijnhaverbeke.nl" + }, + "type": "module", + "main": "dist/index.cjs", + "exports": { + "import": "./dist/index.js", + "require": "./dist/index.cjs" + }, + "types": "dist/index.d.ts", + "module": "dist/index.js", + "sideEffects": false, + "license": "MIT", + "dependencies": { + "@codemirror/state": "^6.0.0", + "@codemirror/view": "^6.0.0", + "crelt": "^1.0.5" + }, + "devDependencies": { + "@codemirror/buildhelper": "^0.1.0" + }, + "repository": { + "type": "git", + "url": "https://github.com/codemirror/lint.git" + } +} diff --git a/node_modules/@codemirror/search/.github/workflows/dispatch.yml b/node_modules/@codemirror/search/.github/workflows/dispatch.yml new file mode 100644 index 0000000000..955205089e --- /dev/null +++ b/node_modules/@codemirror/search/.github/workflows/dispatch.yml @@ -0,0 +1,16 @@ +name: Trigger CI +on: push + +jobs: + build: + name: Dispatch to main repo + runs-on: ubuntu-latest + steps: + - name: Emit repository_dispatch + uses: mvasigh/dispatch-action@main + with: + # You should create a personal access token and store it in your repository + token: ${{ secrets.DISPATCH_AUTH }} + repo: codemirror.next + owner: codemirror + event_type: push diff --git a/node_modules/@codemirror/search/CHANGELOG.md b/node_modules/@codemirror/search/CHANGELOG.md new file mode 100644 index 0000000000..98874655a4 --- /dev/null +++ b/node_modules/@codemirror/search/CHANGELOG.md @@ -0,0 +1,174 @@ +## 6.0.0 (2022-06-08) + +### Bug fixes + +Don't crash when a custom search panel doesn't have a field named 'search'. + +Make sure replacements are announced to screen readers. + +## 0.20.1 (2022-04-22) + +### New features + +It is now possible to disable backslash escapes in search queries with the `literal` option. + +## 0.20.0 (2022-04-20) + +### Bug fixes + +Make the `wholeWords` option to `highlightSelectionMatches` default to false, as intended. + +## 0.19.10 (2022-04-04) + +### Bug fixes + +Make sure search matches are highlighted when scrolling new content into view. + +## 0.19.9 (2022-03-03) + +### New features + +The selection-matching extension now accepts a `wholeWords` option that makes it only highlight matches that span a whole word. Add SearchQuery.getCursor + +The `SearchQuery` class now has a `getCursor` method that allows external code to create a cursor for the query. + +## 0.19.8 (2022-02-14) + +### Bug fixes + +Fix a bug that caused the search panel to start open when configuring a state with the `search()` extension. + +## 0.19.7 (2022-02-14) + +### Breaking changes + +`searchConfig` is deprecated in favor of `search` (but will exist until next major release). + +### New features + +The new `search` function is now used to enable and configure the search extension. + +## 0.19.6 (2022-01-27) + +### Bug fixes + +Make `selectNextOccurrence` scroll the newly selected range into view. + +## 0.19.5 (2021-12-16) + +### Breaking changes + +The search option `matchCase` was renamed to `caseSensitive` (the old name will continue to work until the next breaking release). + +### Bug fixes + +`openSearchPanel` will now update the search query to the current selection even if the panel was already open. + +### New features + +Client code can now pass a custom search panel creation function in the search configuration. + +The `getSearchQuery` function and `setSearchQuery` effect can now be used to inspect or change the current search query. + +## 0.19.4 (2021-12-02) + +### Bug fixes + +The search panel will no longer show the replace interface when the editor is read-only. + +## 0.19.3 (2021-11-22) + +### Bug fixes + +Add `userEvent` annotations to search and replace transactions. + +Make sure the editor handles keys bound to `findNext`/`findPrevious` even when there are no matches, to avoid the browser's search interrupting users. + +### New features + +Add a `Symbol.iterator` property to the cursor types, so that they can be used with `for`/`of`. + +## 0.19.2 (2021-09-16) + +### Bug fixes + +`selectNextOccurrence` will now only select partial words if the current main selection hold a partial word. + +Explicitly set the button's type to prevent the browser from submitting forms wrapped around the editor. + +## 0.19.1 (2021-09-06) + +### Bug fixes + +Make `highlightSelectionMatches` not produce overlapping decorations, since those tend to just get unreadable. + +Make sure any existing search text is selected when opening the search panel. Add search config option to not match case when search panel is opened (#4) + +### New features + +The `searchConfig` function now takes a `matchCase` option that controls whether the search panel starts in case-sensitive mode. + +## 0.19.0 (2021-08-11) + +### Bug fixes + +Make sure to prevent the native Mod-d behavior so that the editor doesn't lose focus after selecting past the last occurrence. + +## 0.18.4 (2021-05-27) + +### New features + +Initialize the search query to the current selection, when there is one, when opening the search dialog. + +Add a `searchConfig` function, supporting an option to put the search panel at the top of the editor. + +## 0.18.3 (2021-05-18) + +### Bug fixes + +Fix a bug where the first search command in a new editor wouldn't properly open the panel. + +### New features + +New command `selectNextOccurrence` that selects the next occurrence of the selected word (bound to Mod-d in the search keymap). + +## 0.18.2 (2021-03-19) + +### Bug fixes + +The search interface and cursor will no longer include overlapping matches (aligning with what all other editors are doing). + +### New features + +The package now exports a `RegExpCursor` which is a search cursor that matches regular expression patterns. + +The search/replace interface now allows the user to use regular expressions. + +The `SearchCursor` class now has a `nextOverlapping` method that includes matches that start inside the previous match. + +Basic backslash escapes (\n, \r, \t, and \\) are now accepted in string search patterns in the UI. + +## 0.18.1 (2021-03-15) + +### Bug fixes + +Fix an issue where entering an invalid input in the goto-line dialog would submit a form and reload the page. + +## 0.18.0 (2021-03-03) + +### Breaking changes + +Update dependencies to 0.18. + +## 0.17.1 (2021-01-06) + +### New features + +The package now also exports a CommonJS module. + +## 0.17.0 (2020-12-29) + +### Breaking changes + +First numbered release. + diff --git a/node_modules/@codemirror/search/LICENSE b/node_modules/@codemirror/search/LICENSE new file mode 100644 index 0000000000..3af12e62d9 --- /dev/null +++ b/node_modules/@codemirror/search/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (C) 2018-2021 by Marijn Haverbeke and others + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/node_modules/@codemirror/search/README.md b/node_modules/@codemirror/search/README.md new file mode 100644 index 0000000000..602e3665a9 --- /dev/null +++ b/node_modules/@codemirror/search/README.md @@ -0,0 +1,18 @@ +# @codemirror/search [![NPM version](https://img.shields.io/npm/v/@codemirror/search.svg)](https://www.npmjs.org/package/@codemirror/search) + +[ [**WEBSITE**](https://codemirror.net/6/) | [**DOCS**](https://codemirror.net/6/docs/ref/#search) | [**ISSUES**](https://github.com/codemirror/codemirror.next/issues) | [**FORUM**](https://discuss.codemirror.net/c/next/) | [**CHANGELOG**](https://github.com/codemirror/search/blob/main/CHANGELOG.md) ] + +This package implements search functionality for the +[CodeMirror](https://codemirror.net/6/) code editor. + +The [project page](https://codemirror.net/6/) has more information, a +number of [examples](https://codemirror.net/6/examples/) and the +[documentation](https://codemirror.net/6/docs/). + +This code is released under an +[MIT license](https://github.com/codemirror/search/tree/main/LICENSE). + +We aim to be an inclusive, welcoming community. To make that explicit, +we have a [code of +conduct](http://contributor-covenant.org/version/1/1/0/) that applies +to communication around the project. diff --git a/node_modules/@codemirror/search/dist/index.cjs b/node_modules/@codemirror/search/dist/index.cjs new file mode 100644 index 0000000000..b1eb8f3e80 --- /dev/null +++ b/node_modules/@codemirror/search/dist/index.cjs @@ -0,0 +1,1150 @@ +'use strict'; + +Object.defineProperty(exports, '__esModule', { value: true }); + +var view = require('@codemirror/view'); +var state = require('@codemirror/state'); +var elt = require('crelt'); + +function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; } + +var elt__default = /*#__PURE__*/_interopDefaultLegacy(elt); + +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) { + /** + 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 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 = state.fromCodePoint(next), start = this.bufferStart + this.bufferPos; + this.bufferPos += state.codePointSize(next); + let norm = this.normalize(str); + for (let i = 0, pos = start;; i++) { + let code = norm.charCodeAt(i); + let match = this.match(code, pos); + if (match) { + this.value = match; + return this; + } + if (i == norm.length - 1) + break; + if (pos == start && i < str.length && str.charCodeAt(i) == code) + pos++; + } + } + } + match(code, pos) { + 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: pos + 1 }; + } + 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: pos + 1 }; + else + this.matches.push(1, pos); + } + return match; + } +} +if (typeof Symbol != "undefined") + SearchCursor.prototype[Symbol.iterator] = function () { return this; }; + +const empty = { from: -1, to: -1, match: /.*/.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.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.iter = text.iter(); + let startLine = text.lineAt(from); + this.curLineStart = startLine.from; + this.matchPos = 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 = to + (from == to ? 1 : 0); + if (from == this.curLine.length) + this.nextLine(); + if (from < to || from > this.value.to) { + 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 = 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 = from; + this.re = new RegExp(query, baseFlags + ((options === null || options === void 0 ? void 0 : options.ignoreCase) ? "i" : "")); + this.flat = FlattenedDoc.get(text, from, this.chunkEnd(from + 5000 /* 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 a match goes almost to the end of a noncomplete chunk, try + // again, since it'll likely be able to match more + if (match && this.flat.to < this.to && match.index + match[0].length > this.flat.text.length - 10) + match = null; + if (match) { + let from = this.flat.from + match.index, to = from + match[0].length; + this.value = { from, to, match }; + this.matchPos = to + (from == to ? 1 : 0); + return this; + } + else { + 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 createLineDialog(view) { + let input = elt__default["default"]("input", { class: "cm-textfield", name: "line" }); + let dom = elt__default["default"]("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(); + } + }, elt__default["default"]("label", view.state.phrase("Go to line"), ": ", input), " ", elt__default["default"]("button", { class: "cm-button", type: "submit" }, view.state.phrase("go"))); + function go() { + let match = /^([+-])?(\d+)?(:\d+)?(%)?$/.exec(input.value); + if (!match) + return; + let { state: state$1 } = view, startLine = state$1.doc.lineAt(state$1.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$1.doc.lines); + line = Math.round(state$1.doc.lines * pc); + } + else if (ln && sign) { + line = line * (sign == "-" ? -1 : 1) + startLine.number; + } + let docLine = state$1.doc.line(Math.max(1, Math.min(state$1.doc.lines, line))); + view.dispatch({ + effects: dialogEffect.of(false), + selection: state.EditorSelection.cursor(docLine.from + Math.max(0, Math.min(col, docLine.length))), + scrollIntoView: true + }); + view.focus(); + } + return { dom }; +} +const dialogEffect = state.StateEffect.define(); +const dialogField = 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. + +The dialog can be styled with the `panel.gotoLine` theme +selector. +*/ +const gotoLine = view$1 => { + let panel = view.getPanel(view$1, createLineDialog); + if (!panel) { + let effects = [dialogEffect.of(true)]; + if (view$1.state.field(dialogField, false) == null) + effects.push(state.StateEffect.appendConfig.of([dialogField, baseTheme$1])); + view$1.dispatch({ effects }); + panel = view.getPanel(view$1, createLineDialog); + } + if (panel) + panel.dom.querySelector("input").focus(); + return true; +}; +const baseTheme$1 = view.EditorView.baseTheme({ + ".cm-panel.cm-gotoLine": { + padding: "2px 6px 4px", + "& label": { fontSize: "80%" } + } +}); + +const defaultHighlightOptions = { + highlightWordAroundCursor: false, + minSelectionLength: 1, + maxMatches: 100, + wholeWords: false +}; +const highlightConfig = state.Facet.define({ + combine(options) { + return 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 = view.Decoration.mark({ class: "cm-selectionMatch" }); +const mainMatchDeco = 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$1, from, to) { + return (from == 0 || check(state$1.sliceDoc(from - 1, from)) != state.CharCategory.Word) && + (to == state$1.doc.length || check(state$1.sliceDoc(to, to + 1)) != state.CharCategory.Word); +} +// Whether the characters directly at the given positions are word characters +function insideWord(check, state$1, from, to) { + return check(state$1.sliceDoc(from, from + 1)) == state.CharCategory.Word + && check(state$1.sliceDoc(to - 1, to)) == state.CharCategory.Word; +} +const matchHighlighter = 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$1) { + let conf = view$1.state.facet(highlightConfig); + let { state } = view$1, 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).trim(); + if (!query) + return view.Decoration.none; + } + } + let deco = []; + for (let part of view$1.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 = view.EditorView.baseTheme({ + ".cm-selectionMatch": { backgroundColor: "#99ff7780" }, + ".cm-searchMatch .cm-selectionMatch": { backgroundColor: "transparent" } +}); +// Select the words around the cursors. +const selectWord = ({ state: state$1, dispatch }) => { + let { selection } = state$1; + let newSel = state.EditorSelection.create(selection.ranges.map(range => state$1.wordAt(range.head) || state.EditorSelection.cursor(range.head)), selection.mainIndex); + if (newSel.eq(selection)) + return false; + dispatch(state$1.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: state$1, dispatch }) => { + let { ranges } = state$1.selection; + if (ranges.some(sel => sel.from === sel.to)) + return selectWord({ state: state$1, dispatch }); + let searchedText = state$1.sliceDoc(ranges[0].from, ranges[0].to); + if (state$1.selection.ranges.some(r => state$1.sliceDoc(r.from, r.to) != searchedText)) + return false; + let range = findNextOccurrence(state$1, searchedText); + if (!range) + return false; + dispatch(state$1.update({ + selection: state$1.selection.addRange(state.EditorSelection.range(range.from, range.to), false), + effects: view.EditorView.scrollIntoView(range.to) + })); + return true; +}; + +const searchConfigFacet = state.Facet.define({ + combine(configs) { + var _a; + return { + top: configs.reduce((val, conf) => val !== null && val !== void 0 ? val : conf.top, undefined) || false, + caseSensitive: configs.reduce((val, conf) => val !== null && val !== void 0 ? val : conf.caseSensitive, undefined) || false, + createPanel: ((_a = configs.find(c => c.createPanel)) === null || _a === void 0 ? void 0 : _a.createPanel) || (view => new SearchPanel(view)) + }; + } +}); +/** +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.regexp = !!config.regexp; + this.replace = config.replace || ""; + this.valid = !!this.search && (!this.regexp || validRegExp(this.search)); + this.unquoted = config.literal ? this.search : this.search.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; + } + /** + @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 document. + */ + getCursor(doc, from = 0, to = doc.length) { + return this.regexp ? regexpCursor(this, doc, from, to) : stringCursor(this, doc, from, to); + } +} +class QueryType { + constructor(spec) { + this.spec = spec; + } +} +function stringCursor(spec, doc, from, to) { + return new SearchCursor(doc, spec.unquoted, from, to, spec.caseSensitive ? undefined : x => x.toLowerCase()); +} +class StringQuery extends QueryType { + constructor(spec) { + super(spec); + } + nextMatch(doc, curFrom, curTo) { + let cursor = stringCursor(this.spec, doc, curTo, doc.length).nextOverlapping(); + if (cursor.done) + cursor = stringCursor(this.spec, doc, 0, curFrom).nextOverlapping(); + return cursor.done ? null : cursor.value; + } + // Searching in reverse is, rather than implementing inverted search + // cursor, done by scanning chunk after chunk forward. + prevMatchInRange(doc, from, to) { + for (let pos = to;;) { + let start = Math.max(from, pos - 10000 /* ChunkSize */ - this.spec.unquoted.length); + let cursor = stringCursor(this.spec, doc, start, pos), range = null; + while (!cursor.nextOverlapping().done) + range = cursor.value; + if (range) + return range; + if (start == from) + return null; + pos -= 10000 /* ChunkSize */; + } + } + prevMatch(doc, curFrom, curTo) { + return this.prevMatchInRange(doc, 0, curFrom) || + this.prevMatchInRange(doc, curTo, doc.length); + } + getReplacement(_result) { return this.spec.replace; } + matchAll(doc, limit) { + let cursor = stringCursor(this.spec, doc, 0, doc.length), ranges = []; + while (!cursor.next().done) { + if (ranges.length >= limit) + return null; + ranges.push(cursor.value); + } + return ranges; + } + highlight(doc, from, to, add) { + let cursor = stringCursor(this.spec, doc, Math.max(0, from - this.spec.unquoted.length), Math.min(to + this.spec.unquoted.length, doc.length)); + while (!cursor.next().done) + add(cursor.value.from, cursor.value.to); + } +} +function regexpCursor(spec, doc, from, to) { + return new RegExpCursor(doc, spec.search, spec.caseSensitive ? undefined : { ignoreCase: true }, from, to); +} +class RegExpQuery extends QueryType { + nextMatch(doc, curFrom, curTo) { + let cursor = regexpCursor(this.spec, doc, curTo, doc.length).next(); + if (cursor.done) + cursor = regexpCursor(this.spec, doc, 0, curFrom).next(); + return cursor.done ? null : cursor.value; + } + prevMatchInRange(doc, from, to) { + for (let size = 1;; size++) { + let start = Math.max(from, to - size * 10000 /* ChunkSize */); + let cursor = regexpCursor(this.spec, doc, 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(doc, curFrom, curTo) { + return this.prevMatchInRange(doc, 0, curFrom) || + this.prevMatchInRange(doc, curTo, doc.length); + } + getReplacement(result) { + return this.spec.replace.replace(/\$([$&\d+])/g, (m, i) => i == "$" ? "$" + : i == "&" ? result.match[0] + : i != "0" && +i < result.match.length ? result.match[i] + : m); + } + matchAll(doc, limit) { + let cursor = regexpCursor(this.spec, doc, 0, doc.length), ranges = []; + while (!cursor.next().done) { + if (ranges.length >= limit) + return null; + ranges.push(cursor.value); + } + return ranges; + } + highlight(doc, from, to, add) { + let cursor = regexpCursor(this.spec, doc, Math.max(0, from - 250 /* HighlightMargin */), Math.min(to + 250 /* HighlightMargin */, 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 = state.StateEffect.define(); +const togglePanel = state.StateEffect.define(); +const searchState = 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); +} +class SearchState { + constructor(query, panel) { + this.query = query; + this.panel = panel; + } +} +const matchMark = view.Decoration.mark({ class: "cm-searchMatch" }), selectedMatchMark = view.Decoration.mark({ class: "cm-searchMatch cm-searchMatch-selected" }); +const searchHighlighter = 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: view$1 } = this; + let builder = new state.RangeSetBuilder(); + for (let i = 0, ranges = view$1.visibleRanges, l = ranges.length; i < l; i++) { + let { from, to } = ranges[i]; + while (i < l - 1 && to > ranges[i + 1].from - 2 * 250 /* HighlightMargin */) + to = ranges[++i].to; + query.highlight(view$1.state.doc, from, to, (from, to) => { + let selected = view$1.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 = searchCommand((view, { query }) => { + let { from, to } = view.state.selection.main; + let next = query.nextMatch(view.state.doc, from, to); + if (!next || next.from == from && next.to == to) + return false; + view.dispatch({ + selection: { anchor: next.from, head: next.to }, + scrollIntoView: true, + effects: announceMatch(view, next), + userEvent: "select.search" + }); + 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 = searchCommand((view, { query }) => { + let { state } = view, { from, to } = state.selection.main; + let range = query.prevMatch(state.doc, from, to); + if (!range) + return false; + view.dispatch({ + selection: { anchor: range.from, head: range.to }, + scrollIntoView: true, + effects: announceMatch(view, range), + userEvent: "select.search" + }); + return true; +}); +/** +Select all instances of the search query. +*/ +const selectMatches = searchCommand((view, { query }) => { + let ranges = query.matchAll(view.state.doc, 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: state$1, dispatch }) => { + let sel = state$1.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$1.doc, state$1.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$1.update({ + selection: state.EditorSelection.create(ranges, main), + userEvent: "select.search.matches" + })); + return true; +}; +/** +Replace the current match of the search query. +*/ +const replaceNext = searchCommand((view$1, { query }) => { + let { state } = view$1, { from, to } = state.selection.main; + if (state.readOnly) + return false; + let next = query.nextMatch(state.doc, from, from); + if (!next) + return false; + let changes = [], selection, replacement; + let announce = []; + 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.doc, next.from, next.to); + announce.push(view.EditorView.announce.of(state.phrase("replaced match on line $", state.doc.lineAt(from).number) + ".")); + } + if (next) { + let off = changes.length == 0 || changes[0].from >= next.to ? 0 : next.to - next.from - replacement.length; + selection = { anchor: next.from - off, head: next.to - off }; + announce.push(announceMatch(view$1, next)); + } + view$1.dispatch({ + changes, selection, + scrollIntoView: !!selection, + effects: announce, + userEvent: "input.replace" + }); + return true; +}); +/** +Replace all instances of the search query with the given +replacement. +*/ +const replaceAll = searchCommand((view$1, { query }) => { + if (view$1.state.readOnly) + return false; + let changes = query.matchAll(view$1.state.doc, 1e9).map(match => { + let { from, to } = match; + return { from, to, insert: query.getReplacement(match) }; + }); + if (!changes.length) + return false; + let announceText = view$1.state.phrase("replaced $ matches", changes.length) + "."; + view$1.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; + let sel = state.selection.main; + let selText = sel.empty || sel.to > sel.from + 100 ? "" : state.sliceDoc(sel.from, sel.to); + let caseSensitive = (_a = fallback === null || fallback === void 0 ? void 0 : fallback.caseSensitive) !== null && _a !== void 0 ? _a : state.facet(searchConfigFacet).caseSensitive; + return fallback && !selText ? fallback : new SearchQuery({ search: selText.replace(/\n/g, "\\n"), caseSensitive }); +} +/** +Make sure the search panel is open and focused. +*/ +const openSearchPanel = view$1 => { + let state$1 = view$1.state.field(searchState, false); + if (state$1 && state$1.panel) { + let panel = view.getPanel(view$1, createSearchPanel); + if (!panel) + return false; + let searchInput = panel.dom.querySelector("[main-field]"); + if (searchInput && searchInput != view$1.root.activeElement) { + let query = defaultQuery(view$1.state, state$1.query.spec); + if (query.valid) + view$1.dispatch({ effects: setSearchQuery.of(query) }); + searchInput.focus(); + searchInput.select(); + } + } + else { + view$1.dispatch({ effects: [ + togglePanel.of(true), + state$1 ? setSearchQuery.of(defaultQuery(view$1.state, state$1.query.spec)) : state.StateEffect.appendConfig.of(searchExtensions) + ] }); + } + return true; +}; +/** +Close the search panel. +*/ +const closeSearchPanel = view$1 => { + let state = view$1.state.field(searchState, false); + if (!state || !state.panel) + return false; + let panel = view.getPanel(view$1, createSearchPanel); + if (panel && panel.dom.contains(view$1.root.activeElement)) + view$1.focus(); + view$1.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) + - 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: "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 = elt__default["default"]("input", { + value: query.search, + placeholder: phrase(view, "Find"), + "aria-label": phrase(view, "Find"), + class: "cm-textfield", + name: "search", + "main-field": "true", + onchange: this.commit, + onkeyup: this.commit + }); + this.replaceField = elt__default["default"]("input", { + value: query.replace, + placeholder: phrase(view, "Replace"), + "aria-label": phrase(view, "Replace"), + class: "cm-textfield", + name: "replace", + onchange: this.commit, + onkeyup: this.commit + }); + this.caseField = elt__default["default"]("input", { + type: "checkbox", + name: "case", + checked: query.caseSensitive, + onchange: this.commit + }); + this.reField = elt__default["default"]("input", { + type: "checkbox", + name: "re", + checked: query.regexp, + onchange: this.commit + }); + function button(name, onclick, content) { + return elt__default["default"]("button", { class: "cm-button", name, onclick, type: "button" }, content); + } + this.dom = elt__default["default"]("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")]), + elt__default["default"]("label", null, [this.caseField, phrase(view, "match case")]), + elt__default["default"]("label", null, [this.reField, phrase(view, "regexp")]), + ...view.state.readOnly ? [] : [ + elt__default["default"]("br"), + this.replaceField, + button("replace", () => replaceNext(view), [phrase(view, "replace")]), + button("replaceAll", () => replaceAll(view), [phrase(view, "replace all")]), + elt__default["default"]("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, + replace: this.replaceField.value + }); + if (!query.eq(this.query)) { + this.query = query; + this.view.dispatch({ effects: setSearchQuery.of(query) }); + } + } + keydown(e) { + if (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; + } + 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$1, { from, to }) { + let line = view$1.state.doc.lineAt(from), lineEnd = view$1.state.doc.lineAt(to).to; + let start = Math.max(line.from, from - AnnounceMargin), end = Math.min(lineEnd, to + AnnounceMargin); + let text = view$1.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$1.state.phrase("current match")}. ${text} ${view$1.state.phrase("on line")} ${line.number}.`); +} +const baseTheme = 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, + state.Prec.lowest(searchHighlighter), + baseTheme +]; + +exports.RegExpCursor = RegExpCursor; +exports.SearchCursor = SearchCursor; +exports.SearchQuery = SearchQuery; +exports.closeSearchPanel = closeSearchPanel; +exports.findNext = findNext; +exports.findPrevious = findPrevious; +exports.getSearchQuery = getSearchQuery; +exports.gotoLine = gotoLine; +exports.highlightSelectionMatches = highlightSelectionMatches; +exports.openSearchPanel = openSearchPanel; +exports.replaceAll = replaceAll; +exports.replaceNext = replaceNext; +exports.search = search; +exports.searchKeymap = searchKeymap; +exports.selectMatches = selectMatches; +exports.selectNextOccurrence = selectNextOccurrence; +exports.selectSelectionMatches = selectSelectionMatches; +exports.setSearchQuery = setSearchQuery; diff --git a/node_modules/@codemirror/search/dist/index.d.ts b/node_modules/@codemirror/search/dist/index.d.ts new file mode 100644 index 0000000000..7b4e7c0a26 --- /dev/null +++ b/node_modules/@codemirror/search/dist/index.d.ts @@ -0,0 +1,329 @@ +import * as _codemirror_state from '@codemirror/state'; +import { Text, Extension, StateCommand, EditorState } from '@codemirror/state'; +import { Command, KeyBinding, EditorView, Panel } from '@codemirror/view'; + +/** +A search cursor provides an iterator over text matches in a +document. +*/ +declare class SearchCursor implements Iterator<{ + from: number; + to: number; +}> { + private iter; + /** + 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). + */ + value: { + from: number; + to: number; + }; + /** + Whether the end of the iterated region has been reached. + */ + done: boolean; + private matches; + private buffer; + private bufferPos; + private bufferStart; + private normalize; + private query; + /** + 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: Text, query: string, from?: number, to?: number, normalize?: (string: string) => string); + private peek; + /** + 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(): this; + /** + The `next` method will ignore matches that partially overlap a + previous match. This method behaves like `next`, but includes + such matches. + */ + nextOverlapping(): this; + private match; + [Symbol.iterator]: () => Iterator<{ + from: number; + to: number; + }>; +} + +/** +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. +*/ +declare class RegExpCursor implements Iterator<{ + from: number; + to: number; + match: RegExpExecArray; +}> { + private to; + private iter; + private re; + private curLine; + private curLineStart; + private matchPos; + /** + Set to `true` when the cursor has reached the end of the search + range. + */ + done: boolean; + /** + 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. + */ + value: { + from: number; + to: number; + match: RegExpExecArray; + }; + /** + 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: Text, query: string, options?: { + ignoreCase?: boolean; + }, from?: number, to?: number); + private getLine; + private nextLine; + /** + Move to the next match, if there is one. + */ + next(): this; + [Symbol.iterator]: () => Iterator<{ + from: number; + to: number; + match: RegExpExecArray; + }>; +} + +/** +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. + +The dialog can be styled with the `panel.gotoLine` theme +selector. +*/ +declare const gotoLine: Command; + +declare type HighlightOptions = { + /** + Determines whether, when nothing is selected, the word around + the cursor is matched instead. Defaults to false. + */ + highlightWordAroundCursor?: boolean; + /** + The minimum length of the selection before it is highlighted. + Defaults to 1 (always highlight non-cursor selections). + */ + minSelectionLength?: number; + /** + The amount of matches (in the viewport) at which to disable + highlighting. Defaults to 100. + */ + maxMatches?: number; + /** + Whether to only highlight whole words. + */ + wholeWords?: boolean; +}; +/** +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"`. +*/ +declare function highlightSelectionMatches(options?: HighlightOptions): Extension; +/** +Select next occurrence of the current selection. Expand selection +to the surrounding word when the selection is empty. +*/ +declare const selectNextOccurrence: StateCommand; + +interface SearchConfig { + /** + Whether to position the search panel at the top of the editor + (the default is at the bottom). + */ + top?: boolean; + /** + Whether to enable case sensitivity by default when the search + panel is activated (defaults to false). + */ + caseSensitive?: boolean; + /** + Can be used to override the way the search panel is implemented. + Should create a [Panel](https://codemirror.net/6/docs/ref/#view.Panel) that contains a form + which lets the user: + + - See the [current](https://codemirror.net/6/docs/ref/#search.getSearchQuery) search query. + - Manipulate the [query](https://codemirror.net/6/docs/ref/#search.SearchQuery) and + [update](https://codemirror.net/6/docs/ref/#search.setSearchQuery) the search state with a new + query. + - Notice external changes to the query by reacting to the + appropriate [state effect](https://codemirror.net/6/docs/ref/#search.setSearchQuery). + - Run some of the search commands. + */ + createPanel?: (view: EditorView) => Panel; +} +/** +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). +*/ +declare function search(config?: SearchConfig): Extension; +/** +A search query. Part of the editor's search state. +*/ +declare class SearchQuery { + /** + The search string (or regular expression). + */ + readonly search: string; + /** + Indicates whether the search is case-sensitive. + */ + readonly caseSensitive: boolean; + /** + Then true, the search string is interpreted as a regular + expression. + */ + readonly regexp: boolean; + /** + The replace text, or the empty string if no replace text has + been given. + */ + readonly replace: string; + /** + Whether this query is non-empty and, in case of a regular + expression search, syntactically valid. + */ + readonly valid: boolean; + /** + Create a query object. + */ + constructor(config: { + /** + The search string. + */ + search: string; + /** + Controls whether the search should be case-sensitive. + */ + caseSensitive?: boolean; + /** + By default, string search will replace `\n`, `\r`, and `\t` in + the query with newline, return, and tab characters. When this + is set to true, that behavior is disabled. + */ + literal?: boolean; + /** + When true, interpret the search string as a regular expression. + */ + regexp?: boolean; + /** + The replace text. + */ + replace?: string; + }); + /** + Compare this query to another query. + */ + eq(other: SearchQuery): boolean; + /** + Get a search cursor for this query, searching through the given + range in the given document. + */ + getCursor(doc: Text, from?: number, to?: number): Iterator<{ + from: number; + to: number; + }>; +} +/** +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). +*/ +declare const setSearchQuery: _codemirror_state.StateEffectType; +/** +Get the current search query from an editor state. +*/ +declare function getSearchQuery(state: EditorState): SearchQuery; +/** +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. +*/ +declare const findNext: Command; +/** +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. +*/ +declare const findPrevious: Command; +/** +Select all instances of the search query. +*/ +declare const selectMatches: Command; +/** +Select all instances of the currently selected text. +*/ +declare const selectSelectionMatches: StateCommand; +/** +Replace the current match of the search query. +*/ +declare const replaceNext: Command; +/** +Replace all instances of the search query with the given +replacement. +*/ +declare const replaceAll: Command; +/** +Make sure the search panel is open and focused. +*/ +declare const openSearchPanel: Command; +/** +Close the search panel. +*/ +declare const closeSearchPanel: Command; +/** +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) + - Alt-g: [`gotoLine`](https://codemirror.net/6/docs/ref/#search.gotoLine) + - Mod-d: [`selectNextOccurrence`](https://codemirror.net/6/docs/ref/#search.selectNextOccurrence) +*/ +declare const searchKeymap: readonly KeyBinding[]; + +export { RegExpCursor, SearchCursor, SearchQuery, closeSearchPanel, findNext, findPrevious, getSearchQuery, gotoLine, highlightSelectionMatches, openSearchPanel, replaceAll, replaceNext, search, searchKeymap, selectMatches, selectNextOccurrence, selectSelectionMatches, setSearchQuery }; diff --git a/node_modules/@codemirror/search/dist/index.js b/node_modules/@codemirror/search/dist/index.js new file mode 100644 index 0000000000..f09fa902c1 --- /dev/null +++ b/node_modules/@codemirror/search/dist/index.js @@ -0,0 +1,1125 @@ +import { showPanel, EditorView, getPanel, Decoration, ViewPlugin, runScopeHandlers } from '@codemirror/view'; +import { codePointAt, fromCodePoint, codePointSize, StateEffect, StateField, EditorSelection, Facet, combineConfig, CharCategory, RangeSetBuilder, Prec } from '@codemirror/state'; +import elt from 'crelt'; + +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) { + /** + 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 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 = fromCodePoint(next), start = this.bufferStart + this.bufferPos; + this.bufferPos += codePointSize(next); + let norm = this.normalize(str); + for (let i = 0, pos = start;; i++) { + let code = norm.charCodeAt(i); + let match = this.match(code, pos); + if (match) { + this.value = match; + return this; + } + if (i == norm.length - 1) + break; + if (pos == start && i < str.length && str.charCodeAt(i) == code) + pos++; + } + } + } + match(code, pos) { + 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: pos + 1 }; + } + 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: pos + 1 }; + else + this.matches.push(1, pos); + } + 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.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.iter = text.iter(); + let startLine = text.lineAt(from); + this.curLineStart = startLine.from; + this.matchPos = 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 = to + (from == to ? 1 : 0); + if (from == this.curLine.length) + this.nextLine(); + if (from < to || from > this.value.to) { + 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 = from; + this.re = new RegExp(query, baseFlags + ((options === null || options === void 0 ? void 0 : options.ignoreCase) ? "i" : "")); + this.flat = FlattenedDoc.get(text, from, this.chunkEnd(from + 5000 /* 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 a match goes almost to the end of a noncomplete chunk, try + // again, since it'll likely be able to match more + if (match && this.flat.to < this.to && match.index + match[0].length > this.flat.text.length - 10) + match = null; + if (match) { + let from = this.flat.from + match.index, to = from + match[0].length; + this.value = { from, to, match }; + this.matchPos = to + (from == to ? 1 : 0); + return this; + } + else { + 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 createLineDialog(view) { + let input = elt("input", { class: "cm-textfield", name: "line" }); + let dom = elt("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(); + } + }, elt("label", view.state.phrase("Go to line"), ": ", input), " ", elt("button", { class: "cm-button", type: "submit" }, view.state.phrase("go"))); + 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))); + view.dispatch({ + effects: dialogEffect.of(false), + selection: EditorSelection.cursor(docLine.from + Math.max(0, Math.min(col, docLine.length))), + scrollIntoView: true + }); + view.focus(); + } + return { dom }; +} +const dialogEffect = /*@__PURE__*/StateEffect.define(); +const dialogField = /*@__PURE__*/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 => 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. + +The dialog can be styled with the `panel.gotoLine` theme +selector. +*/ +const gotoLine = view => { + let panel = getPanel(view, createLineDialog); + if (!panel) { + let effects = [dialogEffect.of(true)]; + if (view.state.field(dialogField, false) == null) + effects.push(StateEffect.appendConfig.of([dialogField, baseTheme$1])); + view.dispatch({ effects }); + panel = getPanel(view, createLineDialog); + } + if (panel) + panel.dom.querySelector("input").focus(); + return true; +}; +const baseTheme$1 = /*@__PURE__*/EditorView.baseTheme({ + ".cm-panel.cm-gotoLine": { + padding: "2px 6px 4px", + "& label": { fontSize: "80%" } + } +}); + +const defaultHighlightOptions = { + highlightWordAroundCursor: false, + minSelectionLength: 1, + maxMatches: 100, + wholeWords: false +}; +const highlightConfig = /*@__PURE__*/Facet.define({ + combine(options) { + return 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__*/Decoration.mark({ class: "cm-selectionMatch" }); +const mainMatchDeco = /*@__PURE__*/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)) != CharCategory.Word) && + (to == state.doc.length || check(state.sliceDoc(to, to + 1)) != 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)) == CharCategory.Word + && check(state.sliceDoc(to - 1, to)) == CharCategory.Word; +} +const matchHighlighter = /*@__PURE__*/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 Decoration.none; + let range = sel.main, query, check = null; + if (range.empty) { + if (!conf.highlightWordAroundCursor) + return Decoration.none; + let word = state.wordAt(range.head); + if (!word) + return 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 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 Decoration.none; + } + else { + query = state.sliceDoc(range.from, range.to).trim(); + if (!query) + return 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 Decoration.none; + } + } + } + return Decoration.set(deco); + } +}, { + decorations: v => v.decorations +}); +const defaultTheme = /*@__PURE__*/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 = EditorSelection.create(selection.ranges.map(range => state.wordAt(range.head) || 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(EditorSelection.range(range.from, range.to), false), + effects: EditorView.scrollIntoView(range.to) + })); + return true; +}; + +const searchConfigFacet = /*@__PURE__*/Facet.define({ + combine(configs) { + var _a; + return { + top: configs.reduce((val, conf) => val !== null && val !== void 0 ? val : conf.top, undefined) || false, + caseSensitive: configs.reduce((val, conf) => val !== null && val !== void 0 ? val : conf.caseSensitive, undefined) || false, + createPanel: ((_a = configs.find(c => c.createPanel)) === null || _a === void 0 ? void 0 : _a.createPanel) || (view => new SearchPanel(view)) + }; + } +}); +/** +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.regexp = !!config.regexp; + this.replace = config.replace || ""; + this.valid = !!this.search && (!this.regexp || validRegExp(this.search)); + this.unquoted = config.literal ? this.search : this.search.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; + } + /** + @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 document. + */ + getCursor(doc, from = 0, to = doc.length) { + return this.regexp ? regexpCursor(this, doc, from, to) : stringCursor(this, doc, from, to); + } +} +class QueryType { + constructor(spec) { + this.spec = spec; + } +} +function stringCursor(spec, doc, from, to) { + return new SearchCursor(doc, spec.unquoted, from, to, spec.caseSensitive ? undefined : x => x.toLowerCase()); +} +class StringQuery extends QueryType { + constructor(spec) { + super(spec); + } + nextMatch(doc, curFrom, curTo) { + let cursor = stringCursor(this.spec, doc, curTo, doc.length).nextOverlapping(); + if (cursor.done) + cursor = stringCursor(this.spec, doc, 0, curFrom).nextOverlapping(); + return cursor.done ? null : cursor.value; + } + // Searching in reverse is, rather than implementing inverted search + // cursor, done by scanning chunk after chunk forward. + prevMatchInRange(doc, from, to) { + for (let pos = to;;) { + let start = Math.max(from, pos - 10000 /* ChunkSize */ - this.spec.unquoted.length); + let cursor = stringCursor(this.spec, doc, start, pos), range = null; + while (!cursor.nextOverlapping().done) + range = cursor.value; + if (range) + return range; + if (start == from) + return null; + pos -= 10000 /* ChunkSize */; + } + } + prevMatch(doc, curFrom, curTo) { + return this.prevMatchInRange(doc, 0, curFrom) || + this.prevMatchInRange(doc, curTo, doc.length); + } + getReplacement(_result) { return this.spec.replace; } + matchAll(doc, limit) { + let cursor = stringCursor(this.spec, doc, 0, doc.length), ranges = []; + while (!cursor.next().done) { + if (ranges.length >= limit) + return null; + ranges.push(cursor.value); + } + return ranges; + } + highlight(doc, from, to, add) { + let cursor = stringCursor(this.spec, doc, Math.max(0, from - this.spec.unquoted.length), Math.min(to + this.spec.unquoted.length, doc.length)); + while (!cursor.next().done) + add(cursor.value.from, cursor.value.to); + } +} +function regexpCursor(spec, doc, from, to) { + return new RegExpCursor(doc, spec.search, spec.caseSensitive ? undefined : { ignoreCase: true }, from, to); +} +class RegExpQuery extends QueryType { + nextMatch(doc, curFrom, curTo) { + let cursor = regexpCursor(this.spec, doc, curTo, doc.length).next(); + if (cursor.done) + cursor = regexpCursor(this.spec, doc, 0, curFrom).next(); + return cursor.done ? null : cursor.value; + } + prevMatchInRange(doc, from, to) { + for (let size = 1;; size++) { + let start = Math.max(from, to - size * 10000 /* ChunkSize */); + let cursor = regexpCursor(this.spec, doc, 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(doc, curFrom, curTo) { + return this.prevMatchInRange(doc, 0, curFrom) || + this.prevMatchInRange(doc, curTo, doc.length); + } + getReplacement(result) { + return this.spec.replace.replace(/\$([$&\d+])/g, (m, i) => i == "$" ? "$" + : i == "&" ? result.match[0] + : i != "0" && +i < result.match.length ? result.match[i] + : m); + } + matchAll(doc, limit) { + let cursor = regexpCursor(this.spec, doc, 0, doc.length), ranges = []; + while (!cursor.next().done) { + if (ranges.length >= limit) + return null; + ranges.push(cursor.value); + } + return ranges; + } + highlight(doc, from, to, add) { + let cursor = regexpCursor(this.spec, doc, Math.max(0, from - 250 /* HighlightMargin */), Math.min(to + 250 /* HighlightMargin */, 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__*/StateEffect.define(); +const togglePanel = /*@__PURE__*/StateEffect.define(); +const searchState = /*@__PURE__*/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 => 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); +} +class SearchState { + constructor(query, panel) { + this.query = query; + this.panel = panel; + } +} +const matchMark = /*@__PURE__*/Decoration.mark({ class: "cm-searchMatch" }), selectedMatchMark = /*@__PURE__*/Decoration.mark({ class: "cm-searchMatch cm-searchMatch-selected" }); +const searchHighlighter = /*@__PURE__*/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 Decoration.none; + let { view } = this; + let builder = new 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 /* HighlightMargin */) + to = ranges[++i].to; + query.highlight(view.state.doc, 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 { from, to } = view.state.selection.main; + let next = query.nextMatch(view.state.doc, from, to); + if (!next || next.from == from && next.to == to) + return false; + view.dispatch({ + selection: { anchor: next.from, head: next.to }, + scrollIntoView: true, + effects: announceMatch(view, next), + userEvent: "select.search" + }); + 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, to } = state.selection.main; + let range = query.prevMatch(state.doc, from, to); + if (!range) + return false; + view.dispatch({ + selection: { anchor: range.from, head: range.to }, + scrollIntoView: true, + effects: announceMatch(view, range), + userEvent: "select.search" + }); + return true; +}); +/** +Select all instances of the search query. +*/ +const selectMatches = /*@__PURE__*/searchCommand((view, { query }) => { + let ranges = query.matchAll(view.state.doc, 1000); + if (!ranges || !ranges.length) + return false; + view.dispatch({ + selection: EditorSelection.create(ranges.map(r => 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(EditorSelection.range(cur.value.from, cur.value.to)); + } + dispatch(state.update({ + selection: 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 next = query.nextMatch(state.doc, from, from); + if (!next) + return false; + let changes = [], selection, replacement; + let announce = []; + 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.doc, next.from, next.to); + announce.push(EditorView.announce.of(state.phrase("replaced match on line $", state.doc.lineAt(from).number) + ".")); + } + if (next) { + let off = changes.length == 0 || changes[0].from >= next.to ? 0 : next.to - next.from - replacement.length; + selection = { anchor: next.from - off, head: next.to - off }; + announce.push(announceMatch(view, next)); + } + view.dispatch({ + changes, selection, + scrollIntoView: !!selection, + effects: announce, + 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.doc, 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: 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; + let sel = state.selection.main; + let selText = sel.empty || sel.to > sel.from + 100 ? "" : state.sliceDoc(sel.from, sel.to); + let caseSensitive = (_a = fallback === null || fallback === void 0 ? void 0 : fallback.caseSensitive) !== null && _a !== void 0 ? _a : state.facet(searchConfigFacet).caseSensitive; + return fallback && !selText ? fallback : new SearchQuery({ search: selText.replace(/\n/g, "\\n"), caseSensitive }); +} +/** +Make sure the search panel is open and focused. +*/ +const openSearchPanel = view => { + let state = view.state.field(searchState, false); + if (state && state.panel) { + let panel = getPanel(view, createSearchPanel); + if (!panel) + return false; + let searchInput = panel.dom.querySelector("[main-field]"); + 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)) : 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 = 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) + - 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: "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 = elt("input", { + value: query.search, + placeholder: phrase(view, "Find"), + "aria-label": phrase(view, "Find"), + class: "cm-textfield", + name: "search", + "main-field": "true", + onchange: this.commit, + onkeyup: this.commit + }); + this.replaceField = elt("input", { + value: query.replace, + placeholder: phrase(view, "Replace"), + "aria-label": phrase(view, "Replace"), + class: "cm-textfield", + name: "replace", + onchange: this.commit, + onkeyup: this.commit + }); + this.caseField = elt("input", { + type: "checkbox", + name: "case", + checked: query.caseSensitive, + onchange: this.commit + }); + this.reField = elt("input", { + type: "checkbox", + name: "re", + checked: query.regexp, + onchange: this.commit + }); + function button(name, onclick, content) { + return elt("button", { class: "cm-button", name, onclick, type: "button" }, content); + } + this.dom = elt("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")]), + elt("label", null, [this.caseField, phrase(view, "match case")]), + elt("label", null, [this.reField, phrase(view, "regexp")]), + ...view.state.readOnly ? [] : [ + elt("br"), + this.replaceField, + button("replace", () => replaceNext(view), [phrase(view, "replace")]), + button("replaceAll", () => replaceAll(view), [phrase(view, "replace all")]), + elt("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, + replace: this.replaceField.value + }); + if (!query.eq(this.query)) { + this.query = query; + this.view.dispatch({ effects: setSearchQuery.of(query) }); + } + } + keydown(e) { + if (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; + } + 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 EditorView.announce.of(`${view.state.phrase("current match")}. ${text} ${view.state.phrase("on line")} ${line.number}.`); +} +const baseTheme = /*@__PURE__*/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__*/Prec.lowest(searchHighlighter), + baseTheme +]; + +export { RegExpCursor, SearchCursor, SearchQuery, closeSearchPanel, findNext, findPrevious, getSearchQuery, gotoLine, highlightSelectionMatches, openSearchPanel, replaceAll, replaceNext, search, searchKeymap, selectMatches, selectNextOccurrence, selectSelectionMatches, setSearchQuery }; diff --git a/node_modules/@codemirror/search/package.json b/node_modules/@codemirror/search/package.json new file mode 100644 index 0000000000..f35b99e7f8 --- /dev/null +++ b/node_modules/@codemirror/search/package.json @@ -0,0 +1,40 @@ +{ + "name": "@codemirror/search", + "version": "6.0.0", + "description": "Search functionality for the CodeMirror code editor", + "scripts": { + "test": "cm-runtests", + "prepare": "cm-buildhelper src/search.ts" + }, + "keywords": [ + "editor", + "code" + ], + "author": { + "name": "Marijn Haverbeke", + "email": "marijnh@gmail.com", + "url": "http://marijnhaverbeke.nl" + }, + "type": "module", + "main": "dist/index.cjs", + "exports": { + "import": "./dist/index.js", + "require": "./dist/index.cjs" + }, + "types": "dist/index.d.ts", + "module": "dist/index.js", + "sideEffects": false, + "license": "MIT", + "dependencies": { + "@codemirror/state": "^6.0.0", + "@codemirror/view": "^6.0.0", + "crelt": "^1.0.5" + }, + "devDependencies": { + "@codemirror/buildhelper": "^0.1.5" + }, + "repository": { + "type": "git", + "url": "https://github.com/codemirror/search.git" + } +} diff --git a/node_modules/@codemirror/state/.github/workflows/dispatch.yml b/node_modules/@codemirror/state/.github/workflows/dispatch.yml new file mode 100644 index 0000000000..955205089e --- /dev/null +++ b/node_modules/@codemirror/state/.github/workflows/dispatch.yml @@ -0,0 +1,16 @@ +name: Trigger CI +on: push + +jobs: + build: + name: Dispatch to main repo + runs-on: ubuntu-latest + steps: + - name: Emit repository_dispatch + uses: mvasigh/dispatch-action@main + with: + # You should create a personal access token and store it in your repository + token: ${{ secrets.DISPATCH_AUTH }} + repo: codemirror.next + owner: codemirror + event_type: push diff --git a/node_modules/@codemirror/state/CHANGELOG.md b/node_modules/@codemirror/state/CHANGELOG.md new file mode 100644 index 0000000000..bb093661e2 --- /dev/null +++ b/node_modules/@codemirror/state/CHANGELOG.md @@ -0,0 +1,170 @@ +## 6.0.0 (2022-06-08) + +### Breaking changes + +Update dependencies to 6.0.0 + +## 0.20.1 (2022-06-02) + +### New features + +`EditorView.phrase` now accepts additional arguments, which it will interpolate into the phrase in the place of `$` markers. + +## 0.20.0 (2022-04-20) + +### Breaking changes + +The deprecated precedence names `fallback`, `extend`, and `override` were removed from the library. + +### Bug fixes + +Fix a bug where, if an extension value occurs multiple times, its lowest, rather than highest precedence is used. + +Fix an issue where facets with computed inputs would unneccesarily have their outputs recreated on state reconfiguration. + +Fix a bug in the order in which new values for state fields and facets were computed, which could cause dynamic facets to hold the wrong value in some situations. + +### New features + +The exports from @codemirror/rangeset now live in this package. + +The exports from @codemirror/text now live in this package. + +## 0.19.9 (2022-02-16) + +### Bug fixes + +Mapping a non-empty selection range now always puts any newly inserted text on the sides of the range outside of the mapped version. + +## 0.19.8 (2022-02-15) + +### Bug fixes + +Fix a bug where facet values with computed inputs could incorrectly retain their old value on reconfiguration. + +## 0.19.7 (2022-02-11) + +### Bug fixes + +Avoid recomputing facets on state reconfiguration if that facet's inputs stayed precisely the same. + +Selection ranges created with `EditorSelection.range` will now have an assoc pointing at their anchor, when non-empty. + +## 0.19.6 (2021-11-19) + +### Bug fixes + +Fix a bug that caused facet compare functions to be called with an invalid value in some situations. + +Fix a bug that caused dynamic facet values to be incorrectly kept unchanged when reconfiguration changed one of their dependencies. + +## 0.19.5 (2021-11-10) + +### Bug fixes + +Fix a bug that would cause dynamic facet values influenced by a state reconfiguration to not properly recompute. + +## 0.19.4 (2021-11-05) + +### Bug fixes + +When reconfiguring a state, effects from the reconfiguring transaction can now be seen by newly added state fields. + +## 0.19.3 (2021-11-03) + +### New features + +The precedence levels (under `Prec`) now have more generic names, because their 'meaningful' names were entirely inappropriate in many situations. + +## 0.19.2 (2021-09-13) + +### New features + +The editor state now has a `readOnly` property with a matching facet to control its value. + +## 0.19.1 (2021-08-15) + +### Bug fixes + +Fix a bug where `wordAt` never returned a useful result. + +## 0.19.0 (2021-08-11) + +### Breaking changes + +User event strings now work differently—the events emitted by the core packages follow a different system, and hierarchical event tags can be created by separating the words with dots. + +### New features + +`languageDataAt` now takes an optional `side` argument to specificy which side of the position you're interested in. + +It is now possible to add a user event annotation with a direct `userEvent` property on a transaction spec. + +Transactions now have an `isUserEvent` method that can be used to check if it is (a subtype of) some user event type. + +## 0.18.7 (2021-05-04) + +### Bug fixes + +Fix an issue where state fields might be initialized with a state that they aren't actually part of during reconfiguration. + +## 0.18.6 (2021-04-12) + +### New features + +The new `EditorState.wordAt` method finds the word at a given position. + +## 0.18.5 (2021-04-08) + +### Bug fixes + +Fix an issue in the compiled output that would break the code when minified with terser. + +## 0.18.4 (2021-04-06) + +### New features + +The new `Transaction.remote` annotation can be used to mark and recognize transactions created by other actors. + +## 0.18.3 (2021-03-23) + +### New features + +The `ChangeDesc` class now has `toJSON` and `fromJSON` methods. + +## 0.18.2 (2021-03-14) + +### Bug fixes + +Fix unintended ES2020 output (the package contains ES6 code again). + +## 0.18.1 (2021-03-10) + +### New features + +The new `Compartment.get` method can be used to get the content of a compartment in a given state. + +## 0.18.0 (2021-03-03) + +### Breaking changes + +`tagExtension` and the `reconfigure` transaction spec property have been replaced with the concept of configuration compartments and reconfiguration effects (see `Compartment`, `StateEffect.reconfigure`, and `StateEffect.appendConfig`). + +## 0.17.2 (2021-02-19) + +### New features + +`EditorSelection.map` and `SelectionRange.map` now take an optional second argument to indicate which direction to map to. + +## 0.17.1 (2021-01-06) + +### New features + +The package now also exports a CommonJS module. + +## 0.17.0 (2020-12-29) + +### Breaking changes + +First numbered release. + diff --git a/node_modules/@codemirror/state/LICENSE b/node_modules/@codemirror/state/LICENSE new file mode 100644 index 0000000000..3af12e62d9 --- /dev/null +++ b/node_modules/@codemirror/state/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (C) 2018-2021 by Marijn Haverbeke and others + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/node_modules/@codemirror/state/README.md b/node_modules/@codemirror/state/README.md new file mode 100644 index 0000000000..aab7b6b792 --- /dev/null +++ b/node_modules/@codemirror/state/README.md @@ -0,0 +1,18 @@ +# @codemirror/state [![NPM version](https://img.shields.io/npm/v/@codemirror/state.svg)](https://www.npmjs.org/package/@codemirror/state) + +[ [**WEBSITE**](https://codemirror.net/6/) | [**DOCS**](https://codemirror.net/6/docs/ref/#state) | [**ISSUES**](https://github.com/codemirror/codemirror.next/issues) | [**FORUM**](https://discuss.codemirror.net/c/next/) | [**CHANGELOG**](https://github.com/codemirror/state/blob/main/CHANGELOG.md) ] + +This package implements the editor state data structures for the +[CodeMirror](https://codemirror.net/6/) code editor. + +The [project page](https://codemirror.net/6/) has more information, a +number of [examples](https://codemirror.net/6/examples/) and the +[documentation](https://codemirror.net/6/docs/). + +This code is released under an +[MIT license](https://github.com/codemirror/state/tree/main/LICENSE). + +We aim to be an inclusive, welcoming community. To make that explicit, +we have a [code of +conduct](http://contributor-covenant.org/version/1/1/0/) that applies +to communication around the project. diff --git a/node_modules/@codemirror/state/dist/index.cjs b/node_modules/@codemirror/state/dist/index.cjs new file mode 100644 index 0000000000..0510ee9227 --- /dev/null +++ b/node_modules/@codemirror/state/dist/index.cjs @@ -0,0 +1,3888 @@ +'use strict'; + +Object.defineProperty(exports, '__esModule', { value: true }); + +/** +The data structure for documents. @nonabstract +*/ +class Text { + /** + @internal + */ + constructor() { } + /** + Get the line description around the given position. + */ + lineAt(pos) { + if (pos < 0 || pos > this.length) + throw new RangeError(`Invalid position ${pos} in document of length ${this.length}`); + return this.lineInner(pos, false, 1, 0); + } + /** + Get the description for the given (1-based) line number. + */ + line(n) { + if (n < 1 || n > this.lines) + throw new RangeError(`Invalid line number ${n} in ${this.lines}-line document`); + return this.lineInner(n, true, 1, 0); + } + /** + Replace a range of the text with the given content. + */ + replace(from, to, text) { + let parts = []; + this.decompose(0, from, parts, 2 /* To */); + if (text.length) + text.decompose(0, text.length, parts, 1 /* From */ | 2 /* To */); + this.decompose(to, this.length, parts, 1 /* From */); + return TextNode.from(parts, this.length - (to - from) + text.length); + } + /** + Append another document to this one. + */ + append(other) { + return this.replace(this.length, this.length, other); + } + /** + Retrieve the text between the given points. + */ + slice(from, to = this.length) { + let parts = []; + this.decompose(from, to, parts, 0); + return TextNode.from(parts, to - from); + } + /** + Test whether this text is equal to another instance. + */ + eq(other) { + if (other == this) + return true; + if (other.length != this.length || other.lines != this.lines) + return false; + let start = this.scanIdentical(other, 1), end = this.length - this.scanIdentical(other, -1); + let a = new RawTextCursor(this), b = new RawTextCursor(other); + for (let skip = start, pos = start;;) { + a.next(skip); + b.next(skip); + skip = 0; + if (a.lineBreak != b.lineBreak || a.done != b.done || a.value != b.value) + return false; + pos += a.value.length; + if (a.done || pos >= end) + return true; + } + } + /** + Iterate over the text. When `dir` is `-1`, iteration happens + from end to start. This will return lines and the breaks between + them as separate strings. + */ + iter(dir = 1) { return new RawTextCursor(this, dir); } + /** + Iterate over a range of the text. When `from` > `to`, the + iterator will run in reverse. + */ + iterRange(from, to = this.length) { return new PartialTextCursor(this, from, to); } + /** + Return a cursor that iterates over the given range of lines, + _without_ returning the line breaks between, and yielding empty + strings for empty lines. + + When `from` and `to` are given, they should be 1-based line numbers. + */ + iterLines(from, to) { + let inner; + if (from == null) { + inner = this.iter(); + } + else { + if (to == null) + to = this.lines + 1; + let start = this.line(from).from; + inner = this.iterRange(start, Math.max(start, to == this.lines + 1 ? this.length : to <= 1 ? 0 : this.line(to - 1).to)); + } + return new LineCursor(inner); + } + /** + @internal + */ + toString() { return this.sliceString(0); } + /** + Convert the document to an array of lines (which can be + deserialized again via [`Text.of`](https://codemirror.net/6/docs/ref/#state.Text^of)). + */ + toJSON() { + let lines = []; + this.flatten(lines); + return lines; + } + /** + Create a `Text` instance for the given array of lines. + */ + static of(text) { + if (text.length == 0) + throw new RangeError("A document must have at least one line"); + if (text.length == 1 && !text[0]) + return Text.empty; + return text.length <= 32 /* Branch */ ? new TextLeaf(text) : TextNode.from(TextLeaf.split(text, [])); + } +} +// Leaves store an array of line strings. There are always line breaks +// between these strings. Leaves are limited in size and have to be +// contained in TextNode instances for bigger documents. +class TextLeaf extends Text { + constructor(text, length = textLength(text)) { + super(); + this.text = text; + this.length = length; + } + get lines() { return this.text.length; } + get children() { return null; } + lineInner(target, isLine, line, offset) { + for (let i = 0;; i++) { + let string = this.text[i], end = offset + string.length; + if ((isLine ? line : end) >= target) + return new Line(offset, end, line, string); + offset = end + 1; + line++; + } + } + decompose(from, to, target, open) { + let text = from <= 0 && to >= this.length ? this + : new TextLeaf(sliceText(this.text, from, to), Math.min(to, this.length) - Math.max(0, from)); + if (open & 1 /* From */) { + let prev = target.pop(); + let joined = appendText(text.text, prev.text.slice(), 0, text.length); + if (joined.length <= 32 /* Branch */) { + target.push(new TextLeaf(joined, prev.length + text.length)); + } + else { + let mid = joined.length >> 1; + target.push(new TextLeaf(joined.slice(0, mid)), new TextLeaf(joined.slice(mid))); + } + } + else { + target.push(text); + } + } + replace(from, to, text) { + if (!(text instanceof TextLeaf)) + return super.replace(from, to, text); + let lines = appendText(this.text, appendText(text.text, sliceText(this.text, 0, from)), to); + let newLen = this.length + text.length - (to - from); + if (lines.length <= 32 /* Branch */) + return new TextLeaf(lines, newLen); + return TextNode.from(TextLeaf.split(lines, []), newLen); + } + sliceString(from, to = this.length, lineSep = "\n") { + let result = ""; + for (let pos = 0, i = 0; pos <= to && i < this.text.length; i++) { + let line = this.text[i], end = pos + line.length; + if (pos > from && i) + result += lineSep; + if (from < end && to > pos) + result += line.slice(Math.max(0, from - pos), to - pos); + pos = end + 1; + } + return result; + } + flatten(target) { + for (let line of this.text) + target.push(line); + } + scanIdentical() { return 0; } + static split(text, target) { + let part = [], len = -1; + for (let line of text) { + part.push(line); + len += line.length + 1; + if (part.length == 32 /* Branch */) { + target.push(new TextLeaf(part, len)); + part = []; + len = -1; + } + } + if (len > -1) + target.push(new TextLeaf(part, len)); + return target; + } +} +// Nodes provide the tree structure of the `Text` type. They store a +// number of other nodes or leaves, taking care to balance themselves +// on changes. There are implied line breaks _between_ the children of +// a node (but not before the first or after the last child). +class TextNode extends Text { + constructor(children, length) { + super(); + this.children = children; + this.length = length; + this.lines = 0; + for (let child of children) + this.lines += child.lines; + } + lineInner(target, isLine, line, offset) { + for (let i = 0;; i++) { + let child = this.children[i], end = offset + child.length, endLine = line + child.lines - 1; + if ((isLine ? endLine : end) >= target) + return child.lineInner(target, isLine, line, offset); + offset = end + 1; + line = endLine + 1; + } + } + decompose(from, to, target, open) { + for (let i = 0, pos = 0; pos <= to && i < this.children.length; i++) { + let child = this.children[i], end = pos + child.length; + if (from <= end && to >= pos) { + let childOpen = open & ((pos <= from ? 1 /* From */ : 0) | (end >= to ? 2 /* To */ : 0)); + if (pos >= from && end <= to && !childOpen) + target.push(child); + else + child.decompose(from - pos, to - pos, target, childOpen); + } + pos = end + 1; + } + } + replace(from, to, text) { + if (text.lines < this.lines) + for (let i = 0, pos = 0; i < this.children.length; i++) { + let child = this.children[i], end = pos + child.length; + // Fast path: if the change only affects one child and the + // child's size remains in the acceptable range, only update + // that child + if (from >= pos && to <= end) { + let updated = child.replace(from - pos, to - pos, text); + let totalLines = this.lines - child.lines + updated.lines; + if (updated.lines < (totalLines >> (5 /* BranchShift */ - 1)) && + updated.lines > (totalLines >> (5 /* BranchShift */ + 1))) { + let copy = this.children.slice(); + copy[i] = updated; + return new TextNode(copy, this.length - (to - from) + text.length); + } + return super.replace(pos, end, updated); + } + pos = end + 1; + } + return super.replace(from, to, text); + } + sliceString(from, to = this.length, lineSep = "\n") { + let result = ""; + for (let i = 0, pos = 0; i < this.children.length && pos <= to; i++) { + let child = this.children[i], end = pos + child.length; + if (pos > from && i) + result += lineSep; + if (from < end && to > pos) + result += child.sliceString(from - pos, to - pos, lineSep); + pos = end + 1; + } + return result; + } + flatten(target) { + for (let child of this.children) + child.flatten(target); + } + scanIdentical(other, dir) { + if (!(other instanceof TextNode)) + return 0; + let length = 0; + let [iA, iB, eA, eB] = dir > 0 ? [0, 0, this.children.length, other.children.length] + : [this.children.length - 1, other.children.length - 1, -1, -1]; + for (;; iA += dir, iB += dir) { + if (iA == eA || iB == eB) + return length; + let chA = this.children[iA], chB = other.children[iB]; + if (chA != chB) + return length + chA.scanIdentical(chB, dir); + length += chA.length + 1; + } + } + static from(children, length = children.reduce((l, ch) => l + ch.length + 1, -1)) { + let lines = 0; + for (let ch of children) + lines += ch.lines; + if (lines < 32 /* Branch */) { + let flat = []; + for (let ch of children) + ch.flatten(flat); + return new TextLeaf(flat, length); + } + let chunk = Math.max(32 /* Branch */, lines >> 5 /* BranchShift */), maxChunk = chunk << 1, minChunk = chunk >> 1; + let chunked = [], currentLines = 0, currentLen = -1, currentChunk = []; + function add(child) { + let last; + if (child.lines > maxChunk && child instanceof TextNode) { + for (let node of child.children) + add(node); + } + else if (child.lines > minChunk && (currentLines > minChunk || !currentLines)) { + flush(); + chunked.push(child); + } + else if (child instanceof TextLeaf && currentLines && + (last = currentChunk[currentChunk.length - 1]) instanceof TextLeaf && + child.lines + last.lines <= 32 /* Branch */) { + currentLines += child.lines; + currentLen += child.length + 1; + currentChunk[currentChunk.length - 1] = new TextLeaf(last.text.concat(child.text), last.length + 1 + child.length); + } + else { + if (currentLines + child.lines > chunk) + flush(); + currentLines += child.lines; + currentLen += child.length + 1; + currentChunk.push(child); + } + } + function flush() { + if (currentLines == 0) + return; + chunked.push(currentChunk.length == 1 ? currentChunk[0] : TextNode.from(currentChunk, currentLen)); + currentLen = -1; + currentLines = currentChunk.length = 0; + } + for (let child of children) + add(child); + flush(); + return chunked.length == 1 ? chunked[0] : new TextNode(chunked, length); + } +} +Text.empty = new TextLeaf([""], 0); +function textLength(text) { + let length = -1; + for (let line of text) + length += line.length + 1; + return length; +} +function appendText(text, target, from = 0, to = 1e9) { + for (let pos = 0, i = 0, first = true; i < text.length && pos <= to; i++) { + let line = text[i], end = pos + line.length; + if (end >= from) { + if (end > to) + line = line.slice(0, to - pos); + if (pos < from) + line = line.slice(from - pos); + if (first) { + target[target.length - 1] += line; + first = false; + } + else + target.push(line); + } + pos = end + 1; + } + return target; +} +function sliceText(text, from, to) { + return appendText(text, [""], from, to); +} +class RawTextCursor { + constructor(text, dir = 1) { + this.dir = dir; + this.done = false; + this.lineBreak = false; + this.value = ""; + this.nodes = [text]; + this.offsets = [dir > 0 ? 1 : (text instanceof TextLeaf ? text.text.length : text.children.length) << 1]; + } + nextInner(skip, dir) { + this.done = this.lineBreak = false; + for (;;) { + let last = this.nodes.length - 1; + let top = this.nodes[last], offsetValue = this.offsets[last], offset = offsetValue >> 1; + let size = top instanceof TextLeaf ? top.text.length : top.children.length; + if (offset == (dir > 0 ? size : 0)) { + if (last == 0) { + this.done = true; + this.value = ""; + return this; + } + if (dir > 0) + this.offsets[last - 1]++; + this.nodes.pop(); + this.offsets.pop(); + } + else if ((offsetValue & 1) == (dir > 0 ? 0 : 1)) { + this.offsets[last] += dir; + if (skip == 0) { + this.lineBreak = true; + this.value = "\n"; + return this; + } + skip--; + } + else if (top instanceof TextLeaf) { + // Move to the next string + let next = top.text[offset + (dir < 0 ? -1 : 0)]; + this.offsets[last] += dir; + if (next.length > Math.max(0, skip)) { + this.value = skip == 0 ? next : dir > 0 ? next.slice(skip) : next.slice(0, next.length - skip); + return this; + } + skip -= next.length; + } + else { + let next = top.children[offset + (dir < 0 ? -1 : 0)]; + if (skip > next.length) { + skip -= next.length; + this.offsets[last] += dir; + } + else { + if (dir < 0) + this.offsets[last]--; + this.nodes.push(next); + this.offsets.push(dir > 0 ? 1 : (next instanceof TextLeaf ? next.text.length : next.children.length) << 1); + } + } + } + } + next(skip = 0) { + if (skip < 0) { + this.nextInner(-skip, (-this.dir)); + skip = this.value.length; + } + return this.nextInner(skip, this.dir); + } +} +class PartialTextCursor { + constructor(text, start, end) { + this.value = ""; + this.done = false; + this.cursor = new RawTextCursor(text, start > end ? -1 : 1); + this.pos = start > end ? text.length : 0; + this.from = Math.min(start, end); + this.to = Math.max(start, end); + } + nextInner(skip, dir) { + if (dir < 0 ? this.pos <= this.from : this.pos >= this.to) { + this.value = ""; + this.done = true; + return this; + } + skip += Math.max(0, dir < 0 ? this.pos - this.to : this.from - this.pos); + let limit = dir < 0 ? this.pos - this.from : this.to - this.pos; + if (skip > limit) + skip = limit; + limit -= skip; + let { value } = this.cursor.next(skip); + this.pos += (value.length + skip) * dir; + this.value = value.length <= limit ? value : dir < 0 ? value.slice(value.length - limit) : value.slice(0, limit); + this.done = !this.value; + return this; + } + next(skip = 0) { + if (skip < 0) + skip = Math.max(skip, this.from - this.pos); + else if (skip > 0) + skip = Math.min(skip, this.to - this.pos); + return this.nextInner(skip, this.cursor.dir); + } + get lineBreak() { return this.cursor.lineBreak && this.value != ""; } +} +class LineCursor { + constructor(inner) { + this.inner = inner; + this.afterBreak = true; + this.value = ""; + this.done = false; + } + next(skip = 0) { + let { done, lineBreak, value } = this.inner.next(skip); + if (done) { + this.done = true; + this.value = ""; + } + else if (lineBreak) { + if (this.afterBreak) { + this.value = ""; + } + else { + this.afterBreak = true; + this.next(); + } + } + else { + this.value = value; + this.afterBreak = false; + } + return this; + } + get lineBreak() { return false; } +} +if (typeof Symbol != "undefined") { + Text.prototype[Symbol.iterator] = function () { return this.iter(); }; + RawTextCursor.prototype[Symbol.iterator] = PartialTextCursor.prototype[Symbol.iterator] = + LineCursor.prototype[Symbol.iterator] = function () { return this; }; +} +/** +This type describes a line in the document. It is created +on-demand when lines are [queried](https://codemirror.net/6/docs/ref/#state.Text.lineAt). +*/ +class Line { + /** + @internal + */ + constructor( + /** + The position of the start of the line. + */ + from, + /** + The position at the end of the line (_before_ the line break, + or at the end of document for the last line). + */ + to, + /** + This line's line number (1-based). + */ + number, + /** + The line's content. + */ + text) { + this.from = from; + this.to = to; + this.number = number; + this.text = text; + } + /** + The length of the line (not including any line break after it). + */ + get length() { return this.to - this.from; } +} + +// Compressed representation of the Grapheme_Cluster_Break=Extend +// information from +// http://www.unicode.org/Public/13.0.0/ucd/auxiliary/GraphemeBreakProperty.txt. +// Each pair of elements represents a range, as an offet from the +// previous range and a length. Numbers are in base-36, with the empty +// string being a shorthand for 1. +let extend = "lc,34,7n,7,7b,19,,,,2,,2,,,20,b,1c,l,g,,2t,7,2,6,2,2,,4,z,,u,r,2j,b,1m,9,9,,o,4,,9,,3,,5,17,3,3b,f,,w,1j,,,,4,8,4,,3,7,a,2,t,,1m,,,,2,4,8,,9,,a,2,q,,2,2,1l,,4,2,4,2,2,3,3,,u,2,3,,b,2,1l,,4,5,,2,4,,k,2,m,6,,,1m,,,2,,4,8,,7,3,a,2,u,,1n,,,,c,,9,,14,,3,,1l,3,5,3,,4,7,2,b,2,t,,1m,,2,,2,,3,,5,2,7,2,b,2,s,2,1l,2,,,2,4,8,,9,,a,2,t,,20,,4,,2,3,,,8,,29,,2,7,c,8,2q,,2,9,b,6,22,2,r,,,,,,1j,e,,5,,2,5,b,,10,9,,2u,4,,6,,2,2,2,p,2,4,3,g,4,d,,2,2,6,,f,,jj,3,qa,3,t,3,t,2,u,2,1s,2,,7,8,,2,b,9,,19,3,3b,2,y,,3a,3,4,2,9,,6,3,63,2,2,,1m,,,7,,,,,2,8,6,a,2,,1c,h,1r,4,1c,7,,,5,,14,9,c,2,w,4,2,2,,3,1k,,,2,3,,,3,1m,8,2,2,48,3,,d,,7,4,,6,,3,2,5i,1m,,5,ek,,5f,x,2da,3,3x,,2o,w,fe,6,2x,2,n9w,4,,a,w,2,28,2,7k,,3,,4,,p,2,5,,47,2,q,i,d,,12,8,p,b,1a,3,1c,,2,4,2,2,13,,1v,6,2,2,2,2,c,,8,,1b,,1f,,,3,2,2,5,2,,,16,2,8,,6m,,2,,4,,fn4,,kh,g,g,g,a6,2,gt,,6a,,45,5,1ae,3,,2,5,4,14,3,4,,4l,2,fx,4,ar,2,49,b,4w,,1i,f,1k,3,1d,4,2,2,1x,3,10,5,,8,1q,,c,2,1g,9,a,4,2,,2n,3,2,,,2,6,,4g,,3,8,l,2,1l,2,,,,,m,,e,7,3,5,5f,8,2,3,,,n,,29,,2,6,,,2,,,2,,2,6j,,2,4,6,2,,2,r,2,2d,8,2,,,2,2y,,,,2,6,,,2t,3,2,4,,5,77,9,,2,6t,,a,2,,,4,,40,4,2,2,4,,w,a,14,6,2,4,8,,9,6,2,3,1a,d,,2,ba,7,,6,,,2a,m,2,7,,2,,2,3e,6,3,,,2,,7,,,20,2,3,,,,9n,2,f0b,5,1n,7,t4,,1r,4,29,,f5k,2,43q,,,3,4,5,8,8,2,7,u,4,44,3,1iz,1j,4,1e,8,,e,,m,5,,f,11s,7,,h,2,7,,2,,5,79,7,c5,4,15s,7,31,7,240,5,gx7k,2o,3k,6o".split(",").map(s => s ? parseInt(s, 36) : 1); +// Convert offsets into absolute values +for (let i = 1; i < extend.length; i++) + extend[i] += extend[i - 1]; +function isExtendingChar(code) { + for (let i = 1; i < extend.length; i += 2) + if (extend[i] > code) + return extend[i - 1] <= code; + return false; +} +function isRegionalIndicator(code) { + return code >= 0x1F1E6 && code <= 0x1F1FF; +} +const ZWJ = 0x200d; +/** +Returns a next grapheme cluster break _after_ (not equal to) +`pos`, if `forward` is true, or before otherwise. Returns `pos` +itself if no further cluster break is available in the string. +Moves across surrogate pairs, extending characters (when +`includeExtending` is true), characters joined with zero-width +joiners, and flag emoji. +*/ +function findClusterBreak(str, pos, forward = true, includeExtending = true) { + return (forward ? nextClusterBreak : prevClusterBreak)(str, pos, includeExtending); +} +function nextClusterBreak(str, pos, includeExtending) { + if (pos == str.length) + return pos; + // If pos is in the middle of a surrogate pair, move to its start + if (pos && surrogateLow(str.charCodeAt(pos)) && surrogateHigh(str.charCodeAt(pos - 1))) + pos--; + let prev = codePointAt(str, pos); + pos += codePointSize(prev); + while (pos < str.length) { + let next = codePointAt(str, pos); + if (prev == ZWJ || next == ZWJ || includeExtending && isExtendingChar(next)) { + pos += codePointSize(next); + prev = next; + } + else if (isRegionalIndicator(next)) { + let countBefore = 0, i = pos - 2; + while (i >= 0 && isRegionalIndicator(codePointAt(str, i))) { + countBefore++; + i -= 2; + } + if (countBefore % 2 == 0) + break; + else + pos += 2; + } + else { + break; + } + } + return pos; +} +function prevClusterBreak(str, pos, includeExtending) { + while (pos > 0) { + let found = nextClusterBreak(str, pos - 2, includeExtending); + if (found < pos) + return found; + pos--; + } + return 0; +} +function surrogateLow(ch) { return ch >= 0xDC00 && ch < 0xE000; } +function surrogateHigh(ch) { return ch >= 0xD800 && ch < 0xDC00; } +/** +Find the code point at the given position in a string (like the +[`codePointAt`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/codePointAt) +string method). +*/ +function codePointAt(str, pos) { + let code0 = str.charCodeAt(pos); + if (!surrogateHigh(code0) || pos + 1 == str.length) + return code0; + let code1 = str.charCodeAt(pos + 1); + if (!surrogateLow(code1)) + return code0; + return ((code0 - 0xd800) << 10) + (code1 - 0xdc00) + 0x10000; +} +/** +Given a Unicode codepoint, return the JavaScript string that +respresents it (like +[`String.fromCodePoint`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/fromCodePoint)). +*/ +function fromCodePoint(code) { + if (code <= 0xffff) + return String.fromCharCode(code); + code -= 0x10000; + return String.fromCharCode((code >> 10) + 0xd800, (code & 1023) + 0xdc00); +} +/** +The amount of positions a character takes up a JavaScript string. +*/ +function codePointSize(code) { return code < 0x10000 ? 1 : 2; } + +const DefaultSplit = /\r\n?|\n/; +/** +Distinguishes different ways in which positions can be mapped. +*/ +exports.MapMode = void 0; +(function (MapMode) { + /** + Map a position to a valid new position, even when its context + was deleted. + */ + MapMode[MapMode["Simple"] = 0] = "Simple"; + /** + Return null if deletion happens across the position. + */ + MapMode[MapMode["TrackDel"] = 1] = "TrackDel"; + /** + Return null if the character _before_ the position is deleted. + */ + MapMode[MapMode["TrackBefore"] = 2] = "TrackBefore"; + /** + Return null if the character _after_ the position is deleted. + */ + MapMode[MapMode["TrackAfter"] = 3] = "TrackAfter"; +})(exports.MapMode || (exports.MapMode = {})); +/** +A change description is a variant of [change set](https://codemirror.net/6/docs/ref/#state.ChangeSet) +that doesn't store the inserted text. As such, it can't be +applied, but is cheaper to store and manipulate. +*/ +class ChangeDesc { + // Sections are encoded as pairs of integers. The first is the + // length in the current document, and the second is -1 for + // unaffected sections, and the length of the replacement content + // otherwise. So an insertion would be (0, n>0), a deletion (n>0, + // 0), and a replacement two positive numbers. + /** + @internal + */ + constructor( + /** + @internal + */ + sections) { + this.sections = sections; + } + /** + The length of the document before the change. + */ + get length() { + let result = 0; + for (let i = 0; i < this.sections.length; i += 2) + result += this.sections[i]; + return result; + } + /** + The length of the document after the change. + */ + get newLength() { + let result = 0; + for (let i = 0; i < this.sections.length; i += 2) { + let ins = this.sections[i + 1]; + result += ins < 0 ? this.sections[i] : ins; + } + return result; + } + /** + False when there are actual changes in this set. + */ + get empty() { return this.sections.length == 0 || this.sections.length == 2 && this.sections[1] < 0; } + /** + Iterate over the unchanged parts left by these changes. `posA` + provides the position of the range in the old document, `posB` + the new position in the changed document. + */ + iterGaps(f) { + for (let i = 0, posA = 0, posB = 0; i < this.sections.length;) { + let len = this.sections[i++], ins = this.sections[i++]; + if (ins < 0) { + f(posA, posB, len); + posB += len; + } + else { + posB += ins; + } + posA += len; + } + } + /** + Iterate over the ranges changed by these changes. (See + [`ChangeSet.iterChanges`](https://codemirror.net/6/docs/ref/#state.ChangeSet.iterChanges) for a + variant that also provides you with the inserted text.) + `fromA`/`toA` provides the extent of the change in the starting + document, `fromB`/`toB` the extent of the replacement in the + changed document. + + When `individual` is true, adjacent changes (which are kept + separate for [position mapping](https://codemirror.net/6/docs/ref/#state.ChangeDesc.mapPos)) are + reported separately. + */ + iterChangedRanges(f, individual = false) { + iterChanges(this, f, individual); + } + /** + Get a description of the inverted form of these changes. + */ + get invertedDesc() { + let sections = []; + for (let i = 0; i < this.sections.length;) { + let len = this.sections[i++], ins = this.sections[i++]; + if (ins < 0) + sections.push(len, ins); + else + sections.push(ins, len); + } + return new ChangeDesc(sections); + } + /** + Compute the combined effect of applying another set of changes + after this one. The length of the document after this set should + match the length before `other`. + */ + composeDesc(other) { return this.empty ? other : other.empty ? this : composeSets(this, other); } + /** + Map this description, which should start with the same document + as `other`, over another set of changes, so that it can be + applied after it. When `before` is true, map as if the changes + in `other` happened before the ones in `this`. + */ + mapDesc(other, before = false) { return other.empty ? this : mapSet(this, other, before); } + mapPos(pos, assoc = -1, mode = exports.MapMode.Simple) { + let posA = 0, posB = 0; + for (let i = 0; i < this.sections.length;) { + let len = this.sections[i++], ins = this.sections[i++], endA = posA + len; + if (ins < 0) { + if (endA > pos) + return posB + (pos - posA); + posB += len; + } + else { + if (mode != exports.MapMode.Simple && endA >= pos && + (mode == exports.MapMode.TrackDel && posA < pos && endA > pos || + mode == exports.MapMode.TrackBefore && posA < pos || + mode == exports.MapMode.TrackAfter && endA > pos)) + return null; + if (endA > pos || endA == pos && assoc < 0 && !len) + return pos == posA || assoc < 0 ? posB : posB + ins; + posB += ins; + } + posA = endA; + } + if (pos > posA) + throw new RangeError(`Position ${pos} is out of range for changeset of length ${posA}`); + return posB; + } + /** + Check whether these changes touch a given range. When one of the + changes entirely covers the range, the string `"cover"` is + returned. + */ + touchesRange(from, to = from) { + for (let i = 0, pos = 0; i < this.sections.length && pos <= to;) { + let len = this.sections[i++], ins = this.sections[i++], end = pos + len; + if (ins >= 0 && pos <= to && end >= from) + return pos < from && end > to ? "cover" : true; + pos = end; + } + return false; + } + /** + @internal + */ + toString() { + let result = ""; + for (let i = 0; i < this.sections.length;) { + let len = this.sections[i++], ins = this.sections[i++]; + result += (result ? " " : "") + len + (ins >= 0 ? ":" + ins : ""); + } + return result; + } + /** + Serialize this change desc to a JSON-representable value. + */ + toJSON() { return this.sections; } + /** + Create a change desc from its JSON representation (as produced + by [`toJSON`](https://codemirror.net/6/docs/ref/#state.ChangeDesc.toJSON). + */ + static fromJSON(json) { + if (!Array.isArray(json) || json.length % 2 || json.some(a => typeof a != "number")) + throw new RangeError("Invalid JSON representation of ChangeDesc"); + return new ChangeDesc(json); + } + /** + @internal + */ + static create(sections) { return new ChangeDesc(sections); } +} +/** +A change set represents a group of modifications to a document. It +stores the document length, and can only be applied to documents +with exactly that length. +*/ +class ChangeSet extends ChangeDesc { + constructor(sections, + /** + @internal + */ + inserted) { + super(sections); + this.inserted = inserted; + } + /** + Apply the changes to a document, returning the modified + document. + */ + apply(doc) { + if (this.length != doc.length) + throw new RangeError("Applying change set to a document with the wrong length"); + iterChanges(this, (fromA, toA, fromB, _toB, text) => doc = doc.replace(fromB, fromB + (toA - fromA), text), false); + return doc; + } + mapDesc(other, before = false) { return mapSet(this, other, before, true); } + /** + Given the document as it existed _before_ the changes, return a + change set that represents the inverse of this set, which could + be used to go from the document created by the changes back to + the document as it existed before the changes. + */ + invert(doc) { + let sections = this.sections.slice(), inserted = []; + for (let i = 0, pos = 0; i < sections.length; i += 2) { + let len = sections[i], ins = sections[i + 1]; + if (ins >= 0) { + sections[i] = ins; + sections[i + 1] = len; + let index = i >> 1; + while (inserted.length < index) + inserted.push(Text.empty); + inserted.push(len ? doc.slice(pos, pos + len) : Text.empty); + } + pos += len; + } + return new ChangeSet(sections, inserted); + } + /** + Combine two subsequent change sets into a single set. `other` + must start in the document produced by `this`. If `this` goes + `docA` → `docB` and `other` represents `docB` → `docC`, the + returned value will represent the change `docA` → `docC`. + */ + compose(other) { return this.empty ? other : other.empty ? this : composeSets(this, other, true); } + /** + Given another change set starting in the same document, maps this + change set over the other, producing a new change set that can be + applied to the document produced by applying `other`. When + `before` is `true`, order changes as if `this` comes before + `other`, otherwise (the default) treat `other` as coming first. + + Given two changes `A` and `B`, `A.compose(B.map(A))` and + `B.compose(A.map(B, true))` will produce the same document. This + provides a basic form of [operational + transformation](https://en.wikipedia.org/wiki/Operational_transformation), + and can be used for collaborative editing. + */ + map(other, before = false) { return other.empty ? this : mapSet(this, other, before, true); } + /** + Iterate over the changed ranges in the document, calling `f` for + each, with the range in the original document (`fromA`-`toA`) + and the range that replaces it in the new document + (`fromB`-`toB`). + + When `individual` is true, adjacent changes are reported + separately. + */ + iterChanges(f, individual = false) { + iterChanges(this, f, individual); + } + /** + Get a [change description](https://codemirror.net/6/docs/ref/#state.ChangeDesc) for this change + set. + */ + get desc() { return ChangeDesc.create(this.sections); } + /** + @internal + */ + filter(ranges) { + let resultSections = [], resultInserted = [], filteredSections = []; + let iter = new SectionIter(this); + done: for (let i = 0, pos = 0;;) { + let next = i == ranges.length ? 1e9 : ranges[i++]; + while (pos < next || pos == next && iter.len == 0) { + if (iter.done) + break done; + let len = Math.min(iter.len, next - pos); + addSection(filteredSections, len, -1); + let ins = iter.ins == -1 ? -1 : iter.off == 0 ? iter.ins : 0; + addSection(resultSections, len, ins); + if (ins > 0) + addInsert(resultInserted, resultSections, iter.text); + iter.forward(len); + pos += len; + } + let end = ranges[i++]; + while (pos < end) { + if (iter.done) + break done; + let len = Math.min(iter.len, end - pos); + addSection(resultSections, len, -1); + addSection(filteredSections, len, iter.ins == -1 ? -1 : iter.off == 0 ? iter.ins : 0); + iter.forward(len); + pos += len; + } + } + return { changes: new ChangeSet(resultSections, resultInserted), + filtered: ChangeDesc.create(filteredSections) }; + } + /** + Serialize this change set to a JSON-representable value. + */ + toJSON() { + let parts = []; + for (let i = 0; i < this.sections.length; i += 2) { + let len = this.sections[i], ins = this.sections[i + 1]; + if (ins < 0) + parts.push(len); + else if (ins == 0) + parts.push([len]); + else + parts.push([len].concat(this.inserted[i >> 1].toJSON())); + } + return parts; + } + /** + Create a change set for the given changes, for a document of the + given length, using `lineSep` as line separator. + */ + static of(changes, length, lineSep) { + let sections = [], inserted = [], pos = 0; + let total = null; + function flush(force = false) { + if (!force && !sections.length) + return; + if (pos < length) + addSection(sections, length - pos, -1); + let set = new ChangeSet(sections, inserted); + total = total ? total.compose(set.map(total)) : set; + sections = []; + inserted = []; + pos = 0; + } + function process(spec) { + if (Array.isArray(spec)) { + for (let sub of spec) + process(sub); + } + else if (spec instanceof ChangeSet) { + if (spec.length != length) + throw new RangeError(`Mismatched change set length (got ${spec.length}, expected ${length})`); + flush(); + total = total ? total.compose(spec.map(total)) : spec; + } + else { + let { from, to = from, insert } = spec; + if (from > to || from < 0 || to > length) + throw new RangeError(`Invalid change range ${from} to ${to} (in doc of length ${length})`); + let insText = !insert ? Text.empty : typeof insert == "string" ? Text.of(insert.split(lineSep || DefaultSplit)) : insert; + let insLen = insText.length; + if (from == to && insLen == 0) + return; + if (from < pos) + flush(); + if (from > pos) + addSection(sections, from - pos, -1); + addSection(sections, to - from, insLen); + addInsert(inserted, sections, insText); + pos = to; + } + } + process(changes); + flush(!total); + return total; + } + /** + Create an empty changeset of the given length. + */ + static empty(length) { + return new ChangeSet(length ? [length, -1] : [], []); + } + /** + Create a changeset from its JSON representation (as produced by + [`toJSON`](https://codemirror.net/6/docs/ref/#state.ChangeSet.toJSON). + */ + static fromJSON(json) { + if (!Array.isArray(json)) + throw new RangeError("Invalid JSON representation of ChangeSet"); + let sections = [], inserted = []; + for (let i = 0; i < json.length; i++) { + let part = json[i]; + if (typeof part == "number") { + sections.push(part, -1); + } + else if (!Array.isArray(part) || typeof part[0] != "number" || part.some((e, i) => i && typeof e != "string")) { + throw new RangeError("Invalid JSON representation of ChangeSet"); + } + else if (part.length == 1) { + sections.push(part[0], 0); + } + else { + while (inserted.length < i) + inserted.push(Text.empty); + inserted[i] = Text.of(part.slice(1)); + sections.push(part[0], inserted[i].length); + } + } + return new ChangeSet(sections, inserted); + } + /** + @internal + */ + static createSet(sections, inserted) { + return new ChangeSet(sections, inserted); + } +} +function addSection(sections, len, ins, forceJoin = false) { + if (len == 0 && ins <= 0) + return; + let last = sections.length - 2; + if (last >= 0 && ins <= 0 && ins == sections[last + 1]) + sections[last] += len; + else if (len == 0 && sections[last] == 0) + sections[last + 1] += ins; + else if (forceJoin) { + sections[last] += len; + sections[last + 1] += ins; + } + else + sections.push(len, ins); +} +function addInsert(values, sections, value) { + if (value.length == 0) + return; + let index = (sections.length - 2) >> 1; + if (index < values.length) { + values[values.length - 1] = values[values.length - 1].append(value); + } + else { + while (values.length < index) + values.push(Text.empty); + values.push(value); + } +} +function iterChanges(desc, f, individual) { + let inserted = desc.inserted; + for (let posA = 0, posB = 0, i = 0; i < desc.sections.length;) { + let len = desc.sections[i++], ins = desc.sections[i++]; + if (ins < 0) { + posA += len; + posB += len; + } + else { + let endA = posA, endB = posB, text = Text.empty; + for (;;) { + endA += len; + endB += ins; + if (ins && inserted) + text = text.append(inserted[(i - 2) >> 1]); + if (individual || i == desc.sections.length || desc.sections[i + 1] < 0) + break; + len = desc.sections[i++]; + ins = desc.sections[i++]; + } + f(posA, endA, posB, endB, text); + posA = endA; + posB = endB; + } + } +} +function mapSet(setA, setB, before, mkSet = false) { + let sections = [], insert = mkSet ? [] : null; + let a = new SectionIter(setA), b = new SectionIter(setB); + for (let posA = 0, posB = 0;;) { + if (a.ins == -1) { + posA += a.len; + a.next(); + } + else if (b.ins == -1 && posB < posA) { + let skip = Math.min(b.len, posA - posB); + b.forward(skip); + addSection(sections, skip, -1); + posB += skip; + } + else if (b.ins >= 0 && (a.done || posB < posA || posB == posA && (b.len < a.len || b.len == a.len && !before))) { + addSection(sections, b.ins, -1); + while (posA > posB && !a.done && posA + a.len < posB + b.len) { + posA += a.len; + a.next(); + } + posB += b.len; + b.next(); + } + else if (a.ins >= 0) { + let len = 0, end = posA + a.len; + for (;;) { + if (b.ins >= 0 && posB > posA && posB + b.len < end) { + len += b.ins; + posB += b.len; + b.next(); + } + else if (b.ins == -1 && posB < end) { + let skip = Math.min(b.len, end - posB); + len += skip; + b.forward(skip); + posB += skip; + } + else { + break; + } + } + addSection(sections, len, a.ins); + if (insert) + addInsert(insert, sections, a.text); + posA = end; + a.next(); + } + else if (a.done && b.done) { + return insert ? ChangeSet.createSet(sections, insert) : ChangeDesc.create(sections); + } + else { + throw new Error("Mismatched change set lengths"); + } + } +} +function composeSets(setA, setB, mkSet = false) { + let sections = []; + let insert = mkSet ? [] : null; + let a = new SectionIter(setA), b = new SectionIter(setB); + for (let open = false;;) { + if (a.done && b.done) { + return insert ? ChangeSet.createSet(sections, insert) : ChangeDesc.create(sections); + } + else if (a.ins == 0) { // Deletion in A + addSection(sections, a.len, 0, open); + a.next(); + } + else if (b.len == 0 && !b.done) { // Insertion in B + addSection(sections, 0, b.ins, open); + if (insert) + addInsert(insert, sections, b.text); + b.next(); + } + else if (a.done || b.done) { + throw new Error("Mismatched change set lengths"); + } + else { + let len = Math.min(a.len2, b.len), sectionLen = sections.length; + if (a.ins == -1) { + let insB = b.ins == -1 ? -1 : b.off ? 0 : b.ins; + addSection(sections, len, insB, open); + if (insert && insB) + addInsert(insert, sections, b.text); + } + else if (b.ins == -1) { + addSection(sections, a.off ? 0 : a.len, len, open); + if (insert) + addInsert(insert, sections, a.textBit(len)); + } + else { + addSection(sections, a.off ? 0 : a.len, b.off ? 0 : b.ins, open); + if (insert && !b.off) + addInsert(insert, sections, b.text); + } + open = (a.ins > len || b.ins >= 0 && b.len > len) && (open || sections.length > sectionLen); + a.forward2(len); + b.forward(len); + } + } +} +class SectionIter { + constructor(set) { + this.set = set; + this.i = 0; + this.next(); + } + next() { + let { sections } = this.set; + if (this.i < sections.length) { + this.len = sections[this.i++]; + this.ins = sections[this.i++]; + } + else { + this.len = 0; + this.ins = -2; + } + this.off = 0; + } + get done() { return this.ins == -2; } + get len2() { return this.ins < 0 ? this.len : this.ins; } + get text() { + let { inserted } = this.set, index = (this.i - 2) >> 1; + return index >= inserted.length ? Text.empty : inserted[index]; + } + textBit(len) { + let { inserted } = this.set, index = (this.i - 2) >> 1; + return index >= inserted.length && !len ? Text.empty + : inserted[index].slice(this.off, len == null ? undefined : this.off + len); + } + forward(len) { + if (len == this.len) + this.next(); + else { + this.len -= len; + this.off += len; + } + } + forward2(len) { + if (this.ins == -1) + this.forward(len); + else if (len == this.ins) + this.next(); + else { + this.ins -= len; + this.off += len; + } + } +} + +/** +A single selection range. When +[`allowMultipleSelections`](https://codemirror.net/6/docs/ref/#state.EditorState^allowMultipleSelections) +is enabled, a [selection](https://codemirror.net/6/docs/ref/#state.EditorSelection) may hold +multiple ranges. By default, selections hold exactly one range. +*/ +class SelectionRange { + constructor( + /** + The lower boundary of the range. + */ + from, + /** + The upper boundary of the range. + */ + to, flags) { + this.from = from; + this.to = to; + this.flags = flags; + } + /** + The anchor of the range—the side that doesn't move when you + extend it. + */ + get anchor() { return this.flags & 16 /* Inverted */ ? this.to : this.from; } + /** + The head of the range, which is moved when the range is + [extended](https://codemirror.net/6/docs/ref/#state.SelectionRange.extend). + */ + get head() { return this.flags & 16 /* Inverted */ ? this.from : this.to; } + /** + True when `anchor` and `head` are at the same position. + */ + get empty() { return this.from == this.to; } + /** + If this is a cursor that is explicitly associated with the + character on one of its sides, this returns the side. -1 means + the character before its position, 1 the character after, and 0 + means no association. + */ + get assoc() { return this.flags & 4 /* AssocBefore */ ? -1 : this.flags & 8 /* AssocAfter */ ? 1 : 0; } + /** + The bidirectional text level associated with this cursor, if + any. + */ + get bidiLevel() { + let level = this.flags & 3 /* BidiLevelMask */; + return level == 3 ? null : level; + } + /** + The goal column (stored vertical offset) associated with a + cursor. This is used to preserve the vertical position when + [moving](https://codemirror.net/6/docs/ref/#view.EditorView.moveVertically) across + lines of different length. + */ + get goalColumn() { + let value = this.flags >> 5 /* GoalColumnOffset */; + return value == 33554431 /* NoGoalColumn */ ? undefined : value; + } + /** + Map this range through a change, producing a valid range in the + updated document. + */ + map(change, assoc = -1) { + let from, to; + if (this.empty) { + from = to = change.mapPos(this.from, assoc); + } + else { + from = change.mapPos(this.from, 1); + to = change.mapPos(this.to, -1); + } + return from == this.from && to == this.to ? this : new SelectionRange(from, to, this.flags); + } + /** + Extend this range to cover at least `from` to `to`. + */ + extend(from, to = from) { + if (from <= this.anchor && to >= this.anchor) + return EditorSelection.range(from, to); + let head = Math.abs(from - this.anchor) > Math.abs(to - this.anchor) ? from : to; + return EditorSelection.range(this.anchor, head); + } + /** + Compare this range to another range. + */ + eq(other) { + return this.anchor == other.anchor && this.head == other.head; + } + /** + Return a JSON-serializable object representing the range. + */ + toJSON() { return { anchor: this.anchor, head: this.head }; } + /** + Convert a JSON representation of a range to a `SelectionRange` + instance. + */ + static fromJSON(json) { + if (!json || typeof json.anchor != "number" || typeof json.head != "number") + throw new RangeError("Invalid JSON representation for SelectionRange"); + return EditorSelection.range(json.anchor, json.head); + } + /** + @internal + */ + static create(from, to, flags) { + return new SelectionRange(from, to, flags); + } +} +/** +An editor selection holds one or more selection ranges. +*/ +class EditorSelection { + constructor( + /** + The ranges in the selection, sorted by position. Ranges cannot + overlap (but they may touch, if they aren't empty). + */ + ranges, + /** + The index of the _main_ range in the selection (which is + usually the range that was added last). + */ + mainIndex) { + this.ranges = ranges; + this.mainIndex = mainIndex; + } + /** + Map a selection through a change. Used to adjust the selection + position for changes. + */ + map(change, assoc = -1) { + if (change.empty) + return this; + return EditorSelection.create(this.ranges.map(r => r.map(change, assoc)), this.mainIndex); + } + /** + Compare this selection to another selection. + */ + eq(other) { + if (this.ranges.length != other.ranges.length || + this.mainIndex != other.mainIndex) + return false; + for (let i = 0; i < this.ranges.length; i++) + if (!this.ranges[i].eq(other.ranges[i])) + return false; + return true; + } + /** + Get the primary selection range. Usually, you should make sure + your code applies to _all_ ranges, by using methods like + [`changeByRange`](https://codemirror.net/6/docs/ref/#state.EditorState.changeByRange). + */ + get main() { return this.ranges[this.mainIndex]; } + /** + Make sure the selection only has one range. Returns a selection + holding only the main range from this selection. + */ + asSingle() { + return this.ranges.length == 1 ? this : new EditorSelection([this.main], 0); + } + /** + Extend this selection with an extra range. + */ + addRange(range, main = true) { + return EditorSelection.create([range].concat(this.ranges), main ? 0 : this.mainIndex + 1); + } + /** + Replace a given range with another range, and then normalize the + selection to merge and sort ranges if necessary. + */ + replaceRange(range, which = this.mainIndex) { + let ranges = this.ranges.slice(); + ranges[which] = range; + return EditorSelection.create(ranges, this.mainIndex); + } + /** + Convert this selection to an object that can be serialized to + JSON. + */ + toJSON() { + return { ranges: this.ranges.map(r => r.toJSON()), main: this.mainIndex }; + } + /** + Create a selection from a JSON representation. + */ + static fromJSON(json) { + if (!json || !Array.isArray(json.ranges) || typeof json.main != "number" || json.main >= json.ranges.length) + throw new RangeError("Invalid JSON representation for EditorSelection"); + return new EditorSelection(json.ranges.map((r) => SelectionRange.fromJSON(r)), json.main); + } + /** + Create a selection holding a single range. + */ + static single(anchor, head = anchor) { + return new EditorSelection([EditorSelection.range(anchor, head)], 0); + } + /** + Sort and merge the given set of ranges, creating a valid + selection. + */ + static create(ranges, mainIndex = 0) { + if (ranges.length == 0) + throw new RangeError("A selection needs at least one range"); + for (let pos = 0, i = 0; i < ranges.length; i++) { + let range = ranges[i]; + if (range.empty ? range.from <= pos : range.from < pos) + return EditorSelection.normalized(ranges.slice(), mainIndex); + pos = range.to; + } + return new EditorSelection(ranges, mainIndex); + } + /** + Create a cursor selection range at the given position. You can + safely ignore the optional arguments in most situations. + */ + static cursor(pos, assoc = 0, bidiLevel, goalColumn) { + return SelectionRange.create(pos, pos, (assoc == 0 ? 0 : assoc < 0 ? 4 /* AssocBefore */ : 8 /* AssocAfter */) | + (bidiLevel == null ? 3 : Math.min(2, bidiLevel)) | + ((goalColumn !== null && goalColumn !== void 0 ? goalColumn : 33554431 /* NoGoalColumn */) << 5 /* GoalColumnOffset */)); + } + /** + Create a selection range. + */ + static range(anchor, head, goalColumn) { + let goal = (goalColumn !== null && goalColumn !== void 0 ? goalColumn : 33554431 /* NoGoalColumn */) << 5 /* GoalColumnOffset */; + return head < anchor ? SelectionRange.create(head, anchor, 16 /* Inverted */ | goal | 8 /* AssocAfter */) + : SelectionRange.create(anchor, head, goal | (head > anchor ? 4 /* AssocBefore */ : 0)); + } + /** + @internal + */ + static normalized(ranges, mainIndex = 0) { + let main = ranges[mainIndex]; + ranges.sort((a, b) => a.from - b.from); + mainIndex = ranges.indexOf(main); + for (let i = 1; i < ranges.length; i++) { + let range = ranges[i], prev = ranges[i - 1]; + if (range.empty ? range.from <= prev.to : range.from < prev.to) { + let from = prev.from, to = Math.max(range.to, prev.to); + if (i <= mainIndex) + mainIndex--; + ranges.splice(--i, 2, range.anchor > range.head ? EditorSelection.range(to, from) : EditorSelection.range(from, to)); + } + } + return new EditorSelection(ranges, mainIndex); + } +} +function checkSelection(selection, docLength) { + for (let range of selection.ranges) + if (range.to > docLength) + throw new RangeError("Selection points outside of document"); +} + +let nextID = 0; +/** +A facet is a labeled value that is associated with an editor +state. It takes inputs from any number of extensions, and combines +those into a single output value. + +Examples of uses of facets are the [tab +size](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize), [editor +attributes](https://codemirror.net/6/docs/ref/#view.EditorView^editorAttributes), and [update +listeners](https://codemirror.net/6/docs/ref/#view.EditorView^updateListener). +*/ +class Facet { + constructor( + /** + @internal + */ + combine, + /** + @internal + */ + compareInput, + /** + @internal + */ + compare, isStatic, + /** + @internal + */ + extensions) { + this.combine = combine; + this.compareInput = compareInput; + this.compare = compare; + this.isStatic = isStatic; + this.extensions = extensions; + /** + @internal + */ + this.id = nextID++; + this.default = combine([]); + } + /** + Define a new facet. + */ + static define(config = {}) { + return new Facet(config.combine || ((a) => a), config.compareInput || ((a, b) => a === b), config.compare || (!config.combine ? sameArray : (a, b) => a === b), !!config.static, config.enables); + } + /** + Returns an extension that adds the given value to this facet. + */ + of(value) { + return new FacetProvider([], this, 0 /* Static */, value); + } + /** + Create an extension that computes a value for the facet from a + state. You must take care to declare the parts of the state that + this value depends on, since your function is only called again + for a new state when one of those parts changed. + + In cases where your value depends only on a single field, you'll + want to use the [`from`](https://codemirror.net/6/docs/ref/#state.Facet.from) method instead. + */ + compute(deps, get) { + if (this.isStatic) + throw new Error("Can't compute a static facet"); + return new FacetProvider(deps, this, 1 /* Single */, get); + } + /** + Create an extension that computes zero or more values for this + facet from a state. + */ + computeN(deps, get) { + if (this.isStatic) + throw new Error("Can't compute a static facet"); + return new FacetProvider(deps, this, 2 /* Multi */, get); + } + from(field, get) { + if (!get) + get = x => x; + return this.compute([field], state => get(state.field(field))); + } +} +function sameArray(a, b) { + return a == b || a.length == b.length && a.every((e, i) => e === b[i]); +} +class FacetProvider { + constructor(dependencies, facet, type, value) { + this.dependencies = dependencies; + this.facet = facet; + this.type = type; + this.value = value; + this.id = nextID++; + } + dynamicSlot(addresses) { + var _a; + let getter = this.value; + let compare = this.facet.compareInput; + let id = this.id, idx = addresses[id] >> 1, multi = this.type == 2 /* Multi */; + let depDoc = false, depSel = false, depAddrs = []; + for (let dep of this.dependencies) { + if (dep == "doc") + depDoc = true; + else if (dep == "selection") + depSel = true; + else if ((((_a = addresses[dep.id]) !== null && _a !== void 0 ? _a : 1) & 1) == 0) + depAddrs.push(addresses[dep.id]); + } + return { + create(state) { + state.values[idx] = getter(state); + return 1 /* Changed */; + }, + update(state, tr) { + if ((depDoc && tr.docChanged) || (depSel && (tr.docChanged || tr.selection)) || ensureAll(state, depAddrs)) { + let newVal = getter(state); + if (multi ? !compareArray(newVal, state.values[idx], compare) : !compare(newVal, state.values[idx])) { + state.values[idx] = newVal; + return 1 /* Changed */; + } + } + return 0; + }, + reconfigure: (state, oldState) => { + let newVal = getter(state); + let oldAddr = oldState.config.address[id]; + if (oldAddr != null) { + let oldVal = getAddr(oldState, oldAddr); + if (this.dependencies.every(dep => { + return dep instanceof Facet ? oldState.facet(dep) === state.facet(dep) : + dep instanceof StateField ? oldState.field(dep, false) == state.field(dep, false) : true; + }) || (multi ? compareArray(newVal, oldVal, compare) : compare(newVal, oldVal))) { + state.values[idx] = oldVal; + return 0; + } + } + state.values[idx] = newVal; + return 1 /* Changed */; + } + }; + } +} +function compareArray(a, b, compare) { + if (a.length != b.length) + return false; + for (let i = 0; i < a.length; i++) + if (!compare(a[i], b[i])) + return false; + return true; +} +function ensureAll(state, addrs) { + let changed = false; + for (let addr of addrs) + if (ensureAddr(state, addr) & 1 /* Changed */) + changed = true; + return changed; +} +function dynamicFacetSlot(addresses, facet, providers) { + let providerAddrs = providers.map(p => addresses[p.id]); + let providerTypes = providers.map(p => p.type); + let dynamic = providerAddrs.filter(p => !(p & 1)); + let idx = addresses[facet.id] >> 1; + function get(state) { + let values = []; + for (let i = 0; i < providerAddrs.length; i++) { + let value = getAddr(state, providerAddrs[i]); + if (providerTypes[i] == 2 /* Multi */) + for (let val of value) + values.push(val); + else + values.push(value); + } + return facet.combine(values); + } + return { + create(state) { + for (let addr of providerAddrs) + ensureAddr(state, addr); + state.values[idx] = get(state); + return 1 /* Changed */; + }, + update(state, tr) { + if (!ensureAll(state, dynamic)) + return 0; + let value = get(state); + if (facet.compare(value, state.values[idx])) + return 0; + state.values[idx] = value; + return 1 /* Changed */; + }, + reconfigure(state, oldState) { + let depChanged = ensureAll(state, providerAddrs); + let oldProviders = oldState.config.facets[facet.id], oldValue = oldState.facet(facet); + if (oldProviders && !depChanged && sameArray(providers, oldProviders)) { + state.values[idx] = oldValue; + return 0; + } + let value = get(state); + if (facet.compare(value, oldValue)) { + state.values[idx] = oldValue; + return 0; + } + state.values[idx] = value; + return 1 /* Changed */; + } + }; +} +const initField = Facet.define({ static: true }); +/** +Fields can store additional information in an editor state, and +keep it in sync with the rest of the state. +*/ +class StateField { + constructor( + /** + @internal + */ + id, createF, updateF, compareF, + /** + @internal + */ + spec) { + this.id = id; + this.createF = createF; + this.updateF = updateF; + this.compareF = compareF; + this.spec = spec; + /** + @internal + */ + this.provides = undefined; + } + /** + Define a state field. + */ + static define(config) { + let field = new StateField(nextID++, config.create, config.update, config.compare || ((a, b) => a === b), config); + if (config.provide) + field.provides = config.provide(field); + return field; + } + create(state) { + let init = state.facet(initField).find(i => i.field == this); + return ((init === null || init === void 0 ? void 0 : init.create) || this.createF)(state); + } + /** + @internal + */ + slot(addresses) { + let idx = addresses[this.id] >> 1; + return { + create: (state) => { + state.values[idx] = this.create(state); + return 1 /* Changed */; + }, + update: (state, tr) => { + let oldVal = state.values[idx]; + let value = this.updateF(oldVal, tr); + if (this.compareF(oldVal, value)) + return 0; + state.values[idx] = value; + return 1 /* Changed */; + }, + reconfigure: (state, oldState) => { + if (oldState.config.address[this.id] != null) { + state.values[idx] = oldState.field(this); + return 0; + } + state.values[idx] = this.create(state); + return 1 /* Changed */; + } + }; + } + /** + Returns an extension that enables this field and overrides the + way it is initialized. Can be useful when you need to provide a + non-default starting value for the field. + */ + init(create) { + return [this, initField.of({ field: this, create })]; + } + /** + State field instances can be used as + [`Extension`](https://codemirror.net/6/docs/ref/#state.Extension) values to enable the field in a + given state. + */ + get extension() { return this; } +} +const Prec_ = { lowest: 4, low: 3, default: 2, high: 1, highest: 0 }; +function prec(value) { + return (ext) => new PrecExtension(ext, value); +} +/** +By default extensions are registered in the order they are found +in the flattened form of nested array that was provided. +Individual extension values can be assigned a precedence to +override this. Extensions that do not have a precedence set get +the precedence of the nearest parent with a precedence, or +[`default`](https://codemirror.net/6/docs/ref/#state.Prec.default) if there is no such parent. The +final ordering of extensions is determined by first sorting by +precedence and then by order within each precedence. +*/ +const Prec = { + /** + The highest precedence level, for extensions that should end up + near the start of the precedence ordering. + */ + highest: prec(Prec_.highest), + /** + A higher-than-default precedence, for extensions that should + come before those with default precedence. + */ + high: prec(Prec_.high), + /** + The default precedence, which is also used for extensions + without an explicit precedence. + */ + default: prec(Prec_.default), + /** + A lower-than-default precedence. + */ + low: prec(Prec_.low), + /** + The lowest precedence level. Meant for things that should end up + near the end of the extension order. + */ + lowest: prec(Prec_.lowest) +}; +class PrecExtension { + constructor(inner, prec) { + this.inner = inner; + this.prec = prec; + } +} +/** +Extension compartments can be used to make a configuration +dynamic. By [wrapping](https://codemirror.net/6/docs/ref/#state.Compartment.of) part of your +configuration in a compartment, you can later +[replace](https://codemirror.net/6/docs/ref/#state.Compartment.reconfigure) that part through a +transaction. +*/ +class Compartment { + /** + Create an instance of this compartment to add to your [state + configuration](https://codemirror.net/6/docs/ref/#state.EditorStateConfig.extensions). + */ + of(ext) { return new CompartmentInstance(this, ext); } + /** + Create an [effect](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) that + reconfigures this compartment. + */ + reconfigure(content) { + return Compartment.reconfigure.of({ compartment: this, extension: content }); + } + /** + Get the current content of the compartment in the state, or + `undefined` if it isn't present. + */ + get(state) { + return state.config.compartments.get(this); + } +} +class CompartmentInstance { + constructor(compartment, inner) { + this.compartment = compartment; + this.inner = inner; + } +} +class Configuration { + constructor(base, compartments, dynamicSlots, address, staticValues, facets) { + this.base = base; + this.compartments = compartments; + this.dynamicSlots = dynamicSlots; + this.address = address; + this.staticValues = staticValues; + this.facets = facets; + this.statusTemplate = []; + while (this.statusTemplate.length < dynamicSlots.length) + this.statusTemplate.push(0 /* Unresolved */); + } + staticFacet(facet) { + let addr = this.address[facet.id]; + return addr == null ? facet.default : this.staticValues[addr >> 1]; + } + static resolve(base, compartments, oldState) { + let fields = []; + let facets = Object.create(null); + let newCompartments = new Map(); + for (let ext of flatten(base, compartments, newCompartments)) { + if (ext instanceof StateField) + fields.push(ext); + else + (facets[ext.facet.id] || (facets[ext.facet.id] = [])).push(ext); + } + let address = Object.create(null); + let staticValues = []; + let dynamicSlots = []; + for (let field of fields) { + address[field.id] = dynamicSlots.length << 1; + dynamicSlots.push(a => field.slot(a)); + } + let oldFacets = oldState === null || oldState === void 0 ? void 0 : oldState.config.facets; + for (let id in facets) { + let providers = facets[id], facet = providers[0].facet; + let oldProviders = oldFacets && oldFacets[id] || []; + if (providers.every(p => p.type == 0 /* Static */)) { + address[facet.id] = (staticValues.length << 1) | 1; + if (sameArray(oldProviders, providers)) { + staticValues.push(oldState.facet(facet)); + } + else { + let value = facet.combine(providers.map(p => p.value)); + staticValues.push(oldState && facet.compare(value, oldState.facet(facet)) ? oldState.facet(facet) : value); + } + } + else { + for (let p of providers) { + if (p.type == 0 /* Static */) { + address[p.id] = (staticValues.length << 1) | 1; + staticValues.push(p.value); + } + else { + address[p.id] = dynamicSlots.length << 1; + dynamicSlots.push(a => p.dynamicSlot(a)); + } + } + address[facet.id] = dynamicSlots.length << 1; + dynamicSlots.push(a => dynamicFacetSlot(a, facet, providers)); + } + } + let dynamic = dynamicSlots.map(f => f(address)); + return new Configuration(base, newCompartments, dynamic, address, staticValues, facets); + } +} +function flatten(extension, compartments, newCompartments) { + let result = [[], [], [], [], []]; + let seen = new Map(); + function inner(ext, prec) { + let known = seen.get(ext); + if (known != null) { + if (known <= prec) + return; + let found = result[known].indexOf(ext); + if (found > -1) + result[known].splice(found, 1); + if (ext instanceof CompartmentInstance) + newCompartments.delete(ext.compartment); + } + seen.set(ext, prec); + if (Array.isArray(ext)) { + for (let e of ext) + inner(e, prec); + } + else if (ext instanceof CompartmentInstance) { + if (newCompartments.has(ext.compartment)) + throw new RangeError(`Duplicate use of compartment in extensions`); + let content = compartments.get(ext.compartment) || ext.inner; + newCompartments.set(ext.compartment, content); + inner(content, prec); + } + else if (ext instanceof PrecExtension) { + inner(ext.inner, ext.prec); + } + else if (ext instanceof StateField) { + result[prec].push(ext); + if (ext.provides) + inner(ext.provides, prec); + } + else if (ext instanceof FacetProvider) { + result[prec].push(ext); + if (ext.facet.extensions) + inner(ext.facet.extensions, prec); + } + else { + let content = ext.extension; + if (!content) + throw new Error(`Unrecognized extension value in extension set (${ext}). This sometimes happens because multiple instances of @codemirror/state are loaded, breaking instanceof checks.`); + inner(content, prec); + } + } + inner(extension, Prec_.default); + return result.reduce((a, b) => a.concat(b)); +} +function ensureAddr(state, addr) { + if (addr & 1) + return 2 /* Computed */; + let idx = addr >> 1; + let status = state.status[idx]; + if (status == 4 /* Computing */) + throw new Error("Cyclic dependency between fields and/or facets"); + if (status & 2 /* Computed */) + return status; + state.status[idx] = 4 /* Computing */; + let changed = state.computeSlot(state, state.config.dynamicSlots[idx]); + return state.status[idx] = 2 /* Computed */ | changed; +} +function getAddr(state, addr) { + return addr & 1 ? state.config.staticValues[addr >> 1] : state.values[addr >> 1]; +} + +const languageData = Facet.define(); +const allowMultipleSelections = Facet.define({ + combine: values => values.some(v => v), + static: true +}); +const lineSeparator = Facet.define({ + combine: values => values.length ? values[0] : undefined, + static: true +}); +const changeFilter = Facet.define(); +const transactionFilter = Facet.define(); +const transactionExtender = Facet.define(); +const readOnly = Facet.define({ + combine: values => values.length ? values[0] : false +}); + +/** +Annotations are tagged values that are used to add metadata to +transactions in an extensible way. They should be used to model +things that effect the entire transaction (such as its [time +stamp](https://codemirror.net/6/docs/ref/#state.Transaction^time) or information about its +[origin](https://codemirror.net/6/docs/ref/#state.Transaction^userEvent)). For effects that happen +_alongside_ the other changes made by the transaction, [state +effects](https://codemirror.net/6/docs/ref/#state.StateEffect) are more appropriate. +*/ +class Annotation { + /** + @internal + */ + constructor( + /** + The annotation type. + */ + type, + /** + The value of this annotation. + */ + value) { + this.type = type; + this.value = value; + } + /** + Define a new type of annotation. + */ + static define() { return new AnnotationType(); } +} +/** +Marker that identifies a type of [annotation](https://codemirror.net/6/docs/ref/#state.Annotation). +*/ +class AnnotationType { + /** + Create an instance of this annotation. + */ + of(value) { return new Annotation(this, value); } +} +/** +Representation of a type of state effect. Defined with +[`StateEffect.define`](https://codemirror.net/6/docs/ref/#state.StateEffect^define). +*/ +class StateEffectType { + /** + @internal + */ + constructor( + // The `any` types in these function types are there to work + // around TypeScript issue #37631, where the type guard on + // `StateEffect.is` mysteriously stops working when these properly + // have type `Value`. + /** + @internal + */ + map) { + this.map = map; + } + /** + Create a [state effect](https://codemirror.net/6/docs/ref/#state.StateEffect) instance of this + type. + */ + of(value) { return new StateEffect(this, value); } +} +/** +State effects can be used to represent additional effects +associated with a [transaction](https://codemirror.net/6/docs/ref/#state.Transaction.effects). They +are often useful to model changes to custom [state +fields](https://codemirror.net/6/docs/ref/#state.StateField), when those changes aren't implicit in +document or selection changes. +*/ +class StateEffect { + /** + @internal + */ + constructor( + /** + @internal + */ + type, + /** + The value of this effect. + */ + value) { + this.type = type; + this.value = value; + } + /** + Map this effect through a position mapping. Will return + `undefined` when that ends up deleting the effect. + */ + map(mapping) { + let mapped = this.type.map(this.value, mapping); + return mapped === undefined ? undefined : mapped == this.value ? this : new StateEffect(this.type, mapped); + } + /** + Tells you whether this effect object is of a given + [type](https://codemirror.net/6/docs/ref/#state.StateEffectType). + */ + is(type) { return this.type == type; } + /** + Define a new effect type. The type parameter indicates the type + of values that his effect holds. + */ + static define(spec = {}) { + return new StateEffectType(spec.map || (v => v)); + } + /** + Map an array of effects through a change set. + */ + static mapEffects(effects, mapping) { + if (!effects.length) + return effects; + let result = []; + for (let effect of effects) { + let mapped = effect.map(mapping); + if (mapped) + result.push(mapped); + } + return result; + } +} +/** +This effect can be used to reconfigure the root extensions of +the editor. Doing this will discard any extensions +[appended](https://codemirror.net/6/docs/ref/#state.StateEffect^appendConfig), but does not reset +the content of [reconfigured](https://codemirror.net/6/docs/ref/#state.Compartment.reconfigure) +compartments. +*/ +StateEffect.reconfigure = StateEffect.define(); +/** +Append extensions to the top-level configuration of the editor. +*/ +StateEffect.appendConfig = StateEffect.define(); +/** +Changes to the editor state are grouped into transactions. +Typically, a user action creates a single transaction, which may +contain any number of document changes, may change the selection, +or have other effects. Create a transaction by calling +[`EditorState.update`](https://codemirror.net/6/docs/ref/#state.EditorState.update), or immediately +dispatch one by calling +[`EditorView.dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch). +*/ +class Transaction { + constructor( + /** + The state from which the transaction starts. + */ + startState, + /** + The document changes made by this transaction. + */ + changes, + /** + The selection set by this transaction, or undefined if it + doesn't explicitly set a selection. + */ + selection, + /** + The effects added to the transaction. + */ + effects, + /** + @internal + */ + annotations, + /** + Whether the selection should be scrolled into view after this + transaction is dispatched. + */ + scrollIntoView) { + this.startState = startState; + this.changes = changes; + this.selection = selection; + this.effects = effects; + this.annotations = annotations; + this.scrollIntoView = scrollIntoView; + /** + @internal + */ + this._doc = null; + /** + @internal + */ + this._state = null; + if (selection) + checkSelection(selection, changes.newLength); + if (!annotations.some((a) => a.type == Transaction.time)) + this.annotations = annotations.concat(Transaction.time.of(Date.now())); + } + /** + @internal + */ + static create(startState, changes, selection, effects, annotations, scrollIntoView) { + return new Transaction(startState, changes, selection, effects, annotations, scrollIntoView); + } + /** + The new document produced by the transaction. Contrary to + [`.state`](https://codemirror.net/6/docs/ref/#state.Transaction.state)`.doc`, accessing this won't + force the entire new state to be computed right away, so it is + recommended that [transaction + filters](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter) use this getter + when they need to look at the new document. + */ + get newDoc() { + return this._doc || (this._doc = this.changes.apply(this.startState.doc)); + } + /** + The new selection produced by the transaction. If + [`this.selection`](https://codemirror.net/6/docs/ref/#state.Transaction.selection) is undefined, + this will [map](https://codemirror.net/6/docs/ref/#state.EditorSelection.map) the start state's + current selection through the changes made by the transaction. + */ + get newSelection() { + return this.selection || this.startState.selection.map(this.changes); + } + /** + The new state created by the transaction. Computed on demand + (but retained for subsequent access), so it is recommended not to + access it in [transaction + filters](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter) when possible. + */ + get state() { + if (!this._state) + this.startState.applyTransaction(this); + return this._state; + } + /** + Get the value of the given annotation type, if any. + */ + annotation(type) { + for (let ann of this.annotations) + if (ann.type == type) + return ann.value; + return undefined; + } + /** + Indicates whether the transaction changed the document. + */ + get docChanged() { return !this.changes.empty; } + /** + Indicates whether this transaction reconfigures the state + (through a [configuration compartment](https://codemirror.net/6/docs/ref/#state.Compartment) or + with a top-level configuration + [effect](https://codemirror.net/6/docs/ref/#state.StateEffect^reconfigure). + */ + get reconfigured() { return this.startState.config != this.state.config; } + /** + Returns true if the transaction has a [user + event](https://codemirror.net/6/docs/ref/#state.Transaction^userEvent) annotation that is equal to + or more specific than `event`. For example, if the transaction + has `"select.pointer"` as user event, `"select"` and + `"select.pointer"` will match it. + */ + isUserEvent(event) { + let e = this.annotation(Transaction.userEvent); + return !!(e && (e == event || e.length > event.length && e.slice(0, event.length) == event && e[event.length] == ".")); + } +} +/** +Annotation used to store transaction timestamps. Automatically +added to every transaction, holding `Date.now()`. +*/ +Transaction.time = Annotation.define(); +/** +Annotation used to associate a transaction with a user interface +event. Holds a string identifying the event, using a +dot-separated format to support attaching more specific +information. The events used by the core libraries are: + + - `"input"` when content is entered + - `"input.type"` for typed input + - `"input.type.compose"` for composition + - `"input.paste"` for pasted input + - `"input.drop"` when adding content with drag-and-drop + - `"input.complete"` when autocompleting + - `"delete"` when the user deletes content + - `"delete.selection"` when deleting the selection + - `"delete.forward"` when deleting forward from the selection + - `"delete.backward"` when deleting backward from the selection + - `"delete.cut"` when cutting to the clipboard + - `"move"` when content is moved + - `"move.drop"` when content is moved within the editor through drag-and-drop + - `"select"` when explicitly changing the selection + - `"select.pointer"` when selecting with a mouse or other pointing device + - `"undo"` and `"redo"` for history actions + +Use [`isUserEvent`](https://codemirror.net/6/docs/ref/#state.Transaction.isUserEvent) to check +whether the annotation matches a given event. +*/ +Transaction.userEvent = Annotation.define(); +/** +Annotation indicating whether a transaction should be added to +the undo history or not. +*/ +Transaction.addToHistory = Annotation.define(); +/** +Annotation indicating (when present and true) that a transaction +represents a change made by some other actor, not the user. This +is used, for example, to tag other people's changes in +collaborative editing. +*/ +Transaction.remote = Annotation.define(); +function joinRanges(a, b) { + let result = []; + for (let iA = 0, iB = 0;;) { + let from, to; + if (iA < a.length && (iB == b.length || b[iB] >= a[iA])) { + from = a[iA++]; + to = a[iA++]; + } + else if (iB < b.length) { + from = b[iB++]; + to = b[iB++]; + } + else + return result; + if (!result.length || result[result.length - 1] < from) + result.push(from, to); + else if (result[result.length - 1] < to) + result[result.length - 1] = to; + } +} +function mergeTransaction(a, b, sequential) { + var _a; + let mapForA, mapForB, changes; + if (sequential) { + mapForA = b.changes; + mapForB = ChangeSet.empty(b.changes.length); + changes = a.changes.compose(b.changes); + } + else { + mapForA = b.changes.map(a.changes); + mapForB = a.changes.mapDesc(b.changes, true); + changes = a.changes.compose(mapForA); + } + return { + changes, + selection: b.selection ? b.selection.map(mapForB) : (_a = a.selection) === null || _a === void 0 ? void 0 : _a.map(mapForA), + effects: StateEffect.mapEffects(a.effects, mapForA).concat(StateEffect.mapEffects(b.effects, mapForB)), + annotations: a.annotations.length ? a.annotations.concat(b.annotations) : b.annotations, + scrollIntoView: a.scrollIntoView || b.scrollIntoView + }; +} +function resolveTransactionInner(state, spec, docSize) { + let sel = spec.selection, annotations = asArray(spec.annotations); + if (spec.userEvent) + annotations = annotations.concat(Transaction.userEvent.of(spec.userEvent)); + return { + changes: spec.changes instanceof ChangeSet ? spec.changes + : ChangeSet.of(spec.changes || [], docSize, state.facet(lineSeparator)), + selection: sel && (sel instanceof EditorSelection ? sel : EditorSelection.single(sel.anchor, sel.head)), + effects: asArray(spec.effects), + annotations, + scrollIntoView: !!spec.scrollIntoView + }; +} +function resolveTransaction(state, specs, filter) { + let s = resolveTransactionInner(state, specs.length ? specs[0] : {}, state.doc.length); + if (specs.length && specs[0].filter === false) + filter = false; + for (let i = 1; i < specs.length; i++) { + if (specs[i].filter === false) + filter = false; + let seq = !!specs[i].sequential; + s = mergeTransaction(s, resolveTransactionInner(state, specs[i], seq ? s.changes.newLength : state.doc.length), seq); + } + let tr = Transaction.create(state, s.changes, s.selection, s.effects, s.annotations, s.scrollIntoView); + return extendTransaction(filter ? filterTransaction(tr) : tr); +} +// Finish a transaction by applying filters if necessary. +function filterTransaction(tr) { + let state = tr.startState; + // Change filters + let result = true; + for (let filter of state.facet(changeFilter)) { + let value = filter(tr); + if (value === false) { + result = false; + break; + } + if (Array.isArray(value)) + result = result === true ? value : joinRanges(result, value); + } + if (result !== true) { + let changes, back; + if (result === false) { + back = tr.changes.invertedDesc; + changes = ChangeSet.empty(state.doc.length); + } + else { + let filtered = tr.changes.filter(result); + changes = filtered.changes; + back = filtered.filtered.invertedDesc; + } + tr = Transaction.create(state, changes, tr.selection && tr.selection.map(back), StateEffect.mapEffects(tr.effects, back), tr.annotations, tr.scrollIntoView); + } + // Transaction filters + let filters = state.facet(transactionFilter); + for (let i = filters.length - 1; i >= 0; i--) { + let filtered = filters[i](tr); + if (filtered instanceof Transaction) + tr = filtered; + else if (Array.isArray(filtered) && filtered.length == 1 && filtered[0] instanceof Transaction) + tr = filtered[0]; + else + tr = resolveTransaction(state, asArray(filtered), false); + } + return tr; +} +function extendTransaction(tr) { + let state = tr.startState, extenders = state.facet(transactionExtender), spec = tr; + for (let i = extenders.length - 1; i >= 0; i--) { + let extension = extenders[i](tr); + if (extension && Object.keys(extension).length) + spec = mergeTransaction(tr, resolveTransactionInner(state, extension, tr.changes.newLength), true); + } + return spec == tr ? tr : Transaction.create(state, tr.changes, tr.selection, spec.effects, spec.annotations, spec.scrollIntoView); +} +const none = []; +function asArray(value) { + return value == null ? none : Array.isArray(value) ? value : [value]; +} + +/** +The categories produced by a [character +categorizer](https://codemirror.net/6/docs/ref/#state.EditorState.charCategorizer). These are used +do things like selecting by word. +*/ +exports.CharCategory = void 0; +(function (CharCategory) { + /** + Word characters. + */ + CharCategory[CharCategory["Word"] = 0] = "Word"; + /** + Whitespace. + */ + CharCategory[CharCategory["Space"] = 1] = "Space"; + /** + Anything else. + */ + CharCategory[CharCategory["Other"] = 2] = "Other"; +})(exports.CharCategory || (exports.CharCategory = {})); +const nonASCIISingleCaseWordChar = /[\u00df\u0587\u0590-\u05f4\u0600-\u06ff\u3040-\u309f\u30a0-\u30ff\u3400-\u4db5\u4e00-\u9fcc\uac00-\ud7af]/; +let wordChar; +try { + wordChar = new RegExp("[\\p{Alphabetic}\\p{Number}_]", "u"); +} +catch (_) { } +function hasWordChar(str) { + if (wordChar) + return wordChar.test(str); + for (let i = 0; i < str.length; i++) { + let ch = str[i]; + if (/\w/.test(ch) || ch > "\x80" && (ch.toUpperCase() != ch.toLowerCase() || nonASCIISingleCaseWordChar.test(ch))) + return true; + } + return false; +} +function makeCategorizer(wordChars) { + return (char) => { + if (!/\S/.test(char)) + return exports.CharCategory.Space; + if (hasWordChar(char)) + return exports.CharCategory.Word; + for (let i = 0; i < wordChars.length; i++) + if (char.indexOf(wordChars[i]) > -1) + return exports.CharCategory.Word; + return exports.CharCategory.Other; + }; +} + +/** +The editor state class is a persistent (immutable) data structure. +To update a state, you [create](https://codemirror.net/6/docs/ref/#state.EditorState.update) a +[transaction](https://codemirror.net/6/docs/ref/#state.Transaction), which produces a _new_ state +instance, without modifying the original object. + +As such, _never_ mutate properties of a state directly. That'll +just break things. +*/ +class EditorState { + constructor( + /** + @internal + */ + config, + /** + The current document. + */ + doc, + /** + The current selection. + */ + selection, + /** + @internal + */ + values, computeSlot, tr) { + this.config = config; + this.doc = doc; + this.selection = selection; + this.values = values; + this.status = config.statusTemplate.slice(); + this.computeSlot = computeSlot; + // Fill in the computed state immediately, so that further queries + // for it made during the update return this state + if (tr) + tr._state = this; + for (let i = 0; i < this.config.dynamicSlots.length; i++) + ensureAddr(this, i << 1); + this.computeSlot = null; + } + field(field, require = true) { + let addr = this.config.address[field.id]; + if (addr == null) { + if (require) + throw new RangeError("Field is not present in this state"); + return undefined; + } + ensureAddr(this, addr); + return getAddr(this, addr); + } + /** + Create a [transaction](https://codemirror.net/6/docs/ref/#state.Transaction) that updates this + state. Any number of [transaction specs](https://codemirror.net/6/docs/ref/#state.TransactionSpec) + can be passed. Unless + [`sequential`](https://codemirror.net/6/docs/ref/#state.TransactionSpec.sequential) is set, the + [changes](https://codemirror.net/6/docs/ref/#state.TransactionSpec.changes) (if any) of each spec + are assumed to start in the _current_ document (not the document + produced by previous specs), and its + [selection](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection) and + [effects](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) are assumed to refer + to the document created by its _own_ changes. The resulting + transaction contains the combined effect of all the different + specs. For [selection](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection), later + specs take precedence over earlier ones. + */ + update(...specs) { + return resolveTransaction(this, specs, true); + } + /** + @internal + */ + applyTransaction(tr) { + let conf = this.config, { base, compartments } = conf; + for (let effect of tr.effects) { + if (effect.is(Compartment.reconfigure)) { + if (conf) { + compartments = new Map; + conf.compartments.forEach((val, key) => compartments.set(key, val)); + conf = null; + } + compartments.set(effect.value.compartment, effect.value.extension); + } + else if (effect.is(StateEffect.reconfigure)) { + conf = null; + base = effect.value; + } + else if (effect.is(StateEffect.appendConfig)) { + conf = null; + base = asArray(base).concat(effect.value); + } + } + let startValues; + if (!conf) { + conf = Configuration.resolve(base, compartments, this); + let intermediateState = new EditorState(conf, this.doc, this.selection, conf.dynamicSlots.map(() => null), (state, slot) => slot.reconfigure(state, this), null); + startValues = intermediateState.values; + } + else { + startValues = tr.startState.values.slice(); + } + new EditorState(conf, tr.newDoc, tr.newSelection, startValues, (state, slot) => slot.update(state, tr), tr); + } + /** + Create a [transaction spec](https://codemirror.net/6/docs/ref/#state.TransactionSpec) that + replaces every selection range with the given content. + */ + replaceSelection(text) { + if (typeof text == "string") + text = this.toText(text); + return this.changeByRange(range => ({ changes: { from: range.from, to: range.to, insert: text }, + range: EditorSelection.cursor(range.from + text.length) })); + } + /** + Create a set of changes and a new selection by running the given + function for each range in the active selection. The function + can return an optional set of changes (in the coordinate space + of the start document), plus an updated range (in the coordinate + space of the document produced by the call's own changes). This + method will merge all the changes and ranges into a single + changeset and selection, and return it as a [transaction + spec](https://codemirror.net/6/docs/ref/#state.TransactionSpec), which can be passed to + [`update`](https://codemirror.net/6/docs/ref/#state.EditorState.update). + */ + changeByRange(f) { + let sel = this.selection; + let result1 = f(sel.ranges[0]); + let changes = this.changes(result1.changes), ranges = [result1.range]; + let effects = asArray(result1.effects); + for (let i = 1; i < sel.ranges.length; i++) { + let result = f(sel.ranges[i]); + let newChanges = this.changes(result.changes), newMapped = newChanges.map(changes); + for (let j = 0; j < i; j++) + ranges[j] = ranges[j].map(newMapped); + let mapBy = changes.mapDesc(newChanges, true); + ranges.push(result.range.map(mapBy)); + changes = changes.compose(newMapped); + effects = StateEffect.mapEffects(effects, newMapped).concat(StateEffect.mapEffects(asArray(result.effects), mapBy)); + } + return { + changes, + selection: EditorSelection.create(ranges, sel.mainIndex), + effects + }; + } + /** + Create a [change set](https://codemirror.net/6/docs/ref/#state.ChangeSet) from the given change + description, taking the state's document length and line + separator into account. + */ + changes(spec = []) { + if (spec instanceof ChangeSet) + return spec; + return ChangeSet.of(spec, this.doc.length, this.facet(EditorState.lineSeparator)); + } + /** + Using the state's [line + separator](https://codemirror.net/6/docs/ref/#state.EditorState^lineSeparator), create a + [`Text`](https://codemirror.net/6/docs/ref/#state.Text) instance from the given string. + */ + toText(string) { + return Text.of(string.split(this.facet(EditorState.lineSeparator) || DefaultSplit)); + } + /** + Return the given range of the document as a string. + */ + sliceDoc(from = 0, to = this.doc.length) { + return this.doc.sliceString(from, to, this.lineBreak); + } + /** + Get the value of a state [facet](https://codemirror.net/6/docs/ref/#state.Facet). + */ + facet(facet) { + let addr = this.config.address[facet.id]; + if (addr == null) + return facet.default; + ensureAddr(this, addr); + return getAddr(this, addr); + } + /** + Convert this state to a JSON-serializable object. When custom + fields should be serialized, you can pass them in as an object + mapping property names (in the resulting object, which should + not use `doc` or `selection`) to fields. + */ + toJSON(fields) { + let result = { + doc: this.sliceDoc(), + selection: this.selection.toJSON() + }; + if (fields) + for (let prop in fields) { + let value = fields[prop]; + if (value instanceof StateField) + result[prop] = value.spec.toJSON(this.field(fields[prop]), this); + } + return result; + } + /** + Deserialize a state from its JSON representation. When custom + fields should be deserialized, pass the same object you passed + to [`toJSON`](https://codemirror.net/6/docs/ref/#state.EditorState.toJSON) when serializing as + third argument. + */ + static fromJSON(json, config = {}, fields) { + if (!json || typeof json.doc != "string") + throw new RangeError("Invalid JSON representation for EditorState"); + let fieldInit = []; + if (fields) + for (let prop in fields) { + let field = fields[prop], value = json[prop]; + fieldInit.push(field.init(state => field.spec.fromJSON(value, state))); + } + return EditorState.create({ + doc: json.doc, + selection: EditorSelection.fromJSON(json.selection), + extensions: config.extensions ? fieldInit.concat([config.extensions]) : fieldInit + }); + } + /** + Create a new state. You'll usually only need this when + initializing an editor—updated states are created by applying + transactions. + */ + static create(config = {}) { + let configuration = Configuration.resolve(config.extensions || [], new Map); + let doc = config.doc instanceof Text ? config.doc + : Text.of((config.doc || "").split(configuration.staticFacet(EditorState.lineSeparator) || DefaultSplit)); + let selection = !config.selection ? EditorSelection.single(0) + : config.selection instanceof EditorSelection ? config.selection + : EditorSelection.single(config.selection.anchor, config.selection.head); + checkSelection(selection, doc.length); + if (!configuration.staticFacet(allowMultipleSelections)) + selection = selection.asSingle(); + return new EditorState(configuration, doc, selection, configuration.dynamicSlots.map(() => null), (state, slot) => slot.create(state), null); + } + /** + The size (in columns) of a tab in the document, determined by + the [`tabSize`](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize) facet. + */ + get tabSize() { return this.facet(EditorState.tabSize); } + /** + Get the proper [line-break](https://codemirror.net/6/docs/ref/#state.EditorState^lineSeparator) + string for this state. + */ + get lineBreak() { return this.facet(EditorState.lineSeparator) || "\n"; } + /** + Returns true when the editor is + [configured](https://codemirror.net/6/docs/ref/#state.EditorState^readOnly) to be read-only. + */ + get readOnly() { return this.facet(readOnly); } + /** + Look up a translation for the given phrase (via the + [`phrases`](https://codemirror.net/6/docs/ref/#state.EditorState^phrases) facet), or return the + original string if no translation is found. + + If additional arguments are passed, they will be inserted in + place of markers like `$1` (for the first value) and `$2`, etc. + A single `$` is equivalent to `$1`, and `$$` will produce a + literal dollar sign. + */ + phrase(phrase, ...insert) { + for (let map of this.facet(EditorState.phrases)) + if (Object.prototype.hasOwnProperty.call(map, phrase)) { + phrase = map[phrase]; + break; + } + if (insert.length) + phrase = phrase.replace(/\$(\$|\d*)/g, (m, i) => { + if (i == "$") + return "$"; + let n = +(i || 1); + return n > insert.length ? m : insert[n - 1]; + }); + return phrase; + } + /** + Find the values for a given language data field, provided by the + the [`languageData`](https://codemirror.net/6/docs/ref/#state.EditorState^languageData) facet. + */ + languageDataAt(name, pos, side = -1) { + let values = []; + for (let provider of this.facet(languageData)) { + for (let result of provider(this, pos, side)) { + if (Object.prototype.hasOwnProperty.call(result, name)) + values.push(result[name]); + } + } + return values; + } + /** + Return a function that can categorize strings (expected to + represent a single [grapheme cluster](https://codemirror.net/6/docs/ref/#state.findClusterBreak)) + into one of: + + - Word (contains an alphanumeric character or a character + explicitly listed in the local language's `"wordChars"` + language data, which should be a string) + - Space (contains only whitespace) + - Other (anything else) + */ + charCategorizer(at) { + return makeCategorizer(this.languageDataAt("wordChars", at).join("")); + } + /** + Find the word at the given position, meaning the range + containing all [word](https://codemirror.net/6/docs/ref/#state.CharCategory.Word) characters + around it. If no word characters are adjacent to the position, + this returns null. + */ + wordAt(pos) { + let { text, from, length } = this.doc.lineAt(pos); + let cat = this.charCategorizer(pos); + let start = pos - from, end = pos - from; + while (start > 0) { + let prev = findClusterBreak(text, start, false); + if (cat(text.slice(prev, start)) != exports.CharCategory.Word) + break; + start = prev; + } + while (end < length) { + let next = findClusterBreak(text, end); + if (cat(text.slice(end, next)) != exports.CharCategory.Word) + break; + end = next; + } + return start == end ? null : EditorSelection.range(start + from, end + from); + } +} +/** +A facet that, when enabled, causes the editor to allow multiple +ranges to be selected. Be careful though, because by default the +editor relies on the native DOM selection, which cannot handle +multiple selections. An extension like +[`drawSelection`](https://codemirror.net/6/docs/ref/#view.drawSelection) can be used to make +secondary selections visible to the user. +*/ +EditorState.allowMultipleSelections = allowMultipleSelections; +/** +Configures the tab size to use in this state. The first +(highest-precedence) value of the facet is used. If no value is +given, this defaults to 4. +*/ +EditorState.tabSize = Facet.define({ + combine: values => values.length ? values[0] : 4 +}); +/** +The line separator to use. By default, any of `"\n"`, `"\r\n"` +and `"\r"` is treated as a separator when splitting lines, and +lines are joined with `"\n"`. + +When you configure a value here, only that precise separator +will be used, allowing you to round-trip documents through the +editor without normalizing line separators. +*/ +EditorState.lineSeparator = lineSeparator; +/** +This facet controls the value of the +[`readOnly`](https://codemirror.net/6/docs/ref/#state.EditorState.readOnly) getter, which is +consulted by commands and extensions that implement editing +functionality to determine whether they should apply. It +defaults to false, but when its highest-precedence value is +`true`, such functionality disables itself. + +Not to be confused with +[`EditorView.editable`](https://codemirror.net/6/docs/ref/#view.EditorView^editable), which +controls whether the editor's DOM is set to be editable (and +thus focusable). +*/ +EditorState.readOnly = readOnly; +/** +Registers translation phrases. The +[`phrase`](https://codemirror.net/6/docs/ref/#state.EditorState.phrase) method will look through +all objects registered with this facet to find translations for +its argument. +*/ +EditorState.phrases = Facet.define({ + compare(a, b) { + let kA = Object.keys(a), kB = Object.keys(b); + return kA.length == kB.length && kA.every(k => a[k] == b[k]); + } +}); +/** +A facet used to register [language +data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) providers. +*/ +EditorState.languageData = languageData; +/** +Facet used to register change filters, which are called for each +transaction (unless explicitly +[disabled](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter)), and can suppress +part of the transaction's changes. + +Such a function can return `true` to indicate that it doesn't +want to do anything, `false` to completely stop the changes in +the transaction, or a set of ranges in which changes should be +suppressed. Such ranges are represented as an array of numbers, +with each pair of two numbers indicating the start and end of a +range. So for example `[10, 20, 100, 110]` suppresses changes +between 10 and 20, and between 100 and 110. +*/ +EditorState.changeFilter = changeFilter; +/** +Facet used to register a hook that gets a chance to update or +replace transaction specs before they are applied. This will +only be applied for transactions that don't have +[`filter`](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter) set to `false`. You +can either return a single transaction spec (possibly the input +transaction), or an array of specs (which will be combined in +the same way as the arguments to +[`EditorState.update`](https://codemirror.net/6/docs/ref/#state.EditorState.update)). + +When possible, it is recommended to avoid accessing +[`Transaction.state`](https://codemirror.net/6/docs/ref/#state.Transaction.state) in a filter, +since it will force creation of a state that will then be +discarded again, if the transaction is actually filtered. + +(This functionality should be used with care. Indiscriminately +modifying transaction is likely to break something or degrade +the user experience.) +*/ +EditorState.transactionFilter = transactionFilter; +/** +This is a more limited form of +[`transactionFilter`](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter), +which can only add +[annotations](https://codemirror.net/6/docs/ref/#state.TransactionSpec.annotations) and +[effects](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects). _But_, this type +of filter runs even if the transaction has disabled regular +[filtering](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter), making it suitable +for effects that don't need to touch the changes or selection, +but do want to process every transaction. + +Extenders run _after_ filters, when both are present. +*/ +EditorState.transactionExtender = transactionExtender; +Compartment.reconfigure = StateEffect.define(); + +/** +Utility function for combining behaviors to fill in a config +object from an array of provided configs. `defaults` should hold +default values for all optional fields in `Config`. + +The function will, by default, error +when a field gets two values that aren't `===`-equal, but you can +provide combine functions per field to do something else. +*/ +function combineConfig(configs, defaults, // Should hold only the optional properties of Config, but I haven't managed to express that +combine = {}) { + let result = {}; + for (let config of configs) + for (let key of Object.keys(config)) { + let value = config[key], current = result[key]; + if (current === undefined) + result[key] = value; + else if (current === value || value === undefined) ; // No conflict + else if (Object.hasOwnProperty.call(combine, key)) + result[key] = combine[key](current, value); + else + throw new Error("Config merge conflict for field " + key); + } + for (let key in defaults) + if (result[key] === undefined) + result[key] = defaults[key]; + return result; +} + +/** +Each range is associated with a value, which must inherit from +this class. +*/ +class RangeValue { + /** + Compare this value with another value. Used when comparing + rangesets. The default implementation compares by identity. + Unless you are only creating a fixed number of unique instances + of your value type, it is a good idea to implement this + properly. + */ + eq(other) { return this == other; } + /** + Create a [range](https://codemirror.net/6/docs/ref/#state.Range) with this value. + */ + range(from, to = from) { return Range.create(from, to, this); } +} +RangeValue.prototype.startSide = RangeValue.prototype.endSide = 0; +RangeValue.prototype.point = false; +RangeValue.prototype.mapMode = exports.MapMode.TrackDel; +/** +A range associates a value with a range of positions. +*/ +class Range { + constructor( + /** + The range's start position. + */ + from, + /** + Its end position. + */ + to, + /** + The value associated with this range. + */ + value) { + this.from = from; + this.to = to; + this.value = value; + } + /** + @internal + */ + static create(from, to, value) { + return new Range(from, to, value); + } +} +function cmpRange(a, b) { + return a.from - b.from || a.value.startSide - b.value.startSide; +} +class Chunk { + constructor(from, to, value, + // Chunks are marked with the largest point that occurs + // in them (or -1 for no points), so that scans that are + // only interested in points (such as the + // heightmap-related logic) can skip range-only chunks. + maxPoint) { + this.from = from; + this.to = to; + this.value = value; + this.maxPoint = maxPoint; + } + get length() { return this.to[this.to.length - 1]; } + // Find the index of the given position and side. Use the ranges' + // `from` pos when `end == false`, `to` when `end == true`. + findIndex(pos, side, end, startAt = 0) { + let arr = end ? this.to : this.from; + for (let lo = startAt, hi = arr.length;;) { + if (lo == hi) + return lo; + let mid = (lo + hi) >> 1; + let diff = arr[mid] - pos || (end ? this.value[mid].endSide : this.value[mid].startSide) - side; + if (mid == lo) + return diff >= 0 ? lo : hi; + if (diff >= 0) + hi = mid; + else + lo = mid + 1; + } + } + between(offset, from, to, f) { + for (let i = this.findIndex(from, -1000000000 /* Far */, true), e = this.findIndex(to, 1000000000 /* Far */, false, i); i < e; i++) + if (f(this.from[i] + offset, this.to[i] + offset, this.value[i]) === false) + return false; + } + map(offset, changes) { + let value = [], from = [], to = [], newPos = -1, maxPoint = -1; + for (let i = 0; i < this.value.length; i++) { + let val = this.value[i], curFrom = this.from[i] + offset, curTo = this.to[i] + offset, newFrom, newTo; + if (curFrom == curTo) { + let mapped = changes.mapPos(curFrom, val.startSide, val.mapMode); + if (mapped == null) + continue; + newFrom = newTo = mapped; + if (val.startSide != val.endSide) { + newTo = changes.mapPos(curFrom, val.endSide); + if (newTo < newFrom) + continue; + } + } + else { + newFrom = changes.mapPos(curFrom, val.startSide); + newTo = changes.mapPos(curTo, val.endSide); + if (newFrom > newTo || newFrom == newTo && val.startSide > 0 && val.endSide <= 0) + continue; + } + if ((newTo - newFrom || val.endSide - val.startSide) < 0) + continue; + if (newPos < 0) + newPos = newFrom; + if (val.point) + maxPoint = Math.max(maxPoint, newTo - newFrom); + value.push(val); + from.push(newFrom - newPos); + to.push(newTo - newPos); + } + return { mapped: value.length ? new Chunk(from, to, value, maxPoint) : null, pos: newPos }; + } +} +/** +A range set stores a collection of [ranges](https://codemirror.net/6/docs/ref/#state.Range) in a +way that makes them efficient to [map](https://codemirror.net/6/docs/ref/#state.RangeSet.map) and +[update](https://codemirror.net/6/docs/ref/#state.RangeSet.update). This is an immutable data +structure. +*/ +class RangeSet { + constructor( + /** + @internal + */ + chunkPos, + /** + @internal + */ + chunk, + /** + @internal + */ + nextLayer, + /** + @internal + */ + maxPoint) { + this.chunkPos = chunkPos; + this.chunk = chunk; + this.nextLayer = nextLayer; + this.maxPoint = maxPoint; + } + /** + @internal + */ + static create(chunkPos, chunk, nextLayer, maxPoint) { + return new RangeSet(chunkPos, chunk, nextLayer, maxPoint); + } + /** + @internal + */ + get length() { + let last = this.chunk.length - 1; + return last < 0 ? 0 : Math.max(this.chunkEnd(last), this.nextLayer.length); + } + /** + The number of ranges in the set. + */ + get size() { + if (this.isEmpty) + return 0; + let size = this.nextLayer.size; + for (let chunk of this.chunk) + size += chunk.value.length; + return size; + } + /** + @internal + */ + chunkEnd(index) { + return this.chunkPos[index] + this.chunk[index].length; + } + /** + Update the range set, optionally adding new ranges or filtering + out existing ones. + + (Note: The type parameter is just there as a kludge to work + around TypeScript variance issues that prevented `RangeSet` + from being a subtype of `RangeSet` when `X` is a subtype of + `Y`.) + */ + update(updateSpec) { + let { add = [], sort = false, filterFrom = 0, filterTo = this.length } = updateSpec; + let filter = updateSpec.filter; + if (add.length == 0 && !filter) + return this; + if (sort) + add = add.slice().sort(cmpRange); + if (this.isEmpty) + return add.length ? RangeSet.of(add) : this; + let cur = new LayerCursor(this, null, -1).goto(0), i = 0, spill = []; + let builder = new RangeSetBuilder(); + while (cur.value || i < add.length) { + if (i < add.length && (cur.from - add[i].from || cur.startSide - add[i].value.startSide) >= 0) { + let range = add[i++]; + if (!builder.addInner(range.from, range.to, range.value)) + spill.push(range); + } + else if (cur.rangeIndex == 1 && cur.chunkIndex < this.chunk.length && + (i == add.length || this.chunkEnd(cur.chunkIndex) < add[i].from) && + (!filter || filterFrom > this.chunkEnd(cur.chunkIndex) || filterTo < this.chunkPos[cur.chunkIndex]) && + builder.addChunk(this.chunkPos[cur.chunkIndex], this.chunk[cur.chunkIndex])) { + cur.nextChunk(); + } + else { + if (!filter || filterFrom > cur.to || filterTo < cur.from || filter(cur.from, cur.to, cur.value)) { + if (!builder.addInner(cur.from, cur.to, cur.value)) + spill.push(Range.create(cur.from, cur.to, cur.value)); + } + cur.next(); + } + } + return builder.finishInner(this.nextLayer.isEmpty && !spill.length ? RangeSet.empty + : this.nextLayer.update({ add: spill, filter, filterFrom, filterTo })); + } + /** + Map this range set through a set of changes, return the new set. + */ + map(changes) { + if (changes.empty || this.isEmpty) + return this; + let chunks = [], chunkPos = [], maxPoint = -1; + for (let i = 0; i < this.chunk.length; i++) { + let start = this.chunkPos[i], chunk = this.chunk[i]; + let touch = changes.touchesRange(start, start + chunk.length); + if (touch === false) { + maxPoint = Math.max(maxPoint, chunk.maxPoint); + chunks.push(chunk); + chunkPos.push(changes.mapPos(start)); + } + else if (touch === true) { + let { mapped, pos } = chunk.map(start, changes); + if (mapped) { + maxPoint = Math.max(maxPoint, mapped.maxPoint); + chunks.push(mapped); + chunkPos.push(pos); + } + } + } + let next = this.nextLayer.map(changes); + return chunks.length == 0 ? next : new RangeSet(chunkPos, chunks, next || RangeSet.empty, maxPoint); + } + /** + Iterate over the ranges that touch the region `from` to `to`, + calling `f` for each. There is no guarantee that the ranges will + be reported in any specific order. When the callback returns + `false`, iteration stops. + */ + between(from, to, f) { + if (this.isEmpty) + return; + for (let i = 0; i < this.chunk.length; i++) { + let start = this.chunkPos[i], chunk = this.chunk[i]; + if (to >= start && from <= start + chunk.length && + chunk.between(start, from - start, to - start, f) === false) + return; + } + this.nextLayer.between(from, to, f); + } + /** + Iterate over the ranges in this set, in order, including all + ranges that end at or after `from`. + */ + iter(from = 0) { + return HeapCursor.from([this]).goto(from); + } + /** + @internal + */ + get isEmpty() { return this.nextLayer == this; } + /** + Iterate over the ranges in a collection of sets, in order, + starting from `from`. + */ + static iter(sets, from = 0) { + return HeapCursor.from(sets).goto(from); + } + /** + Iterate over two groups of sets, calling methods on `comparator` + to notify it of possible differences. + */ + static compare(oldSets, newSets, + /** + This indicates how the underlying data changed between these + ranges, and is needed to synchronize the iteration. `from` and + `to` are coordinates in the _new_ space, after these changes. + */ + textDiff, comparator, + /** + Can be used to ignore all non-point ranges, and points below + the given size. When -1, all ranges are compared. + */ + minPointSize = -1) { + let a = oldSets.filter(set => set.maxPoint > 0 || !set.isEmpty && set.maxPoint >= minPointSize); + let b = newSets.filter(set => set.maxPoint > 0 || !set.isEmpty && set.maxPoint >= minPointSize); + let sharedChunks = findSharedChunks(a, b, textDiff); + let sideA = new SpanCursor(a, sharedChunks, minPointSize); + let sideB = new SpanCursor(b, sharedChunks, minPointSize); + textDiff.iterGaps((fromA, fromB, length) => compare(sideA, fromA, sideB, fromB, length, comparator)); + if (textDiff.empty && textDiff.length == 0) + compare(sideA, 0, sideB, 0, 0, comparator); + } + /** + Compare the contents of two groups of range sets, returning true + if they are equivalent in the given range. + */ + static eq(oldSets, newSets, from = 0, to) { + if (to == null) + to = 1000000000 /* Far */; + let a = oldSets.filter(set => !set.isEmpty && newSets.indexOf(set) < 0); + let b = newSets.filter(set => !set.isEmpty && oldSets.indexOf(set) < 0); + if (a.length != b.length) + return false; + if (!a.length) + return true; + let sharedChunks = findSharedChunks(a, b); + let sideA = new SpanCursor(a, sharedChunks, 0).goto(from), sideB = new SpanCursor(b, sharedChunks, 0).goto(from); + for (;;) { + if (sideA.to != sideB.to || + !sameValues(sideA.active, sideB.active) || + sideA.point && (!sideB.point || !sideA.point.eq(sideB.point))) + return false; + if (sideA.to > to) + return true; + sideA.next(); + sideB.next(); + } + } + /** + Iterate over a group of range sets at the same time, notifying + the iterator about the ranges covering every given piece of + content. Returns the open count (see + [`SpanIterator.span`](https://codemirror.net/6/docs/ref/#state.SpanIterator.span)) at the end + of the iteration. + */ + static spans(sets, from, to, iterator, + /** + When given and greater than -1, only points of at least this + size are taken into account. + */ + minPointSize = -1) { + let cursor = new SpanCursor(sets, null, minPointSize).goto(from), pos = from; + let open = cursor.openStart; + for (;;) { + let curTo = Math.min(cursor.to, to); + if (cursor.point) { + iterator.point(pos, curTo, cursor.point, cursor.activeForPoint(cursor.to), open, cursor.pointRank); + open = cursor.openEnd(curTo) + (cursor.to > curTo ? 1 : 0); + } + else if (curTo > pos) { + iterator.span(pos, curTo, cursor.active, open); + open = cursor.openEnd(curTo); + } + if (cursor.to > to) + break; + pos = cursor.to; + cursor.next(); + } + return open; + } + /** + Create a range set for the given range or array of ranges. By + default, this expects the ranges to be _sorted_ (by start + position and, if two start at the same position, + `value.startSide`). You can pass `true` as second argument to + cause the method to sort them. + */ + static of(ranges, sort = false) { + let build = new RangeSetBuilder(); + for (let range of ranges instanceof Range ? [ranges] : sort ? lazySort(ranges) : ranges) + build.add(range.from, range.to, range.value); + return build.finish(); + } +} +/** +The empty set of ranges. +*/ +RangeSet.empty = new RangeSet([], [], null, -1); +function lazySort(ranges) { + if (ranges.length > 1) + for (let prev = ranges[0], i = 1; i < ranges.length; i++) { + let cur = ranges[i]; + if (cmpRange(prev, cur) > 0) + return ranges.slice().sort(cmpRange); + prev = cur; + } + return ranges; +} +RangeSet.empty.nextLayer = RangeSet.empty; +/** +A range set builder is a data structure that helps build up a +[range set](https://codemirror.net/6/docs/ref/#state.RangeSet) directly, without first allocating +an array of [`Range`](https://codemirror.net/6/docs/ref/#state.Range) objects. +*/ +class RangeSetBuilder { + /** + Create an empty builder. + */ + constructor() { + this.chunks = []; + this.chunkPos = []; + this.chunkStart = -1; + this.last = null; + this.lastFrom = -1000000000 /* Far */; + this.lastTo = -1000000000 /* Far */; + this.from = []; + this.to = []; + this.value = []; + this.maxPoint = -1; + this.setMaxPoint = -1; + this.nextLayer = null; + } + finishChunk(newArrays) { + this.chunks.push(new Chunk(this.from, this.to, this.value, this.maxPoint)); + this.chunkPos.push(this.chunkStart); + this.chunkStart = -1; + this.setMaxPoint = Math.max(this.setMaxPoint, this.maxPoint); + this.maxPoint = -1; + if (newArrays) { + this.from = []; + this.to = []; + this.value = []; + } + } + /** + Add a range. Ranges should be added in sorted (by `from` and + `value.startSide`) order. + */ + add(from, to, value) { + if (!this.addInner(from, to, value)) + (this.nextLayer || (this.nextLayer = new RangeSetBuilder)).add(from, to, value); + } + /** + @internal + */ + addInner(from, to, value) { + let diff = from - this.lastTo || value.startSide - this.last.endSide; + if (diff <= 0 && (from - this.lastFrom || value.startSide - this.last.startSide) < 0) + throw new Error("Ranges must be added sorted by `from` position and `startSide`"); + if (diff < 0) + return false; + if (this.from.length == 250 /* ChunkSize */) + this.finishChunk(true); + if (this.chunkStart < 0) + this.chunkStart = from; + this.from.push(from - this.chunkStart); + this.to.push(to - this.chunkStart); + this.last = value; + this.lastFrom = from; + this.lastTo = to; + this.value.push(value); + if (value.point) + this.maxPoint = Math.max(this.maxPoint, to - from); + return true; + } + /** + @internal + */ + addChunk(from, chunk) { + if ((from - this.lastTo || chunk.value[0].startSide - this.last.endSide) < 0) + return false; + if (this.from.length) + this.finishChunk(true); + this.setMaxPoint = Math.max(this.setMaxPoint, chunk.maxPoint); + this.chunks.push(chunk); + this.chunkPos.push(from); + let last = chunk.value.length - 1; + this.last = chunk.value[last]; + this.lastFrom = chunk.from[last] + from; + this.lastTo = chunk.to[last] + from; + return true; + } + /** + Finish the range set. Returns the new set. The builder can't be + used anymore after this has been called. + */ + finish() { return this.finishInner(RangeSet.empty); } + /** + @internal + */ + finishInner(next) { + if (this.from.length) + this.finishChunk(false); + if (this.chunks.length == 0) + return next; + let result = RangeSet.create(this.chunkPos, this.chunks, this.nextLayer ? this.nextLayer.finishInner(next) : next, this.setMaxPoint); + this.from = null; // Make sure further `add` calls produce errors + return result; + } +} +function findSharedChunks(a, b, textDiff) { + let inA = new Map(); + for (let set of a) + for (let i = 0; i < set.chunk.length; i++) + if (set.chunk[i].maxPoint <= 0) + inA.set(set.chunk[i], set.chunkPos[i]); + let shared = new Set(); + for (let set of b) + for (let i = 0; i < set.chunk.length; i++) { + let known = inA.get(set.chunk[i]); + if (known != null && (textDiff ? textDiff.mapPos(known) : known) == set.chunkPos[i] && + !(textDiff === null || textDiff === void 0 ? void 0 : textDiff.touchesRange(known, known + set.chunk[i].length))) + shared.add(set.chunk[i]); + } + return shared; +} +class LayerCursor { + constructor(layer, skip, minPoint, rank = 0) { + this.layer = layer; + this.skip = skip; + this.minPoint = minPoint; + this.rank = rank; + } + get startSide() { return this.value ? this.value.startSide : 0; } + get endSide() { return this.value ? this.value.endSide : 0; } + goto(pos, side = -1000000000 /* Far */) { + this.chunkIndex = this.rangeIndex = 0; + this.gotoInner(pos, side, false); + return this; + } + gotoInner(pos, side, forward) { + while (this.chunkIndex < this.layer.chunk.length) { + let next = this.layer.chunk[this.chunkIndex]; + if (!(this.skip && this.skip.has(next) || + this.layer.chunkEnd(this.chunkIndex) < pos || + next.maxPoint < this.minPoint)) + break; + this.chunkIndex++; + forward = false; + } + if (this.chunkIndex < this.layer.chunk.length) { + let rangeIndex = this.layer.chunk[this.chunkIndex].findIndex(pos - this.layer.chunkPos[this.chunkIndex], side, true); + if (!forward || this.rangeIndex < rangeIndex) + this.setRangeIndex(rangeIndex); + } + this.next(); + } + forward(pos, side) { + if ((this.to - pos || this.endSide - side) < 0) + this.gotoInner(pos, side, true); + } + next() { + for (;;) { + if (this.chunkIndex == this.layer.chunk.length) { + this.from = this.to = 1000000000 /* Far */; + this.value = null; + break; + } + else { + let chunkPos = this.layer.chunkPos[this.chunkIndex], chunk = this.layer.chunk[this.chunkIndex]; + let from = chunkPos + chunk.from[this.rangeIndex]; + this.from = from; + this.to = chunkPos + chunk.to[this.rangeIndex]; + this.value = chunk.value[this.rangeIndex]; + this.setRangeIndex(this.rangeIndex + 1); + if (this.minPoint < 0 || this.value.point && this.to - this.from >= this.minPoint) + break; + } + } + } + setRangeIndex(index) { + if (index == this.layer.chunk[this.chunkIndex].value.length) { + this.chunkIndex++; + if (this.skip) { + while (this.chunkIndex < this.layer.chunk.length && this.skip.has(this.layer.chunk[this.chunkIndex])) + this.chunkIndex++; + } + this.rangeIndex = 0; + } + else { + this.rangeIndex = index; + } + } + nextChunk() { + this.chunkIndex++; + this.rangeIndex = 0; + this.next(); + } + compare(other) { + return this.from - other.from || this.startSide - other.startSide || this.rank - other.rank || + this.to - other.to || this.endSide - other.endSide; + } +} +class HeapCursor { + constructor(heap) { + this.heap = heap; + } + static from(sets, skip = null, minPoint = -1) { + let heap = []; + for (let i = 0; i < sets.length; i++) { + for (let cur = sets[i]; !cur.isEmpty; cur = cur.nextLayer) { + if (cur.maxPoint >= minPoint) + heap.push(new LayerCursor(cur, skip, minPoint, i)); + } + } + return heap.length == 1 ? heap[0] : new HeapCursor(heap); + } + get startSide() { return this.value ? this.value.startSide : 0; } + goto(pos, side = -1000000000 /* Far */) { + for (let cur of this.heap) + cur.goto(pos, side); + for (let i = this.heap.length >> 1; i >= 0; i--) + heapBubble(this.heap, i); + this.next(); + return this; + } + forward(pos, side) { + for (let cur of this.heap) + cur.forward(pos, side); + for (let i = this.heap.length >> 1; i >= 0; i--) + heapBubble(this.heap, i); + if ((this.to - pos || this.value.endSide - side) < 0) + this.next(); + } + next() { + if (this.heap.length == 0) { + this.from = this.to = 1000000000 /* Far */; + this.value = null; + this.rank = -1; + } + else { + let top = this.heap[0]; + this.from = top.from; + this.to = top.to; + this.value = top.value; + this.rank = top.rank; + if (top.value) + top.next(); + heapBubble(this.heap, 0); + } + } +} +function heapBubble(heap, index) { + for (let cur = heap[index];;) { + let childIndex = (index << 1) + 1; + if (childIndex >= heap.length) + break; + let child = heap[childIndex]; + if (childIndex + 1 < heap.length && child.compare(heap[childIndex + 1]) >= 0) { + child = heap[childIndex + 1]; + childIndex++; + } + if (cur.compare(child) < 0) + break; + heap[childIndex] = cur; + heap[index] = child; + index = childIndex; + } +} +class SpanCursor { + constructor(sets, skip, minPoint) { + this.minPoint = minPoint; + this.active = []; + this.activeTo = []; + this.activeRank = []; + this.minActive = -1; + // A currently active point range, if any + this.point = null; + this.pointFrom = 0; + this.pointRank = 0; + this.to = -1000000000 /* Far */; + this.endSide = 0; + this.openStart = -1; + this.cursor = HeapCursor.from(sets, skip, minPoint); + } + goto(pos, side = -1000000000 /* Far */) { + this.cursor.goto(pos, side); + this.active.length = this.activeTo.length = this.activeRank.length = 0; + this.minActive = -1; + this.to = pos; + this.endSide = side; + this.openStart = -1; + this.next(); + return this; + } + forward(pos, side) { + while (this.minActive > -1 && (this.activeTo[this.minActive] - pos || this.active[this.minActive].endSide - side) < 0) + this.removeActive(this.minActive); + this.cursor.forward(pos, side); + } + removeActive(index) { + remove(this.active, index); + remove(this.activeTo, index); + remove(this.activeRank, index); + this.minActive = findMinIndex(this.active, this.activeTo); + } + addActive(trackOpen) { + let i = 0, { value, to, rank } = this.cursor; + while (i < this.activeRank.length && this.activeRank[i] <= rank) + i++; + insert(this.active, i, value); + insert(this.activeTo, i, to); + insert(this.activeRank, i, rank); + if (trackOpen) + insert(trackOpen, i, this.cursor.from); + this.minActive = findMinIndex(this.active, this.activeTo); + } + // After calling this, if `this.point` != null, the next range is a + // point. Otherwise, it's a regular range, covered by `this.active`. + next() { + let from = this.to, wasPoint = this.point; + this.point = null; + let trackOpen = this.openStart < 0 ? [] : null, trackExtra = 0; + for (;;) { + let a = this.minActive; + if (a > -1 && (this.activeTo[a] - this.cursor.from || this.active[a].endSide - this.cursor.startSide) < 0) { + if (this.activeTo[a] > from) { + this.to = this.activeTo[a]; + this.endSide = this.active[a].endSide; + break; + } + this.removeActive(a); + if (trackOpen) + remove(trackOpen, a); + } + else if (!this.cursor.value) { + this.to = this.endSide = 1000000000 /* Far */; + break; + } + else if (this.cursor.from > from) { + this.to = this.cursor.from; + this.endSide = this.cursor.startSide; + break; + } + else { + let nextVal = this.cursor.value; + if (!nextVal.point) { // Opening a range + this.addActive(trackOpen); + this.cursor.next(); + } + else if (wasPoint && this.cursor.to == this.to && this.cursor.from < this.cursor.to) { + // Ignore any non-empty points that end precisely at the end of the prev point + this.cursor.next(); + } + else { // New point + this.point = nextVal; + this.pointFrom = this.cursor.from; + this.pointRank = this.cursor.rank; + this.to = this.cursor.to; + this.endSide = nextVal.endSide; + if (this.cursor.from < from) + trackExtra = 1; + this.cursor.next(); + this.forward(this.to, this.endSide); + break; + } + } + } + if (trackOpen) { + let openStart = 0; + while (openStart < trackOpen.length && trackOpen[openStart] < from) + openStart++; + this.openStart = openStart + trackExtra; + } + } + activeForPoint(to) { + if (!this.active.length) + return this.active; + let active = []; + for (let i = this.active.length - 1; i >= 0; i--) { + if (this.activeRank[i] < this.pointRank) + break; + if (this.activeTo[i] > to || this.activeTo[i] == to && this.active[i].endSide >= this.point.endSide) + active.push(this.active[i]); + } + return active.reverse(); + } + openEnd(to) { + let open = 0; + for (let i = this.activeTo.length - 1; i >= 0 && this.activeTo[i] > to; i--) + open++; + return open; + } +} +function compare(a, startA, b, startB, length, comparator) { + a.goto(startA); + b.goto(startB); + let endB = startB + length; + let pos = startB, dPos = startB - startA; + for (;;) { + let diff = (a.to + dPos) - b.to || a.endSide - b.endSide; + let end = diff < 0 ? a.to + dPos : b.to, clipEnd = Math.min(end, endB); + if (a.point || b.point) { + if (!(a.point && b.point && (a.point == b.point || a.point.eq(b.point)) && + sameValues(a.activeForPoint(a.to + dPos), b.activeForPoint(b.to)))) + comparator.comparePoint(pos, clipEnd, a.point, b.point); + } + else { + if (clipEnd > pos && !sameValues(a.active, b.active)) + comparator.compareRange(pos, clipEnd, a.active, b.active); + } + if (end > endB) + break; + pos = end; + if (diff <= 0) + a.next(); + if (diff >= 0) + b.next(); + } +} +function sameValues(a, b) { + if (a.length != b.length) + return false; + for (let i = 0; i < a.length; i++) + if (a[i] != b[i] && !a[i].eq(b[i])) + return false; + return true; +} +function remove(array, index) { + for (let i = index, e = array.length - 1; i < e; i++) + array[i] = array[i + 1]; + array.pop(); +} +function insert(array, index, value) { + for (let i = array.length - 1; i >= index; i--) + array[i + 1] = array[i]; + array[index] = value; +} +function findMinIndex(value, array) { + let found = -1, foundPos = 1000000000 /* Far */; + for (let i = 0; i < array.length; i++) + if ((array[i] - foundPos || value[i].endSide - value[found].endSide) < 0) { + found = i; + foundPos = array[i]; + } + return found; +} + +/** +Count the column position at the given offset into the string, +taking extending characters and tab size into account. +*/ +function countColumn(string, tabSize, to = string.length) { + let n = 0; + for (let i = 0; i < to;) { + if (string.charCodeAt(i) == 9) { + n += tabSize - (n % tabSize); + i++; + } + else { + n++; + i = findClusterBreak(string, i); + } + } + return n; +} +/** +Find the offset that corresponds to the given column position in a +string, taking extending characters and tab size into account. By +default, the string length is returned when it is too short to +reach the column. Pass `strict` true to make it return -1 in that +situation. +*/ +function findColumn(string, col, tabSize, strict) { + for (let i = 0, n = 0;;) { + if (n >= col) + return i; + if (i == string.length) + break; + n += string.charCodeAt(i) == 9 ? tabSize - (n % tabSize) : 1; + i = findClusterBreak(string, i); + } + return strict === true ? -1 : string.length; +} + +exports.Annotation = Annotation; +exports.AnnotationType = AnnotationType; +exports.ChangeDesc = ChangeDesc; +exports.ChangeSet = ChangeSet; +exports.Compartment = Compartment; +exports.EditorSelection = EditorSelection; +exports.EditorState = EditorState; +exports.Facet = Facet; +exports.Line = Line; +exports.Prec = Prec; +exports.Range = Range; +exports.RangeSet = RangeSet; +exports.RangeSetBuilder = RangeSetBuilder; +exports.RangeValue = RangeValue; +exports.SelectionRange = SelectionRange; +exports.StateEffect = StateEffect; +exports.StateEffectType = StateEffectType; +exports.StateField = StateField; +exports.Text = Text; +exports.Transaction = Transaction; +exports.codePointAt = codePointAt; +exports.codePointSize = codePointSize; +exports.combineConfig = combineConfig; +exports.countColumn = countColumn; +exports.findClusterBreak = findClusterBreak; +exports.findColumn = findColumn; +exports.fromCodePoint = fromCodePoint; diff --git a/node_modules/@codemirror/state/dist/index.d.ts b/node_modules/@codemirror/state/dist/index.d.ts new file mode 100644 index 0000000000..059c938a3e --- /dev/null +++ b/node_modules/@codemirror/state/dist/index.d.ts @@ -0,0 +1,1643 @@ +/** +A text iterator iterates over a sequence of strings. When +iterating over a [`Text`](https://codemirror.net/6/docs/ref/#state.Text) document, result values will +either be lines or line breaks. +*/ +interface TextIterator extends Iterator, Iterable { + /** + Retrieve the next string. Optionally skip a given number of + positions after the current position. Always returns the object + itself. + */ + next(skip?: number): this; + /** + The current string. Will be the empty string when the cursor is + at its end or `next` hasn't been called on it yet. + */ + value: string; + /** + Whether the end of the iteration has been reached. You should + probably check this right after calling `next`. + */ + done: boolean; + /** + Whether the current string represents a line break. + */ + lineBreak: boolean; +} +/** +The data structure for documents. @nonabstract +*/ +declare abstract class Text implements Iterable { + /** + The length of the string. + */ + abstract readonly length: number; + /** + The number of lines in the string (always >= 1). + */ + abstract readonly lines: number; + /** + Get the line description around the given position. + */ + lineAt(pos: number): Line; + /** + Get the description for the given (1-based) line number. + */ + line(n: number): Line; + /** + Replace a range of the text with the given content. + */ + replace(from: number, to: number, text: Text): Text; + /** + Append another document to this one. + */ + append(other: Text): Text; + /** + Retrieve the text between the given points. + */ + slice(from: number, to?: number): Text; + /** + Retrieve a part of the document as a string + */ + abstract sliceString(from: number, to?: number, lineSep?: string): string; + /** + Test whether this text is equal to another instance. + */ + eq(other: Text): boolean; + /** + Iterate over the text. When `dir` is `-1`, iteration happens + from end to start. This will return lines and the breaks between + them as separate strings. + */ + iter(dir?: 1 | -1): TextIterator; + /** + Iterate over a range of the text. When `from` > `to`, the + iterator will run in reverse. + */ + iterRange(from: number, to?: number): TextIterator; + /** + Return a cursor that iterates over the given range of lines, + _without_ returning the line breaks between, and yielding empty + strings for empty lines. + + When `from` and `to` are given, they should be 1-based line numbers. + */ + iterLines(from?: number, to?: number): TextIterator; + /** + Convert the document to an array of lines (which can be + deserialized again via [`Text.of`](https://codemirror.net/6/docs/ref/#state.Text^of)). + */ + toJSON(): string[]; + /** + If this is a branch node, `children` will hold the `Text` + objects that it is made up of. For leaf nodes, this holds null. + */ + abstract readonly children: readonly Text[] | null; + [Symbol.iterator]: () => Iterator; + /** + Create a `Text` instance for the given array of lines. + */ + static of(text: readonly string[]): Text; + /** + The empty document. + */ + static empty: Text; +} +/** +This type describes a line in the document. It is created +on-demand when lines are [queried](https://codemirror.net/6/docs/ref/#state.Text.lineAt). +*/ +declare class Line { + /** + The position of the start of the line. + */ + readonly from: number; + /** + The position at the end of the line (_before_ the line break, + or at the end of document for the last line). + */ + readonly to: number; + /** + This line's line number (1-based). + */ + readonly number: number; + /** + The line's content. + */ + readonly text: string; + /** + The length of the line (not including any line break after it). + */ + get length(): number; +} + +/** +Distinguishes different ways in which positions can be mapped. +*/ +declare enum MapMode { + /** + Map a position to a valid new position, even when its context + was deleted. + */ + Simple = 0, + /** + Return null if deletion happens across the position. + */ + TrackDel = 1, + /** + Return null if the character _before_ the position is deleted. + */ + TrackBefore = 2, + /** + Return null if the character _after_ the position is deleted. + */ + TrackAfter = 3 +} +/** +A change description is a variant of [change set](https://codemirror.net/6/docs/ref/#state.ChangeSet) +that doesn't store the inserted text. As such, it can't be +applied, but is cheaper to store and manipulate. +*/ +declare class ChangeDesc { + /** + The length of the document before the change. + */ + get length(): number; + /** + The length of the document after the change. + */ + get newLength(): number; + /** + False when there are actual changes in this set. + */ + get empty(): boolean; + /** + Iterate over the unchanged parts left by these changes. `posA` + provides the position of the range in the old document, `posB` + the new position in the changed document. + */ + iterGaps(f: (posA: number, posB: number, length: number) => void): void; + /** + Iterate over the ranges changed by these changes. (See + [`ChangeSet.iterChanges`](https://codemirror.net/6/docs/ref/#state.ChangeSet.iterChanges) for a + variant that also provides you with the inserted text.) + `fromA`/`toA` provides the extent of the change in the starting + document, `fromB`/`toB` the extent of the replacement in the + changed document. + + When `individual` is true, adjacent changes (which are kept + separate for [position mapping](https://codemirror.net/6/docs/ref/#state.ChangeDesc.mapPos)) are + reported separately. + */ + iterChangedRanges(f: (fromA: number, toA: number, fromB: number, toB: number) => void, individual?: boolean): void; + /** + Get a description of the inverted form of these changes. + */ + get invertedDesc(): ChangeDesc; + /** + Compute the combined effect of applying another set of changes + after this one. The length of the document after this set should + match the length before `other`. + */ + composeDesc(other: ChangeDesc): ChangeDesc; + /** + Map this description, which should start with the same document + as `other`, over another set of changes, so that it can be + applied after it. When `before` is true, map as if the changes + in `other` happened before the ones in `this`. + */ + mapDesc(other: ChangeDesc, before?: boolean): ChangeDesc; + /** + Map a given position through these changes, to produce a + position pointing into the new document. + + `assoc` indicates which side the position should be associated + with. When it is negative or zero, the mapping will try to keep + the position close to the character before it (if any), and will + move it before insertions at that point or replacements across + that point. When it is positive, the position is associated with + the character after it, and will be moved forward for insertions + at or replacements across the position. Defaults to -1. + + `mode` determines whether deletions should be + [reported](https://codemirror.net/6/docs/ref/#state.MapMode). It defaults to + [`MapMode.Simple`](https://codemirror.net/6/docs/ref/#state.MapMode.Simple) (don't report + deletions). + */ + mapPos(pos: number, assoc?: number): number; + mapPos(pos: number, assoc: number, mode: MapMode): number | null; + /** + Check whether these changes touch a given range. When one of the + changes entirely covers the range, the string `"cover"` is + returned. + */ + touchesRange(from: number, to?: number): boolean | "cover"; + /** + Serialize this change desc to a JSON-representable value. + */ + toJSON(): readonly number[]; + /** + Create a change desc from its JSON representation (as produced + by [`toJSON`](https://codemirror.net/6/docs/ref/#state.ChangeDesc.toJSON). + */ + static fromJSON(json: any): ChangeDesc; +} +/** +This type is used as argument to +[`EditorState.changes`](https://codemirror.net/6/docs/ref/#state.EditorState.changes) and in the +[`changes` field](https://codemirror.net/6/docs/ref/#state.TransactionSpec.changes) of transaction +specs to succinctly describe document changes. It may either be a +plain object describing a change (a deletion, insertion, or +replacement, depending on which fields are present), a [change +set](https://codemirror.net/6/docs/ref/#state.ChangeSet), or an array of change specs. +*/ +declare type ChangeSpec = { + from: number; + to?: number; + insert?: string | Text; +} | ChangeSet | readonly ChangeSpec[]; +/** +A change set represents a group of modifications to a document. It +stores the document length, and can only be applied to documents +with exactly that length. +*/ +declare class ChangeSet extends ChangeDesc { + private constructor(); + /** + Apply the changes to a document, returning the modified + document. + */ + apply(doc: Text): Text; + mapDesc(other: ChangeDesc, before?: boolean): ChangeDesc; + /** + Given the document as it existed _before_ the changes, return a + change set that represents the inverse of this set, which could + be used to go from the document created by the changes back to + the document as it existed before the changes. + */ + invert(doc: Text): ChangeSet; + /** + Combine two subsequent change sets into a single set. `other` + must start in the document produced by `this`. If `this` goes + `docA` → `docB` and `other` represents `docB` → `docC`, the + returned value will represent the change `docA` → `docC`. + */ + compose(other: ChangeSet): ChangeSet; + /** + Given another change set starting in the same document, maps this + change set over the other, producing a new change set that can be + applied to the document produced by applying `other`. When + `before` is `true`, order changes as if `this` comes before + `other`, otherwise (the default) treat `other` as coming first. + + Given two changes `A` and `B`, `A.compose(B.map(A))` and + `B.compose(A.map(B, true))` will produce the same document. This + provides a basic form of [operational + transformation](https://en.wikipedia.org/wiki/Operational_transformation), + and can be used for collaborative editing. + */ + map(other: ChangeDesc, before?: boolean): ChangeSet; + /** + Iterate over the changed ranges in the document, calling `f` for + each, with the range in the original document (`fromA`-`toA`) + and the range that replaces it in the new document + (`fromB`-`toB`). + + When `individual` is true, adjacent changes are reported + separately. + */ + iterChanges(f: (fromA: number, toA: number, fromB: number, toB: number, inserted: Text) => void, individual?: boolean): void; + /** + Get a [change description](https://codemirror.net/6/docs/ref/#state.ChangeDesc) for this change + set. + */ + get desc(): ChangeDesc; + /** + Serialize this change set to a JSON-representable value. + */ + toJSON(): any; + /** + Create a change set for the given changes, for a document of the + given length, using `lineSep` as line separator. + */ + static of(changes: ChangeSpec, length: number, lineSep?: string): ChangeSet; + /** + Create an empty changeset of the given length. + */ + static empty(length: number): ChangeSet; + /** + Create a changeset from its JSON representation (as produced by + [`toJSON`](https://codemirror.net/6/docs/ref/#state.ChangeSet.toJSON). + */ + static fromJSON(json: any): ChangeSet; +} + +/** +A single selection range. When +[`allowMultipleSelections`](https://codemirror.net/6/docs/ref/#state.EditorState^allowMultipleSelections) +is enabled, a [selection](https://codemirror.net/6/docs/ref/#state.EditorSelection) may hold +multiple ranges. By default, selections hold exactly one range. +*/ +declare class SelectionRange { + /** + The lower boundary of the range. + */ + readonly from: number; + /** + The upper boundary of the range. + */ + readonly to: number; + private flags; + private constructor(); + /** + The anchor of the range—the side that doesn't move when you + extend it. + */ + get anchor(): number; + /** + The head of the range, which is moved when the range is + [extended](https://codemirror.net/6/docs/ref/#state.SelectionRange.extend). + */ + get head(): number; + /** + True when `anchor` and `head` are at the same position. + */ + get empty(): boolean; + /** + If this is a cursor that is explicitly associated with the + character on one of its sides, this returns the side. -1 means + the character before its position, 1 the character after, and 0 + means no association. + */ + get assoc(): -1 | 0 | 1; + /** + The bidirectional text level associated with this cursor, if + any. + */ + get bidiLevel(): number | null; + /** + The goal column (stored vertical offset) associated with a + cursor. This is used to preserve the vertical position when + [moving](https://codemirror.net/6/docs/ref/#view.EditorView.moveVertically) across + lines of different length. + */ + get goalColumn(): number | undefined; + /** + Map this range through a change, producing a valid range in the + updated document. + */ + map(change: ChangeDesc, assoc?: number): SelectionRange; + /** + Extend this range to cover at least `from` to `to`. + */ + extend(from: number, to?: number): SelectionRange; + /** + Compare this range to another range. + */ + eq(other: SelectionRange): boolean; + /** + Return a JSON-serializable object representing the range. + */ + toJSON(): any; + /** + Convert a JSON representation of a range to a `SelectionRange` + instance. + */ + static fromJSON(json: any): SelectionRange; +} +/** +An editor selection holds one or more selection ranges. +*/ +declare class EditorSelection { + /** + The ranges in the selection, sorted by position. Ranges cannot + overlap (but they may touch, if they aren't empty). + */ + readonly ranges: readonly SelectionRange[]; + /** + The index of the _main_ range in the selection (which is + usually the range that was added last). + */ + readonly mainIndex: number; + private constructor(); + /** + Map a selection through a change. Used to adjust the selection + position for changes. + */ + map(change: ChangeDesc, assoc?: number): EditorSelection; + /** + Compare this selection to another selection. + */ + eq(other: EditorSelection): boolean; + /** + Get the primary selection range. Usually, you should make sure + your code applies to _all_ ranges, by using methods like + [`changeByRange`](https://codemirror.net/6/docs/ref/#state.EditorState.changeByRange). + */ + get main(): SelectionRange; + /** + Make sure the selection only has one range. Returns a selection + holding only the main range from this selection. + */ + asSingle(): EditorSelection; + /** + Extend this selection with an extra range. + */ + addRange(range: SelectionRange, main?: boolean): EditorSelection; + /** + Replace a given range with another range, and then normalize the + selection to merge and sort ranges if necessary. + */ + replaceRange(range: SelectionRange, which?: number): EditorSelection; + /** + Convert this selection to an object that can be serialized to + JSON. + */ + toJSON(): any; + /** + Create a selection from a JSON representation. + */ + static fromJSON(json: any): EditorSelection; + /** + Create a selection holding a single range. + */ + static single(anchor: number, head?: number): EditorSelection; + /** + Sort and merge the given set of ranges, creating a valid + selection. + */ + static create(ranges: readonly SelectionRange[], mainIndex?: number): EditorSelection; + /** + Create a cursor selection range at the given position. You can + safely ignore the optional arguments in most situations. + */ + static cursor(pos: number, assoc?: number, bidiLevel?: number, goalColumn?: number): SelectionRange; + /** + Create a selection range. + */ + static range(anchor: number, head: number, goalColumn?: number): SelectionRange; +} + +declare type FacetConfig = { + /** + How to combine the input values into a single output value. When + not given, the array of input values becomes the output. This + function will immediately be called on creating the facet, with + an empty array, to compute the facet's default value when no + inputs are present. + */ + combine?: (value: readonly Input[]) => Output; + /** + How to compare output values to determine whether the value of + the facet changed. Defaults to comparing by `===` or, if no + `combine` function was given, comparing each element of the + array with `===`. + */ + compare?: (a: Output, b: Output) => boolean; + /** + How to compare input values to avoid recomputing the output + value when no inputs changed. Defaults to comparing with `===`. + */ + compareInput?: (a: Input, b: Input) => boolean; + /** + Forbids dynamic inputs to this facet. + */ + static?: boolean; + /** + If given, these extension(s) will be added to any state where + this facet is provided. (Note that, while a facet's default + value can be read from a state even if the facet wasn't present + in the state at all, these extensions won't be added in that + situation.) + */ + enables?: Extension; +}; +/** +A facet is a labeled value that is associated with an editor +state. It takes inputs from any number of extensions, and combines +those into a single output value. + +Examples of uses of facets are the [tab +size](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize), [editor +attributes](https://codemirror.net/6/docs/ref/#view.EditorView^editorAttributes), and [update +listeners](https://codemirror.net/6/docs/ref/#view.EditorView^updateListener). +*/ +declare class Facet { + private isStatic; + private constructor(); + /** + Define a new facet. + */ + static define(config?: FacetConfig): Facet; + /** + Returns an extension that adds the given value to this facet. + */ + of(value: Input): Extension; + /** + Create an extension that computes a value for the facet from a + state. You must take care to declare the parts of the state that + this value depends on, since your function is only called again + for a new state when one of those parts changed. + + In cases where your value depends only on a single field, you'll + want to use the [`from`](https://codemirror.net/6/docs/ref/#state.Facet.from) method instead. + */ + compute(deps: readonly Slot[], get: (state: EditorState) => Input): Extension; + /** + Create an extension that computes zero or more values for this + facet from a state. + */ + computeN(deps: readonly Slot[], get: (state: EditorState) => readonly Input[]): Extension; + /** + Shorthand method for registering a facet source with a state + field as input. If the field's type corresponds to this facet's + input type, the getter function can be omitted. If given, it + will be used to retrieve the input from the field value. + */ + from(field: StateField): Extension; + from(field: StateField, get: (value: T) => Input): Extension; +} +declare type Slot = Facet | StateField | "doc" | "selection"; +declare type StateFieldSpec = { + /** + Creates the initial value for the field when a state is created. + */ + create: (state: EditorState) => Value; + /** + Compute a new value from the field's previous value and a + [transaction](https://codemirror.net/6/docs/ref/#state.Transaction). + */ + update: (value: Value, transaction: Transaction) => Value; + /** + Compare two values of the field, returning `true` when they are + the same. This is used to avoid recomputing facets that depend + on the field when its value did not change. Defaults to using + `===`. + */ + compare?: (a: Value, b: Value) => boolean; + /** + Provide extensions based on this field. The given function will + be called once with the initialized field. It will usually want + to call some facet's [`from`](https://codemirror.net/6/docs/ref/#state.Facet.from) method to + create facet inputs from this field, but can also return other + extensions that should be enabled when the field is present in a + configuration. + */ + provide?: (field: StateField) => Extension; + /** + A function used to serialize this field's content to JSON. Only + necessary when this field is included in the argument to + [`EditorState.toJSON`](https://codemirror.net/6/docs/ref/#state.EditorState.toJSON). + */ + toJSON?: (value: Value, state: EditorState) => any; + /** + A function that deserializes the JSON representation of this + field's content. + */ + fromJSON?: (json: any, state: EditorState) => Value; +}; +/** +Fields can store additional information in an editor state, and +keep it in sync with the rest of the state. +*/ +declare class StateField { + private createF; + private updateF; + private compareF; + private constructor(); + /** + Define a state field. + */ + static define(config: StateFieldSpec): StateField; + private create; + /** + Returns an extension that enables this field and overrides the + way it is initialized. Can be useful when you need to provide a + non-default starting value for the field. + */ + init(create: (state: EditorState) => Value): Extension; + /** + State field instances can be used as + [`Extension`](https://codemirror.net/6/docs/ref/#state.Extension) values to enable the field in a + given state. + */ + get extension(): Extension; +} +/** +Extension values can be +[provided](https://codemirror.net/6/docs/ref/#state.EditorStateConfig.extensions) when creating a +state to attach various kinds of configuration and behavior +information. They can either be built-in extension-providing +objects, such as [state fields](https://codemirror.net/6/docs/ref/#state.StateField) or [facet +providers](https://codemirror.net/6/docs/ref/#state.Facet.of), or objects with an extension in its +`extension` property. Extensions can be nested in arrays +arbitrarily deep—they will be flattened when processed. +*/ +declare type Extension = { + extension: Extension; +} | readonly Extension[]; +/** +By default extensions are registered in the order they are found +in the flattened form of nested array that was provided. +Individual extension values can be assigned a precedence to +override this. Extensions that do not have a precedence set get +the precedence of the nearest parent with a precedence, or +[`default`](https://codemirror.net/6/docs/ref/#state.Prec.default) if there is no such parent. The +final ordering of extensions is determined by first sorting by +precedence and then by order within each precedence. +*/ +declare const Prec: { + /** + The highest precedence level, for extensions that should end up + near the start of the precedence ordering. + */ + highest: (ext: Extension) => Extension; + /** + A higher-than-default precedence, for extensions that should + come before those with default precedence. + */ + high: (ext: Extension) => Extension; + /** + The default precedence, which is also used for extensions + without an explicit precedence. + */ + default: (ext: Extension) => Extension; + /** + A lower-than-default precedence. + */ + low: (ext: Extension) => Extension; + /** + The lowest precedence level. Meant for things that should end up + near the end of the extension order. + */ + lowest: (ext: Extension) => Extension; +}; +/** +Extension compartments can be used to make a configuration +dynamic. By [wrapping](https://codemirror.net/6/docs/ref/#state.Compartment.of) part of your +configuration in a compartment, you can later +[replace](https://codemirror.net/6/docs/ref/#state.Compartment.reconfigure) that part through a +transaction. +*/ +declare class Compartment { + /** + Create an instance of this compartment to add to your [state + configuration](https://codemirror.net/6/docs/ref/#state.EditorStateConfig.extensions). + */ + of(ext: Extension): Extension; + /** + Create an [effect](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) that + reconfigures this compartment. + */ + reconfigure(content: Extension): StateEffect; + /** + Get the current content of the compartment in the state, or + `undefined` if it isn't present. + */ + get(state: EditorState): Extension | undefined; +} + +/** +Annotations are tagged values that are used to add metadata to +transactions in an extensible way. They should be used to model +things that effect the entire transaction (such as its [time +stamp](https://codemirror.net/6/docs/ref/#state.Transaction^time) or information about its +[origin](https://codemirror.net/6/docs/ref/#state.Transaction^userEvent)). For effects that happen +_alongside_ the other changes made by the transaction, [state +effects](https://codemirror.net/6/docs/ref/#state.StateEffect) are more appropriate. +*/ +declare class Annotation { + /** + The annotation type. + */ + readonly type: AnnotationType; + /** + The value of this annotation. + */ + readonly value: T; + /** + Define a new type of annotation. + */ + static define(): AnnotationType; + private _isAnnotation; +} +/** +Marker that identifies a type of [annotation](https://codemirror.net/6/docs/ref/#state.Annotation). +*/ +declare class AnnotationType { + /** + Create an instance of this annotation. + */ + of(value: T): Annotation; +} +interface StateEffectSpec { + /** + Provides a way to map an effect like this through a position + mapping. When not given, the effects will simply not be mapped. + When the function returns `undefined`, that means the mapping + deletes the effect. + */ + map?: (value: Value, mapping: ChangeDesc) => Value | undefined; +} +/** +Representation of a type of state effect. Defined with +[`StateEffect.define`](https://codemirror.net/6/docs/ref/#state.StateEffect^define). +*/ +declare class StateEffectType { + /** + @internal + */ + readonly map: (value: any, mapping: ChangeDesc) => any | undefined; + /** + Create a [state effect](https://codemirror.net/6/docs/ref/#state.StateEffect) instance of this + type. + */ + of(value: Value): StateEffect; +} +/** +State effects can be used to represent additional effects +associated with a [transaction](https://codemirror.net/6/docs/ref/#state.Transaction.effects). They +are often useful to model changes to custom [state +fields](https://codemirror.net/6/docs/ref/#state.StateField), when those changes aren't implicit in +document or selection changes. +*/ +declare class StateEffect { + /** + The value of this effect. + */ + readonly value: Value; + /** + Map this effect through a position mapping. Will return + `undefined` when that ends up deleting the effect. + */ + map(mapping: ChangeDesc): StateEffect | undefined; + /** + Tells you whether this effect object is of a given + [type](https://codemirror.net/6/docs/ref/#state.StateEffectType). + */ + is(type: StateEffectType): this is StateEffect; + /** + Define a new effect type. The type parameter indicates the type + of values that his effect holds. + */ + static define(spec?: StateEffectSpec): StateEffectType; + /** + Map an array of effects through a change set. + */ + static mapEffects(effects: readonly StateEffect[], mapping: ChangeDesc): readonly StateEffect[]; + /** + This effect can be used to reconfigure the root extensions of + the editor. Doing this will discard any extensions + [appended](https://codemirror.net/6/docs/ref/#state.StateEffect^appendConfig), but does not reset + the content of [reconfigured](https://codemirror.net/6/docs/ref/#state.Compartment.reconfigure) + compartments. + */ + static reconfigure: StateEffectType; + /** + Append extensions to the top-level configuration of the editor. + */ + static appendConfig: StateEffectType; +} +/** +Describes a [transaction](https://codemirror.net/6/docs/ref/#state.Transaction) when calling the +[`EditorState.update`](https://codemirror.net/6/docs/ref/#state.EditorState.update) method. +*/ +interface TransactionSpec { + /** + The changes to the document made by this transaction. + */ + changes?: ChangeSpec; + /** + When set, this transaction explicitly updates the selection. + Offsets in this selection should refer to the document as it is + _after_ the transaction. + */ + selection?: EditorSelection | { + anchor: number; + head?: number; + }; + /** + Attach [state effects](https://codemirror.net/6/docs/ref/#state.StateEffect) to this transaction. + Again, when they contain positions and this same spec makes + changes, those positions should refer to positions in the + updated document. + */ + effects?: StateEffect | readonly StateEffect[]; + /** + Set [annotations](https://codemirror.net/6/docs/ref/#state.Annotation) for this transaction. + */ + annotations?: Annotation | readonly Annotation[]; + /** + Shorthand for `annotations:` [`Transaction.userEvent`](https://codemirror.net/6/docs/ref/#state.Transaction^userEvent)`.of(...)`. + */ + userEvent?: string; + /** + When set to `true`, the transaction is marked as needing to + scroll the current selection into view. + */ + scrollIntoView?: boolean; + /** + By default, transactions can be modified by [change + filters](https://codemirror.net/6/docs/ref/#state.EditorState^changeFilter) and [transaction + filters](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter). You can set this + to `false` to disable that. This can be necessary for + transactions that, for example, include annotations that must be + kept consistent with their changes. + */ + filter?: boolean; + /** + Normally, when multiple specs are combined (for example by + [`EditorState.update`](https://codemirror.net/6/docs/ref/#state.EditorState.update)), the + positions in `changes` are taken to refer to the document + positions in the initial document. When a spec has `sequental` + set to true, its positions will be taken to refer to the + document created by the specs before it instead. + */ + sequential?: boolean; +} +/** +Changes to the editor state are grouped into transactions. +Typically, a user action creates a single transaction, which may +contain any number of document changes, may change the selection, +or have other effects. Create a transaction by calling +[`EditorState.update`](https://codemirror.net/6/docs/ref/#state.EditorState.update), or immediately +dispatch one by calling +[`EditorView.dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch). +*/ +declare class Transaction { + /** + The state from which the transaction starts. + */ + readonly startState: EditorState; + /** + The document changes made by this transaction. + */ + readonly changes: ChangeSet; + /** + The selection set by this transaction, or undefined if it + doesn't explicitly set a selection. + */ + readonly selection: EditorSelection | undefined; + /** + The effects added to the transaction. + */ + readonly effects: readonly StateEffect[]; + /** + Whether the selection should be scrolled into view after this + transaction is dispatched. + */ + readonly scrollIntoView: boolean; + private constructor(); + /** + The new document produced by the transaction. Contrary to + [`.state`](https://codemirror.net/6/docs/ref/#state.Transaction.state)`.doc`, accessing this won't + force the entire new state to be computed right away, so it is + recommended that [transaction + filters](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter) use this getter + when they need to look at the new document. + */ + get newDoc(): Text; + /** + The new selection produced by the transaction. If + [`this.selection`](https://codemirror.net/6/docs/ref/#state.Transaction.selection) is undefined, + this will [map](https://codemirror.net/6/docs/ref/#state.EditorSelection.map) the start state's + current selection through the changes made by the transaction. + */ + get newSelection(): EditorSelection; + /** + The new state created by the transaction. Computed on demand + (but retained for subsequent access), so it is recommended not to + access it in [transaction + filters](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter) when possible. + */ + get state(): EditorState; + /** + Get the value of the given annotation type, if any. + */ + annotation(type: AnnotationType): T | undefined; + /** + Indicates whether the transaction changed the document. + */ + get docChanged(): boolean; + /** + Indicates whether this transaction reconfigures the state + (through a [configuration compartment](https://codemirror.net/6/docs/ref/#state.Compartment) or + with a top-level configuration + [effect](https://codemirror.net/6/docs/ref/#state.StateEffect^reconfigure). + */ + get reconfigured(): boolean; + /** + Returns true if the transaction has a [user + event](https://codemirror.net/6/docs/ref/#state.Transaction^userEvent) annotation that is equal to + or more specific than `event`. For example, if the transaction + has `"select.pointer"` as user event, `"select"` and + `"select.pointer"` will match it. + */ + isUserEvent(event: string): boolean; + /** + Annotation used to store transaction timestamps. Automatically + added to every transaction, holding `Date.now()`. + */ + static time: AnnotationType; + /** + Annotation used to associate a transaction with a user interface + event. Holds a string identifying the event, using a + dot-separated format to support attaching more specific + information. The events used by the core libraries are: + + - `"input"` when content is entered + - `"input.type"` for typed input + - `"input.type.compose"` for composition + - `"input.paste"` for pasted input + - `"input.drop"` when adding content with drag-and-drop + - `"input.complete"` when autocompleting + - `"delete"` when the user deletes content + - `"delete.selection"` when deleting the selection + - `"delete.forward"` when deleting forward from the selection + - `"delete.backward"` when deleting backward from the selection + - `"delete.cut"` when cutting to the clipboard + - `"move"` when content is moved + - `"move.drop"` when content is moved within the editor through drag-and-drop + - `"select"` when explicitly changing the selection + - `"select.pointer"` when selecting with a mouse or other pointing device + - `"undo"` and `"redo"` for history actions + + Use [`isUserEvent`](https://codemirror.net/6/docs/ref/#state.Transaction.isUserEvent) to check + whether the annotation matches a given event. + */ + static userEvent: AnnotationType; + /** + Annotation indicating whether a transaction should be added to + the undo history or not. + */ + static addToHistory: AnnotationType; + /** + Annotation indicating (when present and true) that a transaction + represents a change made by some other actor, not the user. This + is used, for example, to tag other people's changes in + collaborative editing. + */ + static remote: AnnotationType; +} + +/** +The categories produced by a [character +categorizer](https://codemirror.net/6/docs/ref/#state.EditorState.charCategorizer). These are used +do things like selecting by word. +*/ +declare enum CharCategory { + /** + Word characters. + */ + Word = 0, + /** + Whitespace. + */ + Space = 1, + /** + Anything else. + */ + Other = 2 +} + +/** +Options passed when [creating](https://codemirror.net/6/docs/ref/#state.EditorState^create) an +editor state. +*/ +interface EditorStateConfig { + /** + The initial document. Defaults to an empty document. Can be + provided either as a plain string (which will be split into + lines according to the value of the [`lineSeparator` + facet](https://codemirror.net/6/docs/ref/#state.EditorState^lineSeparator)), or an instance of + the [`Text`](https://codemirror.net/6/docs/ref/#state.Text) class (which is what the state will use + to represent the document). + */ + doc?: string | Text; + /** + The starting selection. Defaults to a cursor at the very start + of the document. + */ + selection?: EditorSelection | { + anchor: number; + head?: number; + }; + /** + [Extension(s)](https://codemirror.net/6/docs/ref/#state.Extension) to associate with this state. + */ + extensions?: Extension; +} +/** +The editor state class is a persistent (immutable) data structure. +To update a state, you [create](https://codemirror.net/6/docs/ref/#state.EditorState.update) a +[transaction](https://codemirror.net/6/docs/ref/#state.Transaction), which produces a _new_ state +instance, without modifying the original object. + +As such, _never_ mutate properties of a state directly. That'll +just break things. +*/ +declare class EditorState { + /** + The current document. + */ + readonly doc: Text; + /** + The current selection. + */ + readonly selection: EditorSelection; + private constructor(); + /** + Retrieve the value of a [state field](https://codemirror.net/6/docs/ref/#state.StateField). Throws + an error when the state doesn't have that field, unless you pass + `false` as second parameter. + */ + field(field: StateField): T; + field(field: StateField, require: false): T | undefined; + /** + Create a [transaction](https://codemirror.net/6/docs/ref/#state.Transaction) that updates this + state. Any number of [transaction specs](https://codemirror.net/6/docs/ref/#state.TransactionSpec) + can be passed. Unless + [`sequential`](https://codemirror.net/6/docs/ref/#state.TransactionSpec.sequential) is set, the + [changes](https://codemirror.net/6/docs/ref/#state.TransactionSpec.changes) (if any) of each spec + are assumed to start in the _current_ document (not the document + produced by previous specs), and its + [selection](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection) and + [effects](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) are assumed to refer + to the document created by its _own_ changes. The resulting + transaction contains the combined effect of all the different + specs. For [selection](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection), later + specs take precedence over earlier ones. + */ + update(...specs: readonly TransactionSpec[]): Transaction; + /** + Create a [transaction spec](https://codemirror.net/6/docs/ref/#state.TransactionSpec) that + replaces every selection range with the given content. + */ + replaceSelection(text: string | Text): TransactionSpec; + /** + Create a set of changes and a new selection by running the given + function for each range in the active selection. The function + can return an optional set of changes (in the coordinate space + of the start document), plus an updated range (in the coordinate + space of the document produced by the call's own changes). This + method will merge all the changes and ranges into a single + changeset and selection, and return it as a [transaction + spec](https://codemirror.net/6/docs/ref/#state.TransactionSpec), which can be passed to + [`update`](https://codemirror.net/6/docs/ref/#state.EditorState.update). + */ + changeByRange(f: (range: SelectionRange) => { + range: SelectionRange; + changes?: ChangeSpec; + effects?: StateEffect | readonly StateEffect[]; + }): { + changes: ChangeSet; + selection: EditorSelection; + effects: readonly StateEffect[]; + }; + /** + Create a [change set](https://codemirror.net/6/docs/ref/#state.ChangeSet) from the given change + description, taking the state's document length and line + separator into account. + */ + changes(spec?: ChangeSpec): ChangeSet; + /** + Using the state's [line + separator](https://codemirror.net/6/docs/ref/#state.EditorState^lineSeparator), create a + [`Text`](https://codemirror.net/6/docs/ref/#state.Text) instance from the given string. + */ + toText(string: string): Text; + /** + Return the given range of the document as a string. + */ + sliceDoc(from?: number, to?: number): string; + /** + Get the value of a state [facet](https://codemirror.net/6/docs/ref/#state.Facet). + */ + facet(facet: Facet): Output; + /** + Convert this state to a JSON-serializable object. When custom + fields should be serialized, you can pass them in as an object + mapping property names (in the resulting object, which should + not use `doc` or `selection`) to fields. + */ + toJSON(fields?: { + [prop: string]: StateField; + }): any; + /** + Deserialize a state from its JSON representation. When custom + fields should be deserialized, pass the same object you passed + to [`toJSON`](https://codemirror.net/6/docs/ref/#state.EditorState.toJSON) when serializing as + third argument. + */ + static fromJSON(json: any, config?: EditorStateConfig, fields?: { + [prop: string]: StateField; + }): EditorState; + /** + Create a new state. You'll usually only need this when + initializing an editor—updated states are created by applying + transactions. + */ + static create(config?: EditorStateConfig): EditorState; + /** + A facet that, when enabled, causes the editor to allow multiple + ranges to be selected. Be careful though, because by default the + editor relies on the native DOM selection, which cannot handle + multiple selections. An extension like + [`drawSelection`](https://codemirror.net/6/docs/ref/#view.drawSelection) can be used to make + secondary selections visible to the user. + */ + static allowMultipleSelections: Facet; + /** + Configures the tab size to use in this state. The first + (highest-precedence) value of the facet is used. If no value is + given, this defaults to 4. + */ + static tabSize: Facet; + /** + The size (in columns) of a tab in the document, determined by + the [`tabSize`](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize) facet. + */ + get tabSize(): number; + /** + The line separator to use. By default, any of `"\n"`, `"\r\n"` + and `"\r"` is treated as a separator when splitting lines, and + lines are joined with `"\n"`. + + When you configure a value here, only that precise separator + will be used, allowing you to round-trip documents through the + editor without normalizing line separators. + */ + static lineSeparator: Facet; + /** + Get the proper [line-break](https://codemirror.net/6/docs/ref/#state.EditorState^lineSeparator) + string for this state. + */ + get lineBreak(): string; + /** + This facet controls the value of the + [`readOnly`](https://codemirror.net/6/docs/ref/#state.EditorState.readOnly) getter, which is + consulted by commands and extensions that implement editing + functionality to determine whether they should apply. It + defaults to false, but when its highest-precedence value is + `true`, such functionality disables itself. + + Not to be confused with + [`EditorView.editable`](https://codemirror.net/6/docs/ref/#view.EditorView^editable), which + controls whether the editor's DOM is set to be editable (and + thus focusable). + */ + static readOnly: Facet; + /** + Returns true when the editor is + [configured](https://codemirror.net/6/docs/ref/#state.EditorState^readOnly) to be read-only. + */ + get readOnly(): boolean; + /** + Registers translation phrases. The + [`phrase`](https://codemirror.net/6/docs/ref/#state.EditorState.phrase) method will look through + all objects registered with this facet to find translations for + its argument. + */ + static phrases: Facet<{ + [key: string]: string; + }, readonly { + [key: string]: string; + }[]>; + /** + Look up a translation for the given phrase (via the + [`phrases`](https://codemirror.net/6/docs/ref/#state.EditorState^phrases) facet), or return the + original string if no translation is found. + + If additional arguments are passed, they will be inserted in + place of markers like `$1` (for the first value) and `$2`, etc. + A single `$` is equivalent to `$1`, and `$$` will produce a + literal dollar sign. + */ + phrase(phrase: string, ...insert: any[]): string; + /** + A facet used to register [language + data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) providers. + */ + static languageData: Facet<(state: EditorState, pos: number, side: 0 | 1 | -1) => readonly { + [name: string]: any; + }[], readonly ((state: EditorState, pos: number, side: 0 | 1 | -1) => readonly { + [name: string]: any; + }[])[]>; + /** + Find the values for a given language data field, provided by the + the [`languageData`](https://codemirror.net/6/docs/ref/#state.EditorState^languageData) facet. + */ + languageDataAt(name: string, pos: number, side?: -1 | 0 | 1): readonly T[]; + /** + Return a function that can categorize strings (expected to + represent a single [grapheme cluster](https://codemirror.net/6/docs/ref/#state.findClusterBreak)) + into one of: + + - Word (contains an alphanumeric character or a character + explicitly listed in the local language's `"wordChars"` + language data, which should be a string) + - Space (contains only whitespace) + - Other (anything else) + */ + charCategorizer(at: number): (char: string) => CharCategory; + /** + Find the word at the given position, meaning the range + containing all [word](https://codemirror.net/6/docs/ref/#state.CharCategory.Word) characters + around it. If no word characters are adjacent to the position, + this returns null. + */ + wordAt(pos: number): SelectionRange | null; + /** + Facet used to register change filters, which are called for each + transaction (unless explicitly + [disabled](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter)), and can suppress + part of the transaction's changes. + + Such a function can return `true` to indicate that it doesn't + want to do anything, `false` to completely stop the changes in + the transaction, or a set of ranges in which changes should be + suppressed. Such ranges are represented as an array of numbers, + with each pair of two numbers indicating the start and end of a + range. So for example `[10, 20, 100, 110]` suppresses changes + between 10 and 20, and between 100 and 110. + */ + static changeFilter: Facet<(tr: Transaction) => boolean | readonly number[], readonly ((tr: Transaction) => boolean | readonly number[])[]>; + /** + Facet used to register a hook that gets a chance to update or + replace transaction specs before they are applied. This will + only be applied for transactions that don't have + [`filter`](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter) set to `false`. You + can either return a single transaction spec (possibly the input + transaction), or an array of specs (which will be combined in + the same way as the arguments to + [`EditorState.update`](https://codemirror.net/6/docs/ref/#state.EditorState.update)). + + When possible, it is recommended to avoid accessing + [`Transaction.state`](https://codemirror.net/6/docs/ref/#state.Transaction.state) in a filter, + since it will force creation of a state that will then be + discarded again, if the transaction is actually filtered. + + (This functionality should be used with care. Indiscriminately + modifying transaction is likely to break something or degrade + the user experience.) + */ + static transactionFilter: Facet<(tr: Transaction) => TransactionSpec | readonly TransactionSpec[], readonly ((tr: Transaction) => TransactionSpec | readonly TransactionSpec[])[]>; + /** + This is a more limited form of + [`transactionFilter`](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter), + which can only add + [annotations](https://codemirror.net/6/docs/ref/#state.TransactionSpec.annotations) and + [effects](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects). _But_, this type + of filter runs even if the transaction has disabled regular + [filtering](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter), making it suitable + for effects that don't need to touch the changes or selection, + but do want to process every transaction. + + Extenders run _after_ filters, when both are present. + */ + static transactionExtender: Facet<(tr: Transaction) => Pick | null, readonly ((tr: Transaction) => Pick | null)[]>; +} + +/** +Subtype of [`Command`](https://codemirror.net/6/docs/ref/#view.Command) that doesn't require access +to the actual editor view. Mostly useful to define commands that +can be run and tested outside of a browser environment. +*/ +declare type StateCommand = (target: { + state: EditorState; + dispatch: (transaction: Transaction) => void; +}) => boolean; + +/** +Utility function for combining behaviors to fill in a config +object from an array of provided configs. `defaults` should hold +default values for all optional fields in `Config`. + +The function will, by default, error +when a field gets two values that aren't `===`-equal, but you can +provide combine functions per field to do something else. +*/ +declare function combineConfig(configs: readonly Partial[], defaults: Partial, // Should hold only the optional properties of Config, but I haven't managed to express that +combine?: { + [P in keyof Config]?: (first: Config[P], second: Config[P]) => Config[P]; +}): Config; + +/** +Each range is associated with a value, which must inherit from +this class. +*/ +declare abstract class RangeValue { + /** + Compare this value with another value. Used when comparing + rangesets. The default implementation compares by identity. + Unless you are only creating a fixed number of unique instances + of your value type, it is a good idea to implement this + properly. + */ + eq(other: RangeValue): boolean; + /** + The bias value at the start of the range. Determines how the + range is positioned relative to other ranges starting at this + position. Defaults to 0. + */ + startSide: number; + /** + The bias value at the end of the range. Defaults to 0. + */ + endSide: number; + /** + The mode with which the location of the range should be mapped + when its `from` and `to` are the same, to decide whether a + change deletes the range. Defaults to `MapMode.TrackDel`. + */ + mapMode: MapMode; + /** + Determines whether this value marks a point range. Regular + ranges affect the part of the document they cover, and are + meaningless when empty. Point ranges have a meaning on their + own. When non-empty, a point range is treated as atomic and + shadows any ranges contained in it. + */ + point: boolean; + /** + Create a [range](https://codemirror.net/6/docs/ref/#state.Range) with this value. + */ + range(from: number, to?: number): Range; +} +/** +A range associates a value with a range of positions. +*/ +declare class Range { + /** + The range's start position. + */ + readonly from: number; + /** + Its end position. + */ + readonly to: number; + /** + The value associated with this range. + */ + readonly value: T; + private constructor(); +} +/** +Collection of methods used when comparing range sets. +*/ +interface RangeComparator { + /** + Notifies the comparator that a range (in positions in the new + document) has the given sets of values associated with it, which + are different in the old (A) and new (B) sets. + */ + compareRange(from: number, to: number, activeA: T[], activeB: T[]): void; + /** + Notification for a changed (or inserted, or deleted) point range. + */ + comparePoint(from: number, to: number, pointA: T | null, pointB: T | null): void; +} +/** +Methods used when iterating over the spans created by a set of +ranges. The entire iterated range will be covered with either +`span` or `point` calls. +*/ +interface SpanIterator { + /** + Called for any ranges not covered by point decorations. `active` + holds the values that the range is marked with (and may be + empty). `openStart` indicates how many of those ranges are open + (continued) at the start of the span. + */ + span(from: number, to: number, active: readonly T[], openStart: number): void; + /** + Called when going over a point decoration. The active range + decorations that cover the point and have a higher precedence + are provided in `active`. The open count in `openStart` counts + the number of those ranges that started before the point and. If + the point started before the iterated range, `openStart` will be + `active.length + 1` to signal this. + */ + point(from: number, to: number, value: T, active: readonly T[], openStart: number, index: number): void; +} +/** +A range cursor is an object that moves to the next range every +time you call `next` on it. Note that, unlike ES6 iterators, these +start out pointing at the first element, so you should call `next` +only after reading the first range (if any). +*/ +interface RangeCursor { + /** + Move the iterator forward. + */ + next: () => void; + /** + The next range's value. Holds `null` when the cursor has reached + its end. + */ + value: T | null; + /** + The next range's start position. + */ + from: number; + /** + The next end position. + */ + to: number; +} +declare type RangeSetUpdate = { + /** + An array of ranges to add. If given, this should be sorted by + `from` position and `startSide` unless + [`sort`](https://codemirror.net/6/docs/ref/#state.RangeSet.update^updateSpec.sort) is given as + `true`. + */ + add?: readonly Range[]; + /** + Indicates whether the library should sort the ranges in `add`. + Defaults to `false`. + */ + sort?: boolean; + /** + Filter the ranges already in the set. Only those for which this + function returns `true` are kept. + */ + filter?: (from: number, to: number, value: T) => boolean; + /** + Can be used to limit the range on which the filter is + applied. Filtering only a small range, as opposed to the entire + set, can make updates cheaper. + */ + filterFrom?: number; + /** + The end position to apply the filter to. + */ + filterTo?: number; +}; +/** +A range set stores a collection of [ranges](https://codemirror.net/6/docs/ref/#state.Range) in a +way that makes them efficient to [map](https://codemirror.net/6/docs/ref/#state.RangeSet.map) and +[update](https://codemirror.net/6/docs/ref/#state.RangeSet.update). This is an immutable data +structure. +*/ +declare class RangeSet { + private constructor(); + /** + The number of ranges in the set. + */ + get size(): number; + /** + Update the range set, optionally adding new ranges or filtering + out existing ones. + + (Note: The type parameter is just there as a kludge to work + around TypeScript variance issues that prevented `RangeSet` + from being a subtype of `RangeSet` when `X` is a subtype of + `Y`.) + */ + update(updateSpec: RangeSetUpdate): RangeSet; + /** + Map this range set through a set of changes, return the new set. + */ + map(changes: ChangeDesc): RangeSet; + /** + Iterate over the ranges that touch the region `from` to `to`, + calling `f` for each. There is no guarantee that the ranges will + be reported in any specific order. When the callback returns + `false`, iteration stops. + */ + between(from: number, to: number, f: (from: number, to: number, value: T) => void | false): void; + /** + Iterate over the ranges in this set, in order, including all + ranges that end at or after `from`. + */ + iter(from?: number): RangeCursor; + /** + Iterate over the ranges in a collection of sets, in order, + starting from `from`. + */ + static iter(sets: readonly RangeSet[], from?: number): RangeCursor; + /** + Iterate over two groups of sets, calling methods on `comparator` + to notify it of possible differences. + */ + static compare(oldSets: readonly RangeSet[], newSets: readonly RangeSet[], + /** + This indicates how the underlying data changed between these + ranges, and is needed to synchronize the iteration. `from` and + `to` are coordinates in the _new_ space, after these changes. + */ + textDiff: ChangeDesc, comparator: RangeComparator, + /** + Can be used to ignore all non-point ranges, and points below + the given size. When -1, all ranges are compared. + */ + minPointSize?: number): void; + /** + Compare the contents of two groups of range sets, returning true + if they are equivalent in the given range. + */ + static eq(oldSets: readonly RangeSet[], newSets: readonly RangeSet[], from?: number, to?: number): boolean; + /** + Iterate over a group of range sets at the same time, notifying + the iterator about the ranges covering every given piece of + content. Returns the open count (see + [`SpanIterator.span`](https://codemirror.net/6/docs/ref/#state.SpanIterator.span)) at the end + of the iteration. + */ + static spans(sets: readonly RangeSet[], from: number, to: number, iterator: SpanIterator, + /** + When given and greater than -1, only points of at least this + size are taken into account. + */ + minPointSize?: number): number; + /** + Create a range set for the given range or array of ranges. By + default, this expects the ranges to be _sorted_ (by start + position and, if two start at the same position, + `value.startSide`). You can pass `true` as second argument to + cause the method to sort them. + */ + static of(ranges: readonly Range[] | Range, sort?: boolean): RangeSet; + /** + The empty set of ranges. + */ + static empty: RangeSet; +} +/** +A range set builder is a data structure that helps build up a +[range set](https://codemirror.net/6/docs/ref/#state.RangeSet) directly, without first allocating +an array of [`Range`](https://codemirror.net/6/docs/ref/#state.Range) objects. +*/ +declare class RangeSetBuilder { + private chunks; + private chunkPos; + private chunkStart; + private last; + private lastFrom; + private lastTo; + private from; + private to; + private value; + private maxPoint; + private setMaxPoint; + private nextLayer; + private finishChunk; + /** + Create an empty builder. + */ + constructor(); + /** + Add a range. Ranges should be added in sorted (by `from` and + `value.startSide`) order. + */ + add(from: number, to: number, value: T): void; + /** + Finish the range set. Returns the new set. The builder can't be + used anymore after this has been called. + */ + finish(): RangeSet; +} + +/** +Returns a next grapheme cluster break _after_ (not equal to) +`pos`, if `forward` is true, or before otherwise. Returns `pos` +itself if no further cluster break is available in the string. +Moves across surrogate pairs, extending characters (when +`includeExtending` is true), characters joined with zero-width +joiners, and flag emoji. +*/ +declare function findClusterBreak(str: string, pos: number, forward?: boolean, includeExtending?: boolean): number; +/** +Find the code point at the given position in a string (like the +[`codePointAt`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/codePointAt) +string method). +*/ +declare function codePointAt(str: string, pos: number): number; +/** +Given a Unicode codepoint, return the JavaScript string that +respresents it (like +[`String.fromCodePoint`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/fromCodePoint)). +*/ +declare function fromCodePoint(code: number): string; +/** +The amount of positions a character takes up a JavaScript string. +*/ +declare function codePointSize(code: number): 1 | 2; + +/** +Count the column position at the given offset into the string, +taking extending characters and tab size into account. +*/ +declare function countColumn(string: string, tabSize: number, to?: number): number; +/** +Find the offset that corresponds to the given column position in a +string, taking extending characters and tab size into account. By +default, the string length is returned when it is too short to +reach the column. Pass `strict` true to make it return -1 in that +situation. +*/ +declare function findColumn(string: string, col: number, tabSize: number, strict?: boolean): number; + +export { Annotation, AnnotationType, ChangeDesc, ChangeSet, ChangeSpec, CharCategory, Compartment, EditorSelection, EditorState, EditorStateConfig, Extension, Facet, Line, MapMode, Prec, Range, RangeComparator, RangeCursor, RangeSet, RangeSetBuilder, RangeValue, SelectionRange, SpanIterator, StateCommand, StateEffect, StateEffectType, StateField, Text, TextIterator, Transaction, TransactionSpec, codePointAt, codePointSize, combineConfig, countColumn, findClusterBreak, findColumn, fromCodePoint }; diff --git a/node_modules/@codemirror/state/dist/index.js b/node_modules/@codemirror/state/dist/index.js new file mode 100644 index 0000000000..2b8e9fc5ae --- /dev/null +++ b/node_modules/@codemirror/state/dist/index.js @@ -0,0 +1,3856 @@ +/** +The data structure for documents. @nonabstract +*/ +class Text { + /** + @internal + */ + constructor() { } + /** + Get the line description around the given position. + */ + lineAt(pos) { + if (pos < 0 || pos > this.length) + throw new RangeError(`Invalid position ${pos} in document of length ${this.length}`); + return this.lineInner(pos, false, 1, 0); + } + /** + Get the description for the given (1-based) line number. + */ + line(n) { + if (n < 1 || n > this.lines) + throw new RangeError(`Invalid line number ${n} in ${this.lines}-line document`); + return this.lineInner(n, true, 1, 0); + } + /** + Replace a range of the text with the given content. + */ + replace(from, to, text) { + let parts = []; + this.decompose(0, from, parts, 2 /* To */); + if (text.length) + text.decompose(0, text.length, parts, 1 /* From */ | 2 /* To */); + this.decompose(to, this.length, parts, 1 /* From */); + return TextNode.from(parts, this.length - (to - from) + text.length); + } + /** + Append another document to this one. + */ + append(other) { + return this.replace(this.length, this.length, other); + } + /** + Retrieve the text between the given points. + */ + slice(from, to = this.length) { + let parts = []; + this.decompose(from, to, parts, 0); + return TextNode.from(parts, to - from); + } + /** + Test whether this text is equal to another instance. + */ + eq(other) { + if (other == this) + return true; + if (other.length != this.length || other.lines != this.lines) + return false; + let start = this.scanIdentical(other, 1), end = this.length - this.scanIdentical(other, -1); + let a = new RawTextCursor(this), b = new RawTextCursor(other); + for (let skip = start, pos = start;;) { + a.next(skip); + b.next(skip); + skip = 0; + if (a.lineBreak != b.lineBreak || a.done != b.done || a.value != b.value) + return false; + pos += a.value.length; + if (a.done || pos >= end) + return true; + } + } + /** + Iterate over the text. When `dir` is `-1`, iteration happens + from end to start. This will return lines and the breaks between + them as separate strings. + */ + iter(dir = 1) { return new RawTextCursor(this, dir); } + /** + Iterate over a range of the text. When `from` > `to`, the + iterator will run in reverse. + */ + iterRange(from, to = this.length) { return new PartialTextCursor(this, from, to); } + /** + Return a cursor that iterates over the given range of lines, + _without_ returning the line breaks between, and yielding empty + strings for empty lines. + + When `from` and `to` are given, they should be 1-based line numbers. + */ + iterLines(from, to) { + let inner; + if (from == null) { + inner = this.iter(); + } + else { + if (to == null) + to = this.lines + 1; + let start = this.line(from).from; + inner = this.iterRange(start, Math.max(start, to == this.lines + 1 ? this.length : to <= 1 ? 0 : this.line(to - 1).to)); + } + return new LineCursor(inner); + } + /** + @internal + */ + toString() { return this.sliceString(0); } + /** + Convert the document to an array of lines (which can be + deserialized again via [`Text.of`](https://codemirror.net/6/docs/ref/#state.Text^of)). + */ + toJSON() { + let lines = []; + this.flatten(lines); + return lines; + } + /** + Create a `Text` instance for the given array of lines. + */ + static of(text) { + if (text.length == 0) + throw new RangeError("A document must have at least one line"); + if (text.length == 1 && !text[0]) + return Text.empty; + return text.length <= 32 /* Branch */ ? new TextLeaf(text) : TextNode.from(TextLeaf.split(text, [])); + } +} +// Leaves store an array of line strings. There are always line breaks +// between these strings. Leaves are limited in size and have to be +// contained in TextNode instances for bigger documents. +class TextLeaf extends Text { + constructor(text, length = textLength(text)) { + super(); + this.text = text; + this.length = length; + } + get lines() { return this.text.length; } + get children() { return null; } + lineInner(target, isLine, line, offset) { + for (let i = 0;; i++) { + let string = this.text[i], end = offset + string.length; + if ((isLine ? line : end) >= target) + return new Line(offset, end, line, string); + offset = end + 1; + line++; + } + } + decompose(from, to, target, open) { + let text = from <= 0 && to >= this.length ? this + : new TextLeaf(sliceText(this.text, from, to), Math.min(to, this.length) - Math.max(0, from)); + if (open & 1 /* From */) { + let prev = target.pop(); + let joined = appendText(text.text, prev.text.slice(), 0, text.length); + if (joined.length <= 32 /* Branch */) { + target.push(new TextLeaf(joined, prev.length + text.length)); + } + else { + let mid = joined.length >> 1; + target.push(new TextLeaf(joined.slice(0, mid)), new TextLeaf(joined.slice(mid))); + } + } + else { + target.push(text); + } + } + replace(from, to, text) { + if (!(text instanceof TextLeaf)) + return super.replace(from, to, text); + let lines = appendText(this.text, appendText(text.text, sliceText(this.text, 0, from)), to); + let newLen = this.length + text.length - (to - from); + if (lines.length <= 32 /* Branch */) + return new TextLeaf(lines, newLen); + return TextNode.from(TextLeaf.split(lines, []), newLen); + } + sliceString(from, to = this.length, lineSep = "\n") { + let result = ""; + for (let pos = 0, i = 0; pos <= to && i < this.text.length; i++) { + let line = this.text[i], end = pos + line.length; + if (pos > from && i) + result += lineSep; + if (from < end && to > pos) + result += line.slice(Math.max(0, from - pos), to - pos); + pos = end + 1; + } + return result; + } + flatten(target) { + for (let line of this.text) + target.push(line); + } + scanIdentical() { return 0; } + static split(text, target) { + let part = [], len = -1; + for (let line of text) { + part.push(line); + len += line.length + 1; + if (part.length == 32 /* Branch */) { + target.push(new TextLeaf(part, len)); + part = []; + len = -1; + } + } + if (len > -1) + target.push(new TextLeaf(part, len)); + return target; + } +} +// Nodes provide the tree structure of the `Text` type. They store a +// number of other nodes or leaves, taking care to balance themselves +// on changes. There are implied line breaks _between_ the children of +// a node (but not before the first or after the last child). +class TextNode extends Text { + constructor(children, length) { + super(); + this.children = children; + this.length = length; + this.lines = 0; + for (let child of children) + this.lines += child.lines; + } + lineInner(target, isLine, line, offset) { + for (let i = 0;; i++) { + let child = this.children[i], end = offset + child.length, endLine = line + child.lines - 1; + if ((isLine ? endLine : end) >= target) + return child.lineInner(target, isLine, line, offset); + offset = end + 1; + line = endLine + 1; + } + } + decompose(from, to, target, open) { + for (let i = 0, pos = 0; pos <= to && i < this.children.length; i++) { + let child = this.children[i], end = pos + child.length; + if (from <= end && to >= pos) { + let childOpen = open & ((pos <= from ? 1 /* From */ : 0) | (end >= to ? 2 /* To */ : 0)); + if (pos >= from && end <= to && !childOpen) + target.push(child); + else + child.decompose(from - pos, to - pos, target, childOpen); + } + pos = end + 1; + } + } + replace(from, to, text) { + if (text.lines < this.lines) + for (let i = 0, pos = 0; i < this.children.length; i++) { + let child = this.children[i], end = pos + child.length; + // Fast path: if the change only affects one child and the + // child's size remains in the acceptable range, only update + // that child + if (from >= pos && to <= end) { + let updated = child.replace(from - pos, to - pos, text); + let totalLines = this.lines - child.lines + updated.lines; + if (updated.lines < (totalLines >> (5 /* BranchShift */ - 1)) && + updated.lines > (totalLines >> (5 /* BranchShift */ + 1))) { + let copy = this.children.slice(); + copy[i] = updated; + return new TextNode(copy, this.length - (to - from) + text.length); + } + return super.replace(pos, end, updated); + } + pos = end + 1; + } + return super.replace(from, to, text); + } + sliceString(from, to = this.length, lineSep = "\n") { + let result = ""; + for (let i = 0, pos = 0; i < this.children.length && pos <= to; i++) { + let child = this.children[i], end = pos + child.length; + if (pos > from && i) + result += lineSep; + if (from < end && to > pos) + result += child.sliceString(from - pos, to - pos, lineSep); + pos = end + 1; + } + return result; + } + flatten(target) { + for (let child of this.children) + child.flatten(target); + } + scanIdentical(other, dir) { + if (!(other instanceof TextNode)) + return 0; + let length = 0; + let [iA, iB, eA, eB] = dir > 0 ? [0, 0, this.children.length, other.children.length] + : [this.children.length - 1, other.children.length - 1, -1, -1]; + for (;; iA += dir, iB += dir) { + if (iA == eA || iB == eB) + return length; + let chA = this.children[iA], chB = other.children[iB]; + if (chA != chB) + return length + chA.scanIdentical(chB, dir); + length += chA.length + 1; + } + } + static from(children, length = children.reduce((l, ch) => l + ch.length + 1, -1)) { + let lines = 0; + for (let ch of children) + lines += ch.lines; + if (lines < 32 /* Branch */) { + let flat = []; + for (let ch of children) + ch.flatten(flat); + return new TextLeaf(flat, length); + } + let chunk = Math.max(32 /* Branch */, lines >> 5 /* BranchShift */), maxChunk = chunk << 1, minChunk = chunk >> 1; + let chunked = [], currentLines = 0, currentLen = -1, currentChunk = []; + function add(child) { + let last; + if (child.lines > maxChunk && child instanceof TextNode) { + for (let node of child.children) + add(node); + } + else if (child.lines > minChunk && (currentLines > minChunk || !currentLines)) { + flush(); + chunked.push(child); + } + else if (child instanceof TextLeaf && currentLines && + (last = currentChunk[currentChunk.length - 1]) instanceof TextLeaf && + child.lines + last.lines <= 32 /* Branch */) { + currentLines += child.lines; + currentLen += child.length + 1; + currentChunk[currentChunk.length - 1] = new TextLeaf(last.text.concat(child.text), last.length + 1 + child.length); + } + else { + if (currentLines + child.lines > chunk) + flush(); + currentLines += child.lines; + currentLen += child.length + 1; + currentChunk.push(child); + } + } + function flush() { + if (currentLines == 0) + return; + chunked.push(currentChunk.length == 1 ? currentChunk[0] : TextNode.from(currentChunk, currentLen)); + currentLen = -1; + currentLines = currentChunk.length = 0; + } + for (let child of children) + add(child); + flush(); + return chunked.length == 1 ? chunked[0] : new TextNode(chunked, length); + } +} +Text.empty = /*@__PURE__*/new TextLeaf([""], 0); +function textLength(text) { + let length = -1; + for (let line of text) + length += line.length + 1; + return length; +} +function appendText(text, target, from = 0, to = 1e9) { + for (let pos = 0, i = 0, first = true; i < text.length && pos <= to; i++) { + let line = text[i], end = pos + line.length; + if (end >= from) { + if (end > to) + line = line.slice(0, to - pos); + if (pos < from) + line = line.slice(from - pos); + if (first) { + target[target.length - 1] += line; + first = false; + } + else + target.push(line); + } + pos = end + 1; + } + return target; +} +function sliceText(text, from, to) { + return appendText(text, [""], from, to); +} +class RawTextCursor { + constructor(text, dir = 1) { + this.dir = dir; + this.done = false; + this.lineBreak = false; + this.value = ""; + this.nodes = [text]; + this.offsets = [dir > 0 ? 1 : (text instanceof TextLeaf ? text.text.length : text.children.length) << 1]; + } + nextInner(skip, dir) { + this.done = this.lineBreak = false; + for (;;) { + let last = this.nodes.length - 1; + let top = this.nodes[last], offsetValue = this.offsets[last], offset = offsetValue >> 1; + let size = top instanceof TextLeaf ? top.text.length : top.children.length; + if (offset == (dir > 0 ? size : 0)) { + if (last == 0) { + this.done = true; + this.value = ""; + return this; + } + if (dir > 0) + this.offsets[last - 1]++; + this.nodes.pop(); + this.offsets.pop(); + } + else if ((offsetValue & 1) == (dir > 0 ? 0 : 1)) { + this.offsets[last] += dir; + if (skip == 0) { + this.lineBreak = true; + this.value = "\n"; + return this; + } + skip--; + } + else if (top instanceof TextLeaf) { + // Move to the next string + let next = top.text[offset + (dir < 0 ? -1 : 0)]; + this.offsets[last] += dir; + if (next.length > Math.max(0, skip)) { + this.value = skip == 0 ? next : dir > 0 ? next.slice(skip) : next.slice(0, next.length - skip); + return this; + } + skip -= next.length; + } + else { + let next = top.children[offset + (dir < 0 ? -1 : 0)]; + if (skip > next.length) { + skip -= next.length; + this.offsets[last] += dir; + } + else { + if (dir < 0) + this.offsets[last]--; + this.nodes.push(next); + this.offsets.push(dir > 0 ? 1 : (next instanceof TextLeaf ? next.text.length : next.children.length) << 1); + } + } + } + } + next(skip = 0) { + if (skip < 0) { + this.nextInner(-skip, (-this.dir)); + skip = this.value.length; + } + return this.nextInner(skip, this.dir); + } +} +class PartialTextCursor { + constructor(text, start, end) { + this.value = ""; + this.done = false; + this.cursor = new RawTextCursor(text, start > end ? -1 : 1); + this.pos = start > end ? text.length : 0; + this.from = Math.min(start, end); + this.to = Math.max(start, end); + } + nextInner(skip, dir) { + if (dir < 0 ? this.pos <= this.from : this.pos >= this.to) { + this.value = ""; + this.done = true; + return this; + } + skip += Math.max(0, dir < 0 ? this.pos - this.to : this.from - this.pos); + let limit = dir < 0 ? this.pos - this.from : this.to - this.pos; + if (skip > limit) + skip = limit; + limit -= skip; + let { value } = this.cursor.next(skip); + this.pos += (value.length + skip) * dir; + this.value = value.length <= limit ? value : dir < 0 ? value.slice(value.length - limit) : value.slice(0, limit); + this.done = !this.value; + return this; + } + next(skip = 0) { + if (skip < 0) + skip = Math.max(skip, this.from - this.pos); + else if (skip > 0) + skip = Math.min(skip, this.to - this.pos); + return this.nextInner(skip, this.cursor.dir); + } + get lineBreak() { return this.cursor.lineBreak && this.value != ""; } +} +class LineCursor { + constructor(inner) { + this.inner = inner; + this.afterBreak = true; + this.value = ""; + this.done = false; + } + next(skip = 0) { + let { done, lineBreak, value } = this.inner.next(skip); + if (done) { + this.done = true; + this.value = ""; + } + else if (lineBreak) { + if (this.afterBreak) { + this.value = ""; + } + else { + this.afterBreak = true; + this.next(); + } + } + else { + this.value = value; + this.afterBreak = false; + } + return this; + } + get lineBreak() { return false; } +} +if (typeof Symbol != "undefined") { + Text.prototype[Symbol.iterator] = function () { return this.iter(); }; + RawTextCursor.prototype[Symbol.iterator] = PartialTextCursor.prototype[Symbol.iterator] = + LineCursor.prototype[Symbol.iterator] = function () { return this; }; +} +/** +This type describes a line in the document. It is created +on-demand when lines are [queried](https://codemirror.net/6/docs/ref/#state.Text.lineAt). +*/ +class Line { + /** + @internal + */ + constructor( + /** + The position of the start of the line. + */ + from, + /** + The position at the end of the line (_before_ the line break, + or at the end of document for the last line). + */ + to, + /** + This line's line number (1-based). + */ + number, + /** + The line's content. + */ + text) { + this.from = from; + this.to = to; + this.number = number; + this.text = text; + } + /** + The length of the line (not including any line break after it). + */ + get length() { return this.to - this.from; } +} + +// Compressed representation of the Grapheme_Cluster_Break=Extend +// information from +// http://www.unicode.org/Public/13.0.0/ucd/auxiliary/GraphemeBreakProperty.txt. +// Each pair of elements represents a range, as an offet from the +// previous range and a length. Numbers are in base-36, with the empty +// string being a shorthand for 1. +let extend = /*@__PURE__*/"lc,34,7n,7,7b,19,,,,2,,2,,,20,b,1c,l,g,,2t,7,2,6,2,2,,4,z,,u,r,2j,b,1m,9,9,,o,4,,9,,3,,5,17,3,3b,f,,w,1j,,,,4,8,4,,3,7,a,2,t,,1m,,,,2,4,8,,9,,a,2,q,,2,2,1l,,4,2,4,2,2,3,3,,u,2,3,,b,2,1l,,4,5,,2,4,,k,2,m,6,,,1m,,,2,,4,8,,7,3,a,2,u,,1n,,,,c,,9,,14,,3,,1l,3,5,3,,4,7,2,b,2,t,,1m,,2,,2,,3,,5,2,7,2,b,2,s,2,1l,2,,,2,4,8,,9,,a,2,t,,20,,4,,2,3,,,8,,29,,2,7,c,8,2q,,2,9,b,6,22,2,r,,,,,,1j,e,,5,,2,5,b,,10,9,,2u,4,,6,,2,2,2,p,2,4,3,g,4,d,,2,2,6,,f,,jj,3,qa,3,t,3,t,2,u,2,1s,2,,7,8,,2,b,9,,19,3,3b,2,y,,3a,3,4,2,9,,6,3,63,2,2,,1m,,,7,,,,,2,8,6,a,2,,1c,h,1r,4,1c,7,,,5,,14,9,c,2,w,4,2,2,,3,1k,,,2,3,,,3,1m,8,2,2,48,3,,d,,7,4,,6,,3,2,5i,1m,,5,ek,,5f,x,2da,3,3x,,2o,w,fe,6,2x,2,n9w,4,,a,w,2,28,2,7k,,3,,4,,p,2,5,,47,2,q,i,d,,12,8,p,b,1a,3,1c,,2,4,2,2,13,,1v,6,2,2,2,2,c,,8,,1b,,1f,,,3,2,2,5,2,,,16,2,8,,6m,,2,,4,,fn4,,kh,g,g,g,a6,2,gt,,6a,,45,5,1ae,3,,2,5,4,14,3,4,,4l,2,fx,4,ar,2,49,b,4w,,1i,f,1k,3,1d,4,2,2,1x,3,10,5,,8,1q,,c,2,1g,9,a,4,2,,2n,3,2,,,2,6,,4g,,3,8,l,2,1l,2,,,,,m,,e,7,3,5,5f,8,2,3,,,n,,29,,2,6,,,2,,,2,,2,6j,,2,4,6,2,,2,r,2,2d,8,2,,,2,2y,,,,2,6,,,2t,3,2,4,,5,77,9,,2,6t,,a,2,,,4,,40,4,2,2,4,,w,a,14,6,2,4,8,,9,6,2,3,1a,d,,2,ba,7,,6,,,2a,m,2,7,,2,,2,3e,6,3,,,2,,7,,,20,2,3,,,,9n,2,f0b,5,1n,7,t4,,1r,4,29,,f5k,2,43q,,,3,4,5,8,8,2,7,u,4,44,3,1iz,1j,4,1e,8,,e,,m,5,,f,11s,7,,h,2,7,,2,,5,79,7,c5,4,15s,7,31,7,240,5,gx7k,2o,3k,6o".split(",").map(s => s ? parseInt(s, 36) : 1); +// Convert offsets into absolute values +for (let i = 1; i < extend.length; i++) + extend[i] += extend[i - 1]; +function isExtendingChar(code) { + for (let i = 1; i < extend.length; i += 2) + if (extend[i] > code) + return extend[i - 1] <= code; + return false; +} +function isRegionalIndicator(code) { + return code >= 0x1F1E6 && code <= 0x1F1FF; +} +const ZWJ = 0x200d; +/** +Returns a next grapheme cluster break _after_ (not equal to) +`pos`, if `forward` is true, or before otherwise. Returns `pos` +itself if no further cluster break is available in the string. +Moves across surrogate pairs, extending characters (when +`includeExtending` is true), characters joined with zero-width +joiners, and flag emoji. +*/ +function findClusterBreak(str, pos, forward = true, includeExtending = true) { + return (forward ? nextClusterBreak : prevClusterBreak)(str, pos, includeExtending); +} +function nextClusterBreak(str, pos, includeExtending) { + if (pos == str.length) + return pos; + // If pos is in the middle of a surrogate pair, move to its start + if (pos && surrogateLow(str.charCodeAt(pos)) && surrogateHigh(str.charCodeAt(pos - 1))) + pos--; + let prev = codePointAt(str, pos); + pos += codePointSize(prev); + while (pos < str.length) { + let next = codePointAt(str, pos); + if (prev == ZWJ || next == ZWJ || includeExtending && isExtendingChar(next)) { + pos += codePointSize(next); + prev = next; + } + else if (isRegionalIndicator(next)) { + let countBefore = 0, i = pos - 2; + while (i >= 0 && isRegionalIndicator(codePointAt(str, i))) { + countBefore++; + i -= 2; + } + if (countBefore % 2 == 0) + break; + else + pos += 2; + } + else { + break; + } + } + return pos; +} +function prevClusterBreak(str, pos, includeExtending) { + while (pos > 0) { + let found = nextClusterBreak(str, pos - 2, includeExtending); + if (found < pos) + return found; + pos--; + } + return 0; +} +function surrogateLow(ch) { return ch >= 0xDC00 && ch < 0xE000; } +function surrogateHigh(ch) { return ch >= 0xD800 && ch < 0xDC00; } +/** +Find the code point at the given position in a string (like the +[`codePointAt`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/codePointAt) +string method). +*/ +function codePointAt(str, pos) { + let code0 = str.charCodeAt(pos); + if (!surrogateHigh(code0) || pos + 1 == str.length) + return code0; + let code1 = str.charCodeAt(pos + 1); + if (!surrogateLow(code1)) + return code0; + return ((code0 - 0xd800) << 10) + (code1 - 0xdc00) + 0x10000; +} +/** +Given a Unicode codepoint, return the JavaScript string that +respresents it (like +[`String.fromCodePoint`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/fromCodePoint)). +*/ +function fromCodePoint(code) { + if (code <= 0xffff) + return String.fromCharCode(code); + code -= 0x10000; + return String.fromCharCode((code >> 10) + 0xd800, (code & 1023) + 0xdc00); +} +/** +The amount of positions a character takes up a JavaScript string. +*/ +function codePointSize(code) { return code < 0x10000 ? 1 : 2; } + +const DefaultSplit = /\r\n?|\n/; +/** +Distinguishes different ways in which positions can be mapped. +*/ +var MapMode = /*@__PURE__*/(function (MapMode) { + /** + Map a position to a valid new position, even when its context + was deleted. + */ + MapMode[MapMode["Simple"] = 0] = "Simple"; + /** + Return null if deletion happens across the position. + */ + MapMode[MapMode["TrackDel"] = 1] = "TrackDel"; + /** + Return null if the character _before_ the position is deleted. + */ + MapMode[MapMode["TrackBefore"] = 2] = "TrackBefore"; + /** + Return null if the character _after_ the position is deleted. + */ + MapMode[MapMode["TrackAfter"] = 3] = "TrackAfter"; +return MapMode})(MapMode || (MapMode = {})); +/** +A change description is a variant of [change set](https://codemirror.net/6/docs/ref/#state.ChangeSet) +that doesn't store the inserted text. As such, it can't be +applied, but is cheaper to store and manipulate. +*/ +class ChangeDesc { + // Sections are encoded as pairs of integers. The first is the + // length in the current document, and the second is -1 for + // unaffected sections, and the length of the replacement content + // otherwise. So an insertion would be (0, n>0), a deletion (n>0, + // 0), and a replacement two positive numbers. + /** + @internal + */ + constructor( + /** + @internal + */ + sections) { + this.sections = sections; + } + /** + The length of the document before the change. + */ + get length() { + let result = 0; + for (let i = 0; i < this.sections.length; i += 2) + result += this.sections[i]; + return result; + } + /** + The length of the document after the change. + */ + get newLength() { + let result = 0; + for (let i = 0; i < this.sections.length; i += 2) { + let ins = this.sections[i + 1]; + result += ins < 0 ? this.sections[i] : ins; + } + return result; + } + /** + False when there are actual changes in this set. + */ + get empty() { return this.sections.length == 0 || this.sections.length == 2 && this.sections[1] < 0; } + /** + Iterate over the unchanged parts left by these changes. `posA` + provides the position of the range in the old document, `posB` + the new position in the changed document. + */ + iterGaps(f) { + for (let i = 0, posA = 0, posB = 0; i < this.sections.length;) { + let len = this.sections[i++], ins = this.sections[i++]; + if (ins < 0) { + f(posA, posB, len); + posB += len; + } + else { + posB += ins; + } + posA += len; + } + } + /** + Iterate over the ranges changed by these changes. (See + [`ChangeSet.iterChanges`](https://codemirror.net/6/docs/ref/#state.ChangeSet.iterChanges) for a + variant that also provides you with the inserted text.) + `fromA`/`toA` provides the extent of the change in the starting + document, `fromB`/`toB` the extent of the replacement in the + changed document. + + When `individual` is true, adjacent changes (which are kept + separate for [position mapping](https://codemirror.net/6/docs/ref/#state.ChangeDesc.mapPos)) are + reported separately. + */ + iterChangedRanges(f, individual = false) { + iterChanges(this, f, individual); + } + /** + Get a description of the inverted form of these changes. + */ + get invertedDesc() { + let sections = []; + for (let i = 0; i < this.sections.length;) { + let len = this.sections[i++], ins = this.sections[i++]; + if (ins < 0) + sections.push(len, ins); + else + sections.push(ins, len); + } + return new ChangeDesc(sections); + } + /** + Compute the combined effect of applying another set of changes + after this one. The length of the document after this set should + match the length before `other`. + */ + composeDesc(other) { return this.empty ? other : other.empty ? this : composeSets(this, other); } + /** + Map this description, which should start with the same document + as `other`, over another set of changes, so that it can be + applied after it. When `before` is true, map as if the changes + in `other` happened before the ones in `this`. + */ + mapDesc(other, before = false) { return other.empty ? this : mapSet(this, other, before); } + mapPos(pos, assoc = -1, mode = MapMode.Simple) { + let posA = 0, posB = 0; + for (let i = 0; i < this.sections.length;) { + let len = this.sections[i++], ins = this.sections[i++], endA = posA + len; + if (ins < 0) { + if (endA > pos) + return posB + (pos - posA); + posB += len; + } + else { + if (mode != MapMode.Simple && endA >= pos && + (mode == MapMode.TrackDel && posA < pos && endA > pos || + mode == MapMode.TrackBefore && posA < pos || + mode == MapMode.TrackAfter && endA > pos)) + return null; + if (endA > pos || endA == pos && assoc < 0 && !len) + return pos == posA || assoc < 0 ? posB : posB + ins; + posB += ins; + } + posA = endA; + } + if (pos > posA) + throw new RangeError(`Position ${pos} is out of range for changeset of length ${posA}`); + return posB; + } + /** + Check whether these changes touch a given range. When one of the + changes entirely covers the range, the string `"cover"` is + returned. + */ + touchesRange(from, to = from) { + for (let i = 0, pos = 0; i < this.sections.length && pos <= to;) { + let len = this.sections[i++], ins = this.sections[i++], end = pos + len; + if (ins >= 0 && pos <= to && end >= from) + return pos < from && end > to ? "cover" : true; + pos = end; + } + return false; + } + /** + @internal + */ + toString() { + let result = ""; + for (let i = 0; i < this.sections.length;) { + let len = this.sections[i++], ins = this.sections[i++]; + result += (result ? " " : "") + len + (ins >= 0 ? ":" + ins : ""); + } + return result; + } + /** + Serialize this change desc to a JSON-representable value. + */ + toJSON() { return this.sections; } + /** + Create a change desc from its JSON representation (as produced + by [`toJSON`](https://codemirror.net/6/docs/ref/#state.ChangeDesc.toJSON). + */ + static fromJSON(json) { + if (!Array.isArray(json) || json.length % 2 || json.some(a => typeof a != "number")) + throw new RangeError("Invalid JSON representation of ChangeDesc"); + return new ChangeDesc(json); + } + /** + @internal + */ + static create(sections) { return new ChangeDesc(sections); } +} +/** +A change set represents a group of modifications to a document. It +stores the document length, and can only be applied to documents +with exactly that length. +*/ +class ChangeSet extends ChangeDesc { + constructor(sections, + /** + @internal + */ + inserted) { + super(sections); + this.inserted = inserted; + } + /** + Apply the changes to a document, returning the modified + document. + */ + apply(doc) { + if (this.length != doc.length) + throw new RangeError("Applying change set to a document with the wrong length"); + iterChanges(this, (fromA, toA, fromB, _toB, text) => doc = doc.replace(fromB, fromB + (toA - fromA), text), false); + return doc; + } + mapDesc(other, before = false) { return mapSet(this, other, before, true); } + /** + Given the document as it existed _before_ the changes, return a + change set that represents the inverse of this set, which could + be used to go from the document created by the changes back to + the document as it existed before the changes. + */ + invert(doc) { + let sections = this.sections.slice(), inserted = []; + for (let i = 0, pos = 0; i < sections.length; i += 2) { + let len = sections[i], ins = sections[i + 1]; + if (ins >= 0) { + sections[i] = ins; + sections[i + 1] = len; + let index = i >> 1; + while (inserted.length < index) + inserted.push(Text.empty); + inserted.push(len ? doc.slice(pos, pos + len) : Text.empty); + } + pos += len; + } + return new ChangeSet(sections, inserted); + } + /** + Combine two subsequent change sets into a single set. `other` + must start in the document produced by `this`. If `this` goes + `docA` → `docB` and `other` represents `docB` → `docC`, the + returned value will represent the change `docA` → `docC`. + */ + compose(other) { return this.empty ? other : other.empty ? this : composeSets(this, other, true); } + /** + Given another change set starting in the same document, maps this + change set over the other, producing a new change set that can be + applied to the document produced by applying `other`. When + `before` is `true`, order changes as if `this` comes before + `other`, otherwise (the default) treat `other` as coming first. + + Given two changes `A` and `B`, `A.compose(B.map(A))` and + `B.compose(A.map(B, true))` will produce the same document. This + provides a basic form of [operational + transformation](https://en.wikipedia.org/wiki/Operational_transformation), + and can be used for collaborative editing. + */ + map(other, before = false) { return other.empty ? this : mapSet(this, other, before, true); } + /** + Iterate over the changed ranges in the document, calling `f` for + each, with the range in the original document (`fromA`-`toA`) + and the range that replaces it in the new document + (`fromB`-`toB`). + + When `individual` is true, adjacent changes are reported + separately. + */ + iterChanges(f, individual = false) { + iterChanges(this, f, individual); + } + /** + Get a [change description](https://codemirror.net/6/docs/ref/#state.ChangeDesc) for this change + set. + */ + get desc() { return ChangeDesc.create(this.sections); } + /** + @internal + */ + filter(ranges) { + let resultSections = [], resultInserted = [], filteredSections = []; + let iter = new SectionIter(this); + done: for (let i = 0, pos = 0;;) { + let next = i == ranges.length ? 1e9 : ranges[i++]; + while (pos < next || pos == next && iter.len == 0) { + if (iter.done) + break done; + let len = Math.min(iter.len, next - pos); + addSection(filteredSections, len, -1); + let ins = iter.ins == -1 ? -1 : iter.off == 0 ? iter.ins : 0; + addSection(resultSections, len, ins); + if (ins > 0) + addInsert(resultInserted, resultSections, iter.text); + iter.forward(len); + pos += len; + } + let end = ranges[i++]; + while (pos < end) { + if (iter.done) + break done; + let len = Math.min(iter.len, end - pos); + addSection(resultSections, len, -1); + addSection(filteredSections, len, iter.ins == -1 ? -1 : iter.off == 0 ? iter.ins : 0); + iter.forward(len); + pos += len; + } + } + return { changes: new ChangeSet(resultSections, resultInserted), + filtered: ChangeDesc.create(filteredSections) }; + } + /** + Serialize this change set to a JSON-representable value. + */ + toJSON() { + let parts = []; + for (let i = 0; i < this.sections.length; i += 2) { + let len = this.sections[i], ins = this.sections[i + 1]; + if (ins < 0) + parts.push(len); + else if (ins == 0) + parts.push([len]); + else + parts.push([len].concat(this.inserted[i >> 1].toJSON())); + } + return parts; + } + /** + Create a change set for the given changes, for a document of the + given length, using `lineSep` as line separator. + */ + static of(changes, length, lineSep) { + let sections = [], inserted = [], pos = 0; + let total = null; + function flush(force = false) { + if (!force && !sections.length) + return; + if (pos < length) + addSection(sections, length - pos, -1); + let set = new ChangeSet(sections, inserted); + total = total ? total.compose(set.map(total)) : set; + sections = []; + inserted = []; + pos = 0; + } + function process(spec) { + if (Array.isArray(spec)) { + for (let sub of spec) + process(sub); + } + else if (spec instanceof ChangeSet) { + if (spec.length != length) + throw new RangeError(`Mismatched change set length (got ${spec.length}, expected ${length})`); + flush(); + total = total ? total.compose(spec.map(total)) : spec; + } + else { + let { from, to = from, insert } = spec; + if (from > to || from < 0 || to > length) + throw new RangeError(`Invalid change range ${from} to ${to} (in doc of length ${length})`); + let insText = !insert ? Text.empty : typeof insert == "string" ? Text.of(insert.split(lineSep || DefaultSplit)) : insert; + let insLen = insText.length; + if (from == to && insLen == 0) + return; + if (from < pos) + flush(); + if (from > pos) + addSection(sections, from - pos, -1); + addSection(sections, to - from, insLen); + addInsert(inserted, sections, insText); + pos = to; + } + } + process(changes); + flush(!total); + return total; + } + /** + Create an empty changeset of the given length. + */ + static empty(length) { + return new ChangeSet(length ? [length, -1] : [], []); + } + /** + Create a changeset from its JSON representation (as produced by + [`toJSON`](https://codemirror.net/6/docs/ref/#state.ChangeSet.toJSON). + */ + static fromJSON(json) { + if (!Array.isArray(json)) + throw new RangeError("Invalid JSON representation of ChangeSet"); + let sections = [], inserted = []; + for (let i = 0; i < json.length; i++) { + let part = json[i]; + if (typeof part == "number") { + sections.push(part, -1); + } + else if (!Array.isArray(part) || typeof part[0] != "number" || part.some((e, i) => i && typeof e != "string")) { + throw new RangeError("Invalid JSON representation of ChangeSet"); + } + else if (part.length == 1) { + sections.push(part[0], 0); + } + else { + while (inserted.length < i) + inserted.push(Text.empty); + inserted[i] = Text.of(part.slice(1)); + sections.push(part[0], inserted[i].length); + } + } + return new ChangeSet(sections, inserted); + } + /** + @internal + */ + static createSet(sections, inserted) { + return new ChangeSet(sections, inserted); + } +} +function addSection(sections, len, ins, forceJoin = false) { + if (len == 0 && ins <= 0) + return; + let last = sections.length - 2; + if (last >= 0 && ins <= 0 && ins == sections[last + 1]) + sections[last] += len; + else if (len == 0 && sections[last] == 0) + sections[last + 1] += ins; + else if (forceJoin) { + sections[last] += len; + sections[last + 1] += ins; + } + else + sections.push(len, ins); +} +function addInsert(values, sections, value) { + if (value.length == 0) + return; + let index = (sections.length - 2) >> 1; + if (index < values.length) { + values[values.length - 1] = values[values.length - 1].append(value); + } + else { + while (values.length < index) + values.push(Text.empty); + values.push(value); + } +} +function iterChanges(desc, f, individual) { + let inserted = desc.inserted; + for (let posA = 0, posB = 0, i = 0; i < desc.sections.length;) { + let len = desc.sections[i++], ins = desc.sections[i++]; + if (ins < 0) { + posA += len; + posB += len; + } + else { + let endA = posA, endB = posB, text = Text.empty; + for (;;) { + endA += len; + endB += ins; + if (ins && inserted) + text = text.append(inserted[(i - 2) >> 1]); + if (individual || i == desc.sections.length || desc.sections[i + 1] < 0) + break; + len = desc.sections[i++]; + ins = desc.sections[i++]; + } + f(posA, endA, posB, endB, text); + posA = endA; + posB = endB; + } + } +} +function mapSet(setA, setB, before, mkSet = false) { + let sections = [], insert = mkSet ? [] : null; + let a = new SectionIter(setA), b = new SectionIter(setB); + for (let posA = 0, posB = 0;;) { + if (a.ins == -1) { + posA += a.len; + a.next(); + } + else if (b.ins == -1 && posB < posA) { + let skip = Math.min(b.len, posA - posB); + b.forward(skip); + addSection(sections, skip, -1); + posB += skip; + } + else if (b.ins >= 0 && (a.done || posB < posA || posB == posA && (b.len < a.len || b.len == a.len && !before))) { + addSection(sections, b.ins, -1); + while (posA > posB && !a.done && posA + a.len < posB + b.len) { + posA += a.len; + a.next(); + } + posB += b.len; + b.next(); + } + else if (a.ins >= 0) { + let len = 0, end = posA + a.len; + for (;;) { + if (b.ins >= 0 && posB > posA && posB + b.len < end) { + len += b.ins; + posB += b.len; + b.next(); + } + else if (b.ins == -1 && posB < end) { + let skip = Math.min(b.len, end - posB); + len += skip; + b.forward(skip); + posB += skip; + } + else { + break; + } + } + addSection(sections, len, a.ins); + if (insert) + addInsert(insert, sections, a.text); + posA = end; + a.next(); + } + else if (a.done && b.done) { + return insert ? ChangeSet.createSet(sections, insert) : ChangeDesc.create(sections); + } + else { + throw new Error("Mismatched change set lengths"); + } + } +} +function composeSets(setA, setB, mkSet = false) { + let sections = []; + let insert = mkSet ? [] : null; + let a = new SectionIter(setA), b = new SectionIter(setB); + for (let open = false;;) { + if (a.done && b.done) { + return insert ? ChangeSet.createSet(sections, insert) : ChangeDesc.create(sections); + } + else if (a.ins == 0) { // Deletion in A + addSection(sections, a.len, 0, open); + a.next(); + } + else if (b.len == 0 && !b.done) { // Insertion in B + addSection(sections, 0, b.ins, open); + if (insert) + addInsert(insert, sections, b.text); + b.next(); + } + else if (a.done || b.done) { + throw new Error("Mismatched change set lengths"); + } + else { + let len = Math.min(a.len2, b.len), sectionLen = sections.length; + if (a.ins == -1) { + let insB = b.ins == -1 ? -1 : b.off ? 0 : b.ins; + addSection(sections, len, insB, open); + if (insert && insB) + addInsert(insert, sections, b.text); + } + else if (b.ins == -1) { + addSection(sections, a.off ? 0 : a.len, len, open); + if (insert) + addInsert(insert, sections, a.textBit(len)); + } + else { + addSection(sections, a.off ? 0 : a.len, b.off ? 0 : b.ins, open); + if (insert && !b.off) + addInsert(insert, sections, b.text); + } + open = (a.ins > len || b.ins >= 0 && b.len > len) && (open || sections.length > sectionLen); + a.forward2(len); + b.forward(len); + } + } +} +class SectionIter { + constructor(set) { + this.set = set; + this.i = 0; + this.next(); + } + next() { + let { sections } = this.set; + if (this.i < sections.length) { + this.len = sections[this.i++]; + this.ins = sections[this.i++]; + } + else { + this.len = 0; + this.ins = -2; + } + this.off = 0; + } + get done() { return this.ins == -2; } + get len2() { return this.ins < 0 ? this.len : this.ins; } + get text() { + let { inserted } = this.set, index = (this.i - 2) >> 1; + return index >= inserted.length ? Text.empty : inserted[index]; + } + textBit(len) { + let { inserted } = this.set, index = (this.i - 2) >> 1; + return index >= inserted.length && !len ? Text.empty + : inserted[index].slice(this.off, len == null ? undefined : this.off + len); + } + forward(len) { + if (len == this.len) + this.next(); + else { + this.len -= len; + this.off += len; + } + } + forward2(len) { + if (this.ins == -1) + this.forward(len); + else if (len == this.ins) + this.next(); + else { + this.ins -= len; + this.off += len; + } + } +} + +/** +A single selection range. When +[`allowMultipleSelections`](https://codemirror.net/6/docs/ref/#state.EditorState^allowMultipleSelections) +is enabled, a [selection](https://codemirror.net/6/docs/ref/#state.EditorSelection) may hold +multiple ranges. By default, selections hold exactly one range. +*/ +class SelectionRange { + constructor( + /** + The lower boundary of the range. + */ + from, + /** + The upper boundary of the range. + */ + to, flags) { + this.from = from; + this.to = to; + this.flags = flags; + } + /** + The anchor of the range—the side that doesn't move when you + extend it. + */ + get anchor() { return this.flags & 16 /* Inverted */ ? this.to : this.from; } + /** + The head of the range, which is moved when the range is + [extended](https://codemirror.net/6/docs/ref/#state.SelectionRange.extend). + */ + get head() { return this.flags & 16 /* Inverted */ ? this.from : this.to; } + /** + True when `anchor` and `head` are at the same position. + */ + get empty() { return this.from == this.to; } + /** + If this is a cursor that is explicitly associated with the + character on one of its sides, this returns the side. -1 means + the character before its position, 1 the character after, and 0 + means no association. + */ + get assoc() { return this.flags & 4 /* AssocBefore */ ? -1 : this.flags & 8 /* AssocAfter */ ? 1 : 0; } + /** + The bidirectional text level associated with this cursor, if + any. + */ + get bidiLevel() { + let level = this.flags & 3 /* BidiLevelMask */; + return level == 3 ? null : level; + } + /** + The goal column (stored vertical offset) associated with a + cursor. This is used to preserve the vertical position when + [moving](https://codemirror.net/6/docs/ref/#view.EditorView.moveVertically) across + lines of different length. + */ + get goalColumn() { + let value = this.flags >> 5 /* GoalColumnOffset */; + return value == 33554431 /* NoGoalColumn */ ? undefined : value; + } + /** + Map this range through a change, producing a valid range in the + updated document. + */ + map(change, assoc = -1) { + let from, to; + if (this.empty) { + from = to = change.mapPos(this.from, assoc); + } + else { + from = change.mapPos(this.from, 1); + to = change.mapPos(this.to, -1); + } + return from == this.from && to == this.to ? this : new SelectionRange(from, to, this.flags); + } + /** + Extend this range to cover at least `from` to `to`. + */ + extend(from, to = from) { + if (from <= this.anchor && to >= this.anchor) + return EditorSelection.range(from, to); + let head = Math.abs(from - this.anchor) > Math.abs(to - this.anchor) ? from : to; + return EditorSelection.range(this.anchor, head); + } + /** + Compare this range to another range. + */ + eq(other) { + return this.anchor == other.anchor && this.head == other.head; + } + /** + Return a JSON-serializable object representing the range. + */ + toJSON() { return { anchor: this.anchor, head: this.head }; } + /** + Convert a JSON representation of a range to a `SelectionRange` + instance. + */ + static fromJSON(json) { + if (!json || typeof json.anchor != "number" || typeof json.head != "number") + throw new RangeError("Invalid JSON representation for SelectionRange"); + return EditorSelection.range(json.anchor, json.head); + } + /** + @internal + */ + static create(from, to, flags) { + return new SelectionRange(from, to, flags); + } +} +/** +An editor selection holds one or more selection ranges. +*/ +class EditorSelection { + constructor( + /** + The ranges in the selection, sorted by position. Ranges cannot + overlap (but they may touch, if they aren't empty). + */ + ranges, + /** + The index of the _main_ range in the selection (which is + usually the range that was added last). + */ + mainIndex) { + this.ranges = ranges; + this.mainIndex = mainIndex; + } + /** + Map a selection through a change. Used to adjust the selection + position for changes. + */ + map(change, assoc = -1) { + if (change.empty) + return this; + return EditorSelection.create(this.ranges.map(r => r.map(change, assoc)), this.mainIndex); + } + /** + Compare this selection to another selection. + */ + eq(other) { + if (this.ranges.length != other.ranges.length || + this.mainIndex != other.mainIndex) + return false; + for (let i = 0; i < this.ranges.length; i++) + if (!this.ranges[i].eq(other.ranges[i])) + return false; + return true; + } + /** + Get the primary selection range. Usually, you should make sure + your code applies to _all_ ranges, by using methods like + [`changeByRange`](https://codemirror.net/6/docs/ref/#state.EditorState.changeByRange). + */ + get main() { return this.ranges[this.mainIndex]; } + /** + Make sure the selection only has one range. Returns a selection + holding only the main range from this selection. + */ + asSingle() { + return this.ranges.length == 1 ? this : new EditorSelection([this.main], 0); + } + /** + Extend this selection with an extra range. + */ + addRange(range, main = true) { + return EditorSelection.create([range].concat(this.ranges), main ? 0 : this.mainIndex + 1); + } + /** + Replace a given range with another range, and then normalize the + selection to merge and sort ranges if necessary. + */ + replaceRange(range, which = this.mainIndex) { + let ranges = this.ranges.slice(); + ranges[which] = range; + return EditorSelection.create(ranges, this.mainIndex); + } + /** + Convert this selection to an object that can be serialized to + JSON. + */ + toJSON() { + return { ranges: this.ranges.map(r => r.toJSON()), main: this.mainIndex }; + } + /** + Create a selection from a JSON representation. + */ + static fromJSON(json) { + if (!json || !Array.isArray(json.ranges) || typeof json.main != "number" || json.main >= json.ranges.length) + throw new RangeError("Invalid JSON representation for EditorSelection"); + return new EditorSelection(json.ranges.map((r) => SelectionRange.fromJSON(r)), json.main); + } + /** + Create a selection holding a single range. + */ + static single(anchor, head = anchor) { + return new EditorSelection([EditorSelection.range(anchor, head)], 0); + } + /** + Sort and merge the given set of ranges, creating a valid + selection. + */ + static create(ranges, mainIndex = 0) { + if (ranges.length == 0) + throw new RangeError("A selection needs at least one range"); + for (let pos = 0, i = 0; i < ranges.length; i++) { + let range = ranges[i]; + if (range.empty ? range.from <= pos : range.from < pos) + return EditorSelection.normalized(ranges.slice(), mainIndex); + pos = range.to; + } + return new EditorSelection(ranges, mainIndex); + } + /** + Create a cursor selection range at the given position. You can + safely ignore the optional arguments in most situations. + */ + static cursor(pos, assoc = 0, bidiLevel, goalColumn) { + return SelectionRange.create(pos, pos, (assoc == 0 ? 0 : assoc < 0 ? 4 /* AssocBefore */ : 8 /* AssocAfter */) | + (bidiLevel == null ? 3 : Math.min(2, bidiLevel)) | + ((goalColumn !== null && goalColumn !== void 0 ? goalColumn : 33554431 /* NoGoalColumn */) << 5 /* GoalColumnOffset */)); + } + /** + Create a selection range. + */ + static range(anchor, head, goalColumn) { + let goal = (goalColumn !== null && goalColumn !== void 0 ? goalColumn : 33554431 /* NoGoalColumn */) << 5 /* GoalColumnOffset */; + return head < anchor ? SelectionRange.create(head, anchor, 16 /* Inverted */ | goal | 8 /* AssocAfter */) + : SelectionRange.create(anchor, head, goal | (head > anchor ? 4 /* AssocBefore */ : 0)); + } + /** + @internal + */ + static normalized(ranges, mainIndex = 0) { + let main = ranges[mainIndex]; + ranges.sort((a, b) => a.from - b.from); + mainIndex = ranges.indexOf(main); + for (let i = 1; i < ranges.length; i++) { + let range = ranges[i], prev = ranges[i - 1]; + if (range.empty ? range.from <= prev.to : range.from < prev.to) { + let from = prev.from, to = Math.max(range.to, prev.to); + if (i <= mainIndex) + mainIndex--; + ranges.splice(--i, 2, range.anchor > range.head ? EditorSelection.range(to, from) : EditorSelection.range(from, to)); + } + } + return new EditorSelection(ranges, mainIndex); + } +} +function checkSelection(selection, docLength) { + for (let range of selection.ranges) + if (range.to > docLength) + throw new RangeError("Selection points outside of document"); +} + +let nextID = 0; +/** +A facet is a labeled value that is associated with an editor +state. It takes inputs from any number of extensions, and combines +those into a single output value. + +Examples of uses of facets are the [tab +size](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize), [editor +attributes](https://codemirror.net/6/docs/ref/#view.EditorView^editorAttributes), and [update +listeners](https://codemirror.net/6/docs/ref/#view.EditorView^updateListener). +*/ +class Facet { + constructor( + /** + @internal + */ + combine, + /** + @internal + */ + compareInput, + /** + @internal + */ + compare, isStatic, + /** + @internal + */ + extensions) { + this.combine = combine; + this.compareInput = compareInput; + this.compare = compare; + this.isStatic = isStatic; + this.extensions = extensions; + /** + @internal + */ + this.id = nextID++; + this.default = combine([]); + } + /** + Define a new facet. + */ + static define(config = {}) { + return new Facet(config.combine || ((a) => a), config.compareInput || ((a, b) => a === b), config.compare || (!config.combine ? sameArray : (a, b) => a === b), !!config.static, config.enables); + } + /** + Returns an extension that adds the given value to this facet. + */ + of(value) { + return new FacetProvider([], this, 0 /* Static */, value); + } + /** + Create an extension that computes a value for the facet from a + state. You must take care to declare the parts of the state that + this value depends on, since your function is only called again + for a new state when one of those parts changed. + + In cases where your value depends only on a single field, you'll + want to use the [`from`](https://codemirror.net/6/docs/ref/#state.Facet.from) method instead. + */ + compute(deps, get) { + if (this.isStatic) + throw new Error("Can't compute a static facet"); + return new FacetProvider(deps, this, 1 /* Single */, get); + } + /** + Create an extension that computes zero or more values for this + facet from a state. + */ + computeN(deps, get) { + if (this.isStatic) + throw new Error("Can't compute a static facet"); + return new FacetProvider(deps, this, 2 /* Multi */, get); + } + from(field, get) { + if (!get) + get = x => x; + return this.compute([field], state => get(state.field(field))); + } +} +function sameArray(a, b) { + return a == b || a.length == b.length && a.every((e, i) => e === b[i]); +} +class FacetProvider { + constructor(dependencies, facet, type, value) { + this.dependencies = dependencies; + this.facet = facet; + this.type = type; + this.value = value; + this.id = nextID++; + } + dynamicSlot(addresses) { + var _a; + let getter = this.value; + let compare = this.facet.compareInput; + let id = this.id, idx = addresses[id] >> 1, multi = this.type == 2 /* Multi */; + let depDoc = false, depSel = false, depAddrs = []; + for (let dep of this.dependencies) { + if (dep == "doc") + depDoc = true; + else if (dep == "selection") + depSel = true; + else if ((((_a = addresses[dep.id]) !== null && _a !== void 0 ? _a : 1) & 1) == 0) + depAddrs.push(addresses[dep.id]); + } + return { + create(state) { + state.values[idx] = getter(state); + return 1 /* Changed */; + }, + update(state, tr) { + if ((depDoc && tr.docChanged) || (depSel && (tr.docChanged || tr.selection)) || ensureAll(state, depAddrs)) { + let newVal = getter(state); + if (multi ? !compareArray(newVal, state.values[idx], compare) : !compare(newVal, state.values[idx])) { + state.values[idx] = newVal; + return 1 /* Changed */; + } + } + return 0; + }, + reconfigure: (state, oldState) => { + let newVal = getter(state); + let oldAddr = oldState.config.address[id]; + if (oldAddr != null) { + let oldVal = getAddr(oldState, oldAddr); + if (this.dependencies.every(dep => { + return dep instanceof Facet ? oldState.facet(dep) === state.facet(dep) : + dep instanceof StateField ? oldState.field(dep, false) == state.field(dep, false) : true; + }) || (multi ? compareArray(newVal, oldVal, compare) : compare(newVal, oldVal))) { + state.values[idx] = oldVal; + return 0; + } + } + state.values[idx] = newVal; + return 1 /* Changed */; + } + }; + } +} +function compareArray(a, b, compare) { + if (a.length != b.length) + return false; + for (let i = 0; i < a.length; i++) + if (!compare(a[i], b[i])) + return false; + return true; +} +function ensureAll(state, addrs) { + let changed = false; + for (let addr of addrs) + if (ensureAddr(state, addr) & 1 /* Changed */) + changed = true; + return changed; +} +function dynamicFacetSlot(addresses, facet, providers) { + let providerAddrs = providers.map(p => addresses[p.id]); + let providerTypes = providers.map(p => p.type); + let dynamic = providerAddrs.filter(p => !(p & 1)); + let idx = addresses[facet.id] >> 1; + function get(state) { + let values = []; + for (let i = 0; i < providerAddrs.length; i++) { + let value = getAddr(state, providerAddrs[i]); + if (providerTypes[i] == 2 /* Multi */) + for (let val of value) + values.push(val); + else + values.push(value); + } + return facet.combine(values); + } + return { + create(state) { + for (let addr of providerAddrs) + ensureAddr(state, addr); + state.values[idx] = get(state); + return 1 /* Changed */; + }, + update(state, tr) { + if (!ensureAll(state, dynamic)) + return 0; + let value = get(state); + if (facet.compare(value, state.values[idx])) + return 0; + state.values[idx] = value; + return 1 /* Changed */; + }, + reconfigure(state, oldState) { + let depChanged = ensureAll(state, providerAddrs); + let oldProviders = oldState.config.facets[facet.id], oldValue = oldState.facet(facet); + if (oldProviders && !depChanged && sameArray(providers, oldProviders)) { + state.values[idx] = oldValue; + return 0; + } + let value = get(state); + if (facet.compare(value, oldValue)) { + state.values[idx] = oldValue; + return 0; + } + state.values[idx] = value; + return 1 /* Changed */; + } + }; +} +const initField = /*@__PURE__*/Facet.define({ static: true }); +/** +Fields can store additional information in an editor state, and +keep it in sync with the rest of the state. +*/ +class StateField { + constructor( + /** + @internal + */ + id, createF, updateF, compareF, + /** + @internal + */ + spec) { + this.id = id; + this.createF = createF; + this.updateF = updateF; + this.compareF = compareF; + this.spec = spec; + /** + @internal + */ + this.provides = undefined; + } + /** + Define a state field. + */ + static define(config) { + let field = new StateField(nextID++, config.create, config.update, config.compare || ((a, b) => a === b), config); + if (config.provide) + field.provides = config.provide(field); + return field; + } + create(state) { + let init = state.facet(initField).find(i => i.field == this); + return ((init === null || init === void 0 ? void 0 : init.create) || this.createF)(state); + } + /** + @internal + */ + slot(addresses) { + let idx = addresses[this.id] >> 1; + return { + create: (state) => { + state.values[idx] = this.create(state); + return 1 /* Changed */; + }, + update: (state, tr) => { + let oldVal = state.values[idx]; + let value = this.updateF(oldVal, tr); + if (this.compareF(oldVal, value)) + return 0; + state.values[idx] = value; + return 1 /* Changed */; + }, + reconfigure: (state, oldState) => { + if (oldState.config.address[this.id] != null) { + state.values[idx] = oldState.field(this); + return 0; + } + state.values[idx] = this.create(state); + return 1 /* Changed */; + } + }; + } + /** + Returns an extension that enables this field and overrides the + way it is initialized. Can be useful when you need to provide a + non-default starting value for the field. + */ + init(create) { + return [this, initField.of({ field: this, create })]; + } + /** + State field instances can be used as + [`Extension`](https://codemirror.net/6/docs/ref/#state.Extension) values to enable the field in a + given state. + */ + get extension() { return this; } +} +const Prec_ = { lowest: 4, low: 3, default: 2, high: 1, highest: 0 }; +function prec(value) { + return (ext) => new PrecExtension(ext, value); +} +/** +By default extensions are registered in the order they are found +in the flattened form of nested array that was provided. +Individual extension values can be assigned a precedence to +override this. Extensions that do not have a precedence set get +the precedence of the nearest parent with a precedence, or +[`default`](https://codemirror.net/6/docs/ref/#state.Prec.default) if there is no such parent. The +final ordering of extensions is determined by first sorting by +precedence and then by order within each precedence. +*/ +const Prec = { + /** + The highest precedence level, for extensions that should end up + near the start of the precedence ordering. + */ + highest: /*@__PURE__*/prec(Prec_.highest), + /** + A higher-than-default precedence, for extensions that should + come before those with default precedence. + */ + high: /*@__PURE__*/prec(Prec_.high), + /** + The default precedence, which is also used for extensions + without an explicit precedence. + */ + default: /*@__PURE__*/prec(Prec_.default), + /** + A lower-than-default precedence. + */ + low: /*@__PURE__*/prec(Prec_.low), + /** + The lowest precedence level. Meant for things that should end up + near the end of the extension order. + */ + lowest: /*@__PURE__*/prec(Prec_.lowest) +}; +class PrecExtension { + constructor(inner, prec) { + this.inner = inner; + this.prec = prec; + } +} +/** +Extension compartments can be used to make a configuration +dynamic. By [wrapping](https://codemirror.net/6/docs/ref/#state.Compartment.of) part of your +configuration in a compartment, you can later +[replace](https://codemirror.net/6/docs/ref/#state.Compartment.reconfigure) that part through a +transaction. +*/ +class Compartment { + /** + Create an instance of this compartment to add to your [state + configuration](https://codemirror.net/6/docs/ref/#state.EditorStateConfig.extensions). + */ + of(ext) { return new CompartmentInstance(this, ext); } + /** + Create an [effect](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) that + reconfigures this compartment. + */ + reconfigure(content) { + return Compartment.reconfigure.of({ compartment: this, extension: content }); + } + /** + Get the current content of the compartment in the state, or + `undefined` if it isn't present. + */ + get(state) { + return state.config.compartments.get(this); + } +} +class CompartmentInstance { + constructor(compartment, inner) { + this.compartment = compartment; + this.inner = inner; + } +} +class Configuration { + constructor(base, compartments, dynamicSlots, address, staticValues, facets) { + this.base = base; + this.compartments = compartments; + this.dynamicSlots = dynamicSlots; + this.address = address; + this.staticValues = staticValues; + this.facets = facets; + this.statusTemplate = []; + while (this.statusTemplate.length < dynamicSlots.length) + this.statusTemplate.push(0 /* Unresolved */); + } + staticFacet(facet) { + let addr = this.address[facet.id]; + return addr == null ? facet.default : this.staticValues[addr >> 1]; + } + static resolve(base, compartments, oldState) { + let fields = []; + let facets = Object.create(null); + let newCompartments = new Map(); + for (let ext of flatten(base, compartments, newCompartments)) { + if (ext instanceof StateField) + fields.push(ext); + else + (facets[ext.facet.id] || (facets[ext.facet.id] = [])).push(ext); + } + let address = Object.create(null); + let staticValues = []; + let dynamicSlots = []; + for (let field of fields) { + address[field.id] = dynamicSlots.length << 1; + dynamicSlots.push(a => field.slot(a)); + } + let oldFacets = oldState === null || oldState === void 0 ? void 0 : oldState.config.facets; + for (let id in facets) { + let providers = facets[id], facet = providers[0].facet; + let oldProviders = oldFacets && oldFacets[id] || []; + if (providers.every(p => p.type == 0 /* Static */)) { + address[facet.id] = (staticValues.length << 1) | 1; + if (sameArray(oldProviders, providers)) { + staticValues.push(oldState.facet(facet)); + } + else { + let value = facet.combine(providers.map(p => p.value)); + staticValues.push(oldState && facet.compare(value, oldState.facet(facet)) ? oldState.facet(facet) : value); + } + } + else { + for (let p of providers) { + if (p.type == 0 /* Static */) { + address[p.id] = (staticValues.length << 1) | 1; + staticValues.push(p.value); + } + else { + address[p.id] = dynamicSlots.length << 1; + dynamicSlots.push(a => p.dynamicSlot(a)); + } + } + address[facet.id] = dynamicSlots.length << 1; + dynamicSlots.push(a => dynamicFacetSlot(a, facet, providers)); + } + } + let dynamic = dynamicSlots.map(f => f(address)); + return new Configuration(base, newCompartments, dynamic, address, staticValues, facets); + } +} +function flatten(extension, compartments, newCompartments) { + let result = [[], [], [], [], []]; + let seen = new Map(); + function inner(ext, prec) { + let known = seen.get(ext); + if (known != null) { + if (known <= prec) + return; + let found = result[known].indexOf(ext); + if (found > -1) + result[known].splice(found, 1); + if (ext instanceof CompartmentInstance) + newCompartments.delete(ext.compartment); + } + seen.set(ext, prec); + if (Array.isArray(ext)) { + for (let e of ext) + inner(e, prec); + } + else if (ext instanceof CompartmentInstance) { + if (newCompartments.has(ext.compartment)) + throw new RangeError(`Duplicate use of compartment in extensions`); + let content = compartments.get(ext.compartment) || ext.inner; + newCompartments.set(ext.compartment, content); + inner(content, prec); + } + else if (ext instanceof PrecExtension) { + inner(ext.inner, ext.prec); + } + else if (ext instanceof StateField) { + result[prec].push(ext); + if (ext.provides) + inner(ext.provides, prec); + } + else if (ext instanceof FacetProvider) { + result[prec].push(ext); + if (ext.facet.extensions) + inner(ext.facet.extensions, prec); + } + else { + let content = ext.extension; + if (!content) + throw new Error(`Unrecognized extension value in extension set (${ext}). This sometimes happens because multiple instances of @codemirror/state are loaded, breaking instanceof checks.`); + inner(content, prec); + } + } + inner(extension, Prec_.default); + return result.reduce((a, b) => a.concat(b)); +} +function ensureAddr(state, addr) { + if (addr & 1) + return 2 /* Computed */; + let idx = addr >> 1; + let status = state.status[idx]; + if (status == 4 /* Computing */) + throw new Error("Cyclic dependency between fields and/or facets"); + if (status & 2 /* Computed */) + return status; + state.status[idx] = 4 /* Computing */; + let changed = state.computeSlot(state, state.config.dynamicSlots[idx]); + return state.status[idx] = 2 /* Computed */ | changed; +} +function getAddr(state, addr) { + return addr & 1 ? state.config.staticValues[addr >> 1] : state.values[addr >> 1]; +} + +const languageData = /*@__PURE__*/Facet.define(); +const allowMultipleSelections = /*@__PURE__*/Facet.define({ + combine: values => values.some(v => v), + static: true +}); +const lineSeparator = /*@__PURE__*/Facet.define({ + combine: values => values.length ? values[0] : undefined, + static: true +}); +const changeFilter = /*@__PURE__*/Facet.define(); +const transactionFilter = /*@__PURE__*/Facet.define(); +const transactionExtender = /*@__PURE__*/Facet.define(); +const readOnly = /*@__PURE__*/Facet.define({ + combine: values => values.length ? values[0] : false +}); + +/** +Annotations are tagged values that are used to add metadata to +transactions in an extensible way. They should be used to model +things that effect the entire transaction (such as its [time +stamp](https://codemirror.net/6/docs/ref/#state.Transaction^time) or information about its +[origin](https://codemirror.net/6/docs/ref/#state.Transaction^userEvent)). For effects that happen +_alongside_ the other changes made by the transaction, [state +effects](https://codemirror.net/6/docs/ref/#state.StateEffect) are more appropriate. +*/ +class Annotation { + /** + @internal + */ + constructor( + /** + The annotation type. + */ + type, + /** + The value of this annotation. + */ + value) { + this.type = type; + this.value = value; + } + /** + Define a new type of annotation. + */ + static define() { return new AnnotationType(); } +} +/** +Marker that identifies a type of [annotation](https://codemirror.net/6/docs/ref/#state.Annotation). +*/ +class AnnotationType { + /** + Create an instance of this annotation. + */ + of(value) { return new Annotation(this, value); } +} +/** +Representation of a type of state effect. Defined with +[`StateEffect.define`](https://codemirror.net/6/docs/ref/#state.StateEffect^define). +*/ +class StateEffectType { + /** + @internal + */ + constructor( + // The `any` types in these function types are there to work + // around TypeScript issue #37631, where the type guard on + // `StateEffect.is` mysteriously stops working when these properly + // have type `Value`. + /** + @internal + */ + map) { + this.map = map; + } + /** + Create a [state effect](https://codemirror.net/6/docs/ref/#state.StateEffect) instance of this + type. + */ + of(value) { return new StateEffect(this, value); } +} +/** +State effects can be used to represent additional effects +associated with a [transaction](https://codemirror.net/6/docs/ref/#state.Transaction.effects). They +are often useful to model changes to custom [state +fields](https://codemirror.net/6/docs/ref/#state.StateField), when those changes aren't implicit in +document or selection changes. +*/ +class StateEffect { + /** + @internal + */ + constructor( + /** + @internal + */ + type, + /** + The value of this effect. + */ + value) { + this.type = type; + this.value = value; + } + /** + Map this effect through a position mapping. Will return + `undefined` when that ends up deleting the effect. + */ + map(mapping) { + let mapped = this.type.map(this.value, mapping); + return mapped === undefined ? undefined : mapped == this.value ? this : new StateEffect(this.type, mapped); + } + /** + Tells you whether this effect object is of a given + [type](https://codemirror.net/6/docs/ref/#state.StateEffectType). + */ + is(type) { return this.type == type; } + /** + Define a new effect type. The type parameter indicates the type + of values that his effect holds. + */ + static define(spec = {}) { + return new StateEffectType(spec.map || (v => v)); + } + /** + Map an array of effects through a change set. + */ + static mapEffects(effects, mapping) { + if (!effects.length) + return effects; + let result = []; + for (let effect of effects) { + let mapped = effect.map(mapping); + if (mapped) + result.push(mapped); + } + return result; + } +} +/** +This effect can be used to reconfigure the root extensions of +the editor. Doing this will discard any extensions +[appended](https://codemirror.net/6/docs/ref/#state.StateEffect^appendConfig), but does not reset +the content of [reconfigured](https://codemirror.net/6/docs/ref/#state.Compartment.reconfigure) +compartments. +*/ +StateEffect.reconfigure = /*@__PURE__*/StateEffect.define(); +/** +Append extensions to the top-level configuration of the editor. +*/ +StateEffect.appendConfig = /*@__PURE__*/StateEffect.define(); +/** +Changes to the editor state are grouped into transactions. +Typically, a user action creates a single transaction, which may +contain any number of document changes, may change the selection, +or have other effects. Create a transaction by calling +[`EditorState.update`](https://codemirror.net/6/docs/ref/#state.EditorState.update), or immediately +dispatch one by calling +[`EditorView.dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch). +*/ +class Transaction { + constructor( + /** + The state from which the transaction starts. + */ + startState, + /** + The document changes made by this transaction. + */ + changes, + /** + The selection set by this transaction, or undefined if it + doesn't explicitly set a selection. + */ + selection, + /** + The effects added to the transaction. + */ + effects, + /** + @internal + */ + annotations, + /** + Whether the selection should be scrolled into view after this + transaction is dispatched. + */ + scrollIntoView) { + this.startState = startState; + this.changes = changes; + this.selection = selection; + this.effects = effects; + this.annotations = annotations; + this.scrollIntoView = scrollIntoView; + /** + @internal + */ + this._doc = null; + /** + @internal + */ + this._state = null; + if (selection) + checkSelection(selection, changes.newLength); + if (!annotations.some((a) => a.type == Transaction.time)) + this.annotations = annotations.concat(Transaction.time.of(Date.now())); + } + /** + @internal + */ + static create(startState, changes, selection, effects, annotations, scrollIntoView) { + return new Transaction(startState, changes, selection, effects, annotations, scrollIntoView); + } + /** + The new document produced by the transaction. Contrary to + [`.state`](https://codemirror.net/6/docs/ref/#state.Transaction.state)`.doc`, accessing this won't + force the entire new state to be computed right away, so it is + recommended that [transaction + filters](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter) use this getter + when they need to look at the new document. + */ + get newDoc() { + return this._doc || (this._doc = this.changes.apply(this.startState.doc)); + } + /** + The new selection produced by the transaction. If + [`this.selection`](https://codemirror.net/6/docs/ref/#state.Transaction.selection) is undefined, + this will [map](https://codemirror.net/6/docs/ref/#state.EditorSelection.map) the start state's + current selection through the changes made by the transaction. + */ + get newSelection() { + return this.selection || this.startState.selection.map(this.changes); + } + /** + The new state created by the transaction. Computed on demand + (but retained for subsequent access), so it is recommended not to + access it in [transaction + filters](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter) when possible. + */ + get state() { + if (!this._state) + this.startState.applyTransaction(this); + return this._state; + } + /** + Get the value of the given annotation type, if any. + */ + annotation(type) { + for (let ann of this.annotations) + if (ann.type == type) + return ann.value; + return undefined; + } + /** + Indicates whether the transaction changed the document. + */ + get docChanged() { return !this.changes.empty; } + /** + Indicates whether this transaction reconfigures the state + (through a [configuration compartment](https://codemirror.net/6/docs/ref/#state.Compartment) or + with a top-level configuration + [effect](https://codemirror.net/6/docs/ref/#state.StateEffect^reconfigure). + */ + get reconfigured() { return this.startState.config != this.state.config; } + /** + Returns true if the transaction has a [user + event](https://codemirror.net/6/docs/ref/#state.Transaction^userEvent) annotation that is equal to + or more specific than `event`. For example, if the transaction + has `"select.pointer"` as user event, `"select"` and + `"select.pointer"` will match it. + */ + isUserEvent(event) { + let e = this.annotation(Transaction.userEvent); + return !!(e && (e == event || e.length > event.length && e.slice(0, event.length) == event && e[event.length] == ".")); + } +} +/** +Annotation used to store transaction timestamps. Automatically +added to every transaction, holding `Date.now()`. +*/ +Transaction.time = /*@__PURE__*/Annotation.define(); +/** +Annotation used to associate a transaction with a user interface +event. Holds a string identifying the event, using a +dot-separated format to support attaching more specific +information. The events used by the core libraries are: + + - `"input"` when content is entered + - `"input.type"` for typed input + - `"input.type.compose"` for composition + - `"input.paste"` for pasted input + - `"input.drop"` when adding content with drag-and-drop + - `"input.complete"` when autocompleting + - `"delete"` when the user deletes content + - `"delete.selection"` when deleting the selection + - `"delete.forward"` when deleting forward from the selection + - `"delete.backward"` when deleting backward from the selection + - `"delete.cut"` when cutting to the clipboard + - `"move"` when content is moved + - `"move.drop"` when content is moved within the editor through drag-and-drop + - `"select"` when explicitly changing the selection + - `"select.pointer"` when selecting with a mouse or other pointing device + - `"undo"` and `"redo"` for history actions + +Use [`isUserEvent`](https://codemirror.net/6/docs/ref/#state.Transaction.isUserEvent) to check +whether the annotation matches a given event. +*/ +Transaction.userEvent = /*@__PURE__*/Annotation.define(); +/** +Annotation indicating whether a transaction should be added to +the undo history or not. +*/ +Transaction.addToHistory = /*@__PURE__*/Annotation.define(); +/** +Annotation indicating (when present and true) that a transaction +represents a change made by some other actor, not the user. This +is used, for example, to tag other people's changes in +collaborative editing. +*/ +Transaction.remote = /*@__PURE__*/Annotation.define(); +function joinRanges(a, b) { + let result = []; + for (let iA = 0, iB = 0;;) { + let from, to; + if (iA < a.length && (iB == b.length || b[iB] >= a[iA])) { + from = a[iA++]; + to = a[iA++]; + } + else if (iB < b.length) { + from = b[iB++]; + to = b[iB++]; + } + else + return result; + if (!result.length || result[result.length - 1] < from) + result.push(from, to); + else if (result[result.length - 1] < to) + result[result.length - 1] = to; + } +} +function mergeTransaction(a, b, sequential) { + var _a; + let mapForA, mapForB, changes; + if (sequential) { + mapForA = b.changes; + mapForB = ChangeSet.empty(b.changes.length); + changes = a.changes.compose(b.changes); + } + else { + mapForA = b.changes.map(a.changes); + mapForB = a.changes.mapDesc(b.changes, true); + changes = a.changes.compose(mapForA); + } + return { + changes, + selection: b.selection ? b.selection.map(mapForB) : (_a = a.selection) === null || _a === void 0 ? void 0 : _a.map(mapForA), + effects: StateEffect.mapEffects(a.effects, mapForA).concat(StateEffect.mapEffects(b.effects, mapForB)), + annotations: a.annotations.length ? a.annotations.concat(b.annotations) : b.annotations, + scrollIntoView: a.scrollIntoView || b.scrollIntoView + }; +} +function resolveTransactionInner(state, spec, docSize) { + let sel = spec.selection, annotations = asArray(spec.annotations); + if (spec.userEvent) + annotations = annotations.concat(Transaction.userEvent.of(spec.userEvent)); + return { + changes: spec.changes instanceof ChangeSet ? spec.changes + : ChangeSet.of(spec.changes || [], docSize, state.facet(lineSeparator)), + selection: sel && (sel instanceof EditorSelection ? sel : EditorSelection.single(sel.anchor, sel.head)), + effects: asArray(spec.effects), + annotations, + scrollIntoView: !!spec.scrollIntoView + }; +} +function resolveTransaction(state, specs, filter) { + let s = resolveTransactionInner(state, specs.length ? specs[0] : {}, state.doc.length); + if (specs.length && specs[0].filter === false) + filter = false; + for (let i = 1; i < specs.length; i++) { + if (specs[i].filter === false) + filter = false; + let seq = !!specs[i].sequential; + s = mergeTransaction(s, resolveTransactionInner(state, specs[i], seq ? s.changes.newLength : state.doc.length), seq); + } + let tr = Transaction.create(state, s.changes, s.selection, s.effects, s.annotations, s.scrollIntoView); + return extendTransaction(filter ? filterTransaction(tr) : tr); +} +// Finish a transaction by applying filters if necessary. +function filterTransaction(tr) { + let state = tr.startState; + // Change filters + let result = true; + for (let filter of state.facet(changeFilter)) { + let value = filter(tr); + if (value === false) { + result = false; + break; + } + if (Array.isArray(value)) + result = result === true ? value : joinRanges(result, value); + } + if (result !== true) { + let changes, back; + if (result === false) { + back = tr.changes.invertedDesc; + changes = ChangeSet.empty(state.doc.length); + } + else { + let filtered = tr.changes.filter(result); + changes = filtered.changes; + back = filtered.filtered.invertedDesc; + } + tr = Transaction.create(state, changes, tr.selection && tr.selection.map(back), StateEffect.mapEffects(tr.effects, back), tr.annotations, tr.scrollIntoView); + } + // Transaction filters + let filters = state.facet(transactionFilter); + for (let i = filters.length - 1; i >= 0; i--) { + let filtered = filters[i](tr); + if (filtered instanceof Transaction) + tr = filtered; + else if (Array.isArray(filtered) && filtered.length == 1 && filtered[0] instanceof Transaction) + tr = filtered[0]; + else + tr = resolveTransaction(state, asArray(filtered), false); + } + return tr; +} +function extendTransaction(tr) { + let state = tr.startState, extenders = state.facet(transactionExtender), spec = tr; + for (let i = extenders.length - 1; i >= 0; i--) { + let extension = extenders[i](tr); + if (extension && Object.keys(extension).length) + spec = mergeTransaction(tr, resolveTransactionInner(state, extension, tr.changes.newLength), true); + } + return spec == tr ? tr : Transaction.create(state, tr.changes, tr.selection, spec.effects, spec.annotations, spec.scrollIntoView); +} +const none = []; +function asArray(value) { + return value == null ? none : Array.isArray(value) ? value : [value]; +} + +/** +The categories produced by a [character +categorizer](https://codemirror.net/6/docs/ref/#state.EditorState.charCategorizer). These are used +do things like selecting by word. +*/ +var CharCategory = /*@__PURE__*/(function (CharCategory) { + /** + Word characters. + */ + CharCategory[CharCategory["Word"] = 0] = "Word"; + /** + Whitespace. + */ + CharCategory[CharCategory["Space"] = 1] = "Space"; + /** + Anything else. + */ + CharCategory[CharCategory["Other"] = 2] = "Other"; +return CharCategory})(CharCategory || (CharCategory = {})); +const nonASCIISingleCaseWordChar = /[\u00df\u0587\u0590-\u05f4\u0600-\u06ff\u3040-\u309f\u30a0-\u30ff\u3400-\u4db5\u4e00-\u9fcc\uac00-\ud7af]/; +let wordChar; +try { + wordChar = /*@__PURE__*/new RegExp("[\\p{Alphabetic}\\p{Number}_]", "u"); +} +catch (_) { } +function hasWordChar(str) { + if (wordChar) + return wordChar.test(str); + for (let i = 0; i < str.length; i++) { + let ch = str[i]; + if (/\w/.test(ch) || ch > "\x80" && (ch.toUpperCase() != ch.toLowerCase() || nonASCIISingleCaseWordChar.test(ch))) + return true; + } + return false; +} +function makeCategorizer(wordChars) { + return (char) => { + if (!/\S/.test(char)) + return CharCategory.Space; + if (hasWordChar(char)) + return CharCategory.Word; + for (let i = 0; i < wordChars.length; i++) + if (char.indexOf(wordChars[i]) > -1) + return CharCategory.Word; + return CharCategory.Other; + }; +} + +/** +The editor state class is a persistent (immutable) data structure. +To update a state, you [create](https://codemirror.net/6/docs/ref/#state.EditorState.update) a +[transaction](https://codemirror.net/6/docs/ref/#state.Transaction), which produces a _new_ state +instance, without modifying the original object. + +As such, _never_ mutate properties of a state directly. That'll +just break things. +*/ +class EditorState { + constructor( + /** + @internal + */ + config, + /** + The current document. + */ + doc, + /** + The current selection. + */ + selection, + /** + @internal + */ + values, computeSlot, tr) { + this.config = config; + this.doc = doc; + this.selection = selection; + this.values = values; + this.status = config.statusTemplate.slice(); + this.computeSlot = computeSlot; + // Fill in the computed state immediately, so that further queries + // for it made during the update return this state + if (tr) + tr._state = this; + for (let i = 0; i < this.config.dynamicSlots.length; i++) + ensureAddr(this, i << 1); + this.computeSlot = null; + } + field(field, require = true) { + let addr = this.config.address[field.id]; + if (addr == null) { + if (require) + throw new RangeError("Field is not present in this state"); + return undefined; + } + ensureAddr(this, addr); + return getAddr(this, addr); + } + /** + Create a [transaction](https://codemirror.net/6/docs/ref/#state.Transaction) that updates this + state. Any number of [transaction specs](https://codemirror.net/6/docs/ref/#state.TransactionSpec) + can be passed. Unless + [`sequential`](https://codemirror.net/6/docs/ref/#state.TransactionSpec.sequential) is set, the + [changes](https://codemirror.net/6/docs/ref/#state.TransactionSpec.changes) (if any) of each spec + are assumed to start in the _current_ document (not the document + produced by previous specs), and its + [selection](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection) and + [effects](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) are assumed to refer + to the document created by its _own_ changes. The resulting + transaction contains the combined effect of all the different + specs. For [selection](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection), later + specs take precedence over earlier ones. + */ + update(...specs) { + return resolveTransaction(this, specs, true); + } + /** + @internal + */ + applyTransaction(tr) { + let conf = this.config, { base, compartments } = conf; + for (let effect of tr.effects) { + if (effect.is(Compartment.reconfigure)) { + if (conf) { + compartments = new Map; + conf.compartments.forEach((val, key) => compartments.set(key, val)); + conf = null; + } + compartments.set(effect.value.compartment, effect.value.extension); + } + else if (effect.is(StateEffect.reconfigure)) { + conf = null; + base = effect.value; + } + else if (effect.is(StateEffect.appendConfig)) { + conf = null; + base = asArray(base).concat(effect.value); + } + } + let startValues; + if (!conf) { + conf = Configuration.resolve(base, compartments, this); + let intermediateState = new EditorState(conf, this.doc, this.selection, conf.dynamicSlots.map(() => null), (state, slot) => slot.reconfigure(state, this), null); + startValues = intermediateState.values; + } + else { + startValues = tr.startState.values.slice(); + } + new EditorState(conf, tr.newDoc, tr.newSelection, startValues, (state, slot) => slot.update(state, tr), tr); + } + /** + Create a [transaction spec](https://codemirror.net/6/docs/ref/#state.TransactionSpec) that + replaces every selection range with the given content. + */ + replaceSelection(text) { + if (typeof text == "string") + text = this.toText(text); + return this.changeByRange(range => ({ changes: { from: range.from, to: range.to, insert: text }, + range: EditorSelection.cursor(range.from + text.length) })); + } + /** + Create a set of changes and a new selection by running the given + function for each range in the active selection. The function + can return an optional set of changes (in the coordinate space + of the start document), plus an updated range (in the coordinate + space of the document produced by the call's own changes). This + method will merge all the changes and ranges into a single + changeset and selection, and return it as a [transaction + spec](https://codemirror.net/6/docs/ref/#state.TransactionSpec), which can be passed to + [`update`](https://codemirror.net/6/docs/ref/#state.EditorState.update). + */ + changeByRange(f) { + let sel = this.selection; + let result1 = f(sel.ranges[0]); + let changes = this.changes(result1.changes), ranges = [result1.range]; + let effects = asArray(result1.effects); + for (let i = 1; i < sel.ranges.length; i++) { + let result = f(sel.ranges[i]); + let newChanges = this.changes(result.changes), newMapped = newChanges.map(changes); + for (let j = 0; j < i; j++) + ranges[j] = ranges[j].map(newMapped); + let mapBy = changes.mapDesc(newChanges, true); + ranges.push(result.range.map(mapBy)); + changes = changes.compose(newMapped); + effects = StateEffect.mapEffects(effects, newMapped).concat(StateEffect.mapEffects(asArray(result.effects), mapBy)); + } + return { + changes, + selection: EditorSelection.create(ranges, sel.mainIndex), + effects + }; + } + /** + Create a [change set](https://codemirror.net/6/docs/ref/#state.ChangeSet) from the given change + description, taking the state's document length and line + separator into account. + */ + changes(spec = []) { + if (spec instanceof ChangeSet) + return spec; + return ChangeSet.of(spec, this.doc.length, this.facet(EditorState.lineSeparator)); + } + /** + Using the state's [line + separator](https://codemirror.net/6/docs/ref/#state.EditorState^lineSeparator), create a + [`Text`](https://codemirror.net/6/docs/ref/#state.Text) instance from the given string. + */ + toText(string) { + return Text.of(string.split(this.facet(EditorState.lineSeparator) || DefaultSplit)); + } + /** + Return the given range of the document as a string. + */ + sliceDoc(from = 0, to = this.doc.length) { + return this.doc.sliceString(from, to, this.lineBreak); + } + /** + Get the value of a state [facet](https://codemirror.net/6/docs/ref/#state.Facet). + */ + facet(facet) { + let addr = this.config.address[facet.id]; + if (addr == null) + return facet.default; + ensureAddr(this, addr); + return getAddr(this, addr); + } + /** + Convert this state to a JSON-serializable object. When custom + fields should be serialized, you can pass them in as an object + mapping property names (in the resulting object, which should + not use `doc` or `selection`) to fields. + */ + toJSON(fields) { + let result = { + doc: this.sliceDoc(), + selection: this.selection.toJSON() + }; + if (fields) + for (let prop in fields) { + let value = fields[prop]; + if (value instanceof StateField) + result[prop] = value.spec.toJSON(this.field(fields[prop]), this); + } + return result; + } + /** + Deserialize a state from its JSON representation. When custom + fields should be deserialized, pass the same object you passed + to [`toJSON`](https://codemirror.net/6/docs/ref/#state.EditorState.toJSON) when serializing as + third argument. + */ + static fromJSON(json, config = {}, fields) { + if (!json || typeof json.doc != "string") + throw new RangeError("Invalid JSON representation for EditorState"); + let fieldInit = []; + if (fields) + for (let prop in fields) { + let field = fields[prop], value = json[prop]; + fieldInit.push(field.init(state => field.spec.fromJSON(value, state))); + } + return EditorState.create({ + doc: json.doc, + selection: EditorSelection.fromJSON(json.selection), + extensions: config.extensions ? fieldInit.concat([config.extensions]) : fieldInit + }); + } + /** + Create a new state. You'll usually only need this when + initializing an editor—updated states are created by applying + transactions. + */ + static create(config = {}) { + let configuration = Configuration.resolve(config.extensions || [], new Map); + let doc = config.doc instanceof Text ? config.doc + : Text.of((config.doc || "").split(configuration.staticFacet(EditorState.lineSeparator) || DefaultSplit)); + let selection = !config.selection ? EditorSelection.single(0) + : config.selection instanceof EditorSelection ? config.selection + : EditorSelection.single(config.selection.anchor, config.selection.head); + checkSelection(selection, doc.length); + if (!configuration.staticFacet(allowMultipleSelections)) + selection = selection.asSingle(); + return new EditorState(configuration, doc, selection, configuration.dynamicSlots.map(() => null), (state, slot) => slot.create(state), null); + } + /** + The size (in columns) of a tab in the document, determined by + the [`tabSize`](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize) facet. + */ + get tabSize() { return this.facet(EditorState.tabSize); } + /** + Get the proper [line-break](https://codemirror.net/6/docs/ref/#state.EditorState^lineSeparator) + string for this state. + */ + get lineBreak() { return this.facet(EditorState.lineSeparator) || "\n"; } + /** + Returns true when the editor is + [configured](https://codemirror.net/6/docs/ref/#state.EditorState^readOnly) to be read-only. + */ + get readOnly() { return this.facet(readOnly); } + /** + Look up a translation for the given phrase (via the + [`phrases`](https://codemirror.net/6/docs/ref/#state.EditorState^phrases) facet), or return the + original string if no translation is found. + + If additional arguments are passed, they will be inserted in + place of markers like `$1` (for the first value) and `$2`, etc. + A single `$` is equivalent to `$1`, and `$$` will produce a + literal dollar sign. + */ + phrase(phrase, ...insert) { + for (let map of this.facet(EditorState.phrases)) + if (Object.prototype.hasOwnProperty.call(map, phrase)) { + phrase = map[phrase]; + break; + } + if (insert.length) + phrase = phrase.replace(/\$(\$|\d*)/g, (m, i) => { + if (i == "$") + return "$"; + let n = +(i || 1); + return n > insert.length ? m : insert[n - 1]; + }); + return phrase; + } + /** + Find the values for a given language data field, provided by the + the [`languageData`](https://codemirror.net/6/docs/ref/#state.EditorState^languageData) facet. + */ + languageDataAt(name, pos, side = -1) { + let values = []; + for (let provider of this.facet(languageData)) { + for (let result of provider(this, pos, side)) { + if (Object.prototype.hasOwnProperty.call(result, name)) + values.push(result[name]); + } + } + return values; + } + /** + Return a function that can categorize strings (expected to + represent a single [grapheme cluster](https://codemirror.net/6/docs/ref/#state.findClusterBreak)) + into one of: + + - Word (contains an alphanumeric character or a character + explicitly listed in the local language's `"wordChars"` + language data, which should be a string) + - Space (contains only whitespace) + - Other (anything else) + */ + charCategorizer(at) { + return makeCategorizer(this.languageDataAt("wordChars", at).join("")); + } + /** + Find the word at the given position, meaning the range + containing all [word](https://codemirror.net/6/docs/ref/#state.CharCategory.Word) characters + around it. If no word characters are adjacent to the position, + this returns null. + */ + wordAt(pos) { + let { text, from, length } = this.doc.lineAt(pos); + let cat = this.charCategorizer(pos); + let start = pos - from, end = pos - from; + while (start > 0) { + let prev = findClusterBreak(text, start, false); + if (cat(text.slice(prev, start)) != CharCategory.Word) + break; + start = prev; + } + while (end < length) { + let next = findClusterBreak(text, end); + if (cat(text.slice(end, next)) != CharCategory.Word) + break; + end = next; + } + return start == end ? null : EditorSelection.range(start + from, end + from); + } +} +/** +A facet that, when enabled, causes the editor to allow multiple +ranges to be selected. Be careful though, because by default the +editor relies on the native DOM selection, which cannot handle +multiple selections. An extension like +[`drawSelection`](https://codemirror.net/6/docs/ref/#view.drawSelection) can be used to make +secondary selections visible to the user. +*/ +EditorState.allowMultipleSelections = allowMultipleSelections; +/** +Configures the tab size to use in this state. The first +(highest-precedence) value of the facet is used. If no value is +given, this defaults to 4. +*/ +EditorState.tabSize = /*@__PURE__*/Facet.define({ + combine: values => values.length ? values[0] : 4 +}); +/** +The line separator to use. By default, any of `"\n"`, `"\r\n"` +and `"\r"` is treated as a separator when splitting lines, and +lines are joined with `"\n"`. + +When you configure a value here, only that precise separator +will be used, allowing you to round-trip documents through the +editor without normalizing line separators. +*/ +EditorState.lineSeparator = lineSeparator; +/** +This facet controls the value of the +[`readOnly`](https://codemirror.net/6/docs/ref/#state.EditorState.readOnly) getter, which is +consulted by commands and extensions that implement editing +functionality to determine whether they should apply. It +defaults to false, but when its highest-precedence value is +`true`, such functionality disables itself. + +Not to be confused with +[`EditorView.editable`](https://codemirror.net/6/docs/ref/#view.EditorView^editable), which +controls whether the editor's DOM is set to be editable (and +thus focusable). +*/ +EditorState.readOnly = readOnly; +/** +Registers translation phrases. The +[`phrase`](https://codemirror.net/6/docs/ref/#state.EditorState.phrase) method will look through +all objects registered with this facet to find translations for +its argument. +*/ +EditorState.phrases = /*@__PURE__*/Facet.define({ + compare(a, b) { + let kA = Object.keys(a), kB = Object.keys(b); + return kA.length == kB.length && kA.every(k => a[k] == b[k]); + } +}); +/** +A facet used to register [language +data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) providers. +*/ +EditorState.languageData = languageData; +/** +Facet used to register change filters, which are called for each +transaction (unless explicitly +[disabled](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter)), and can suppress +part of the transaction's changes. + +Such a function can return `true` to indicate that it doesn't +want to do anything, `false` to completely stop the changes in +the transaction, or a set of ranges in which changes should be +suppressed. Such ranges are represented as an array of numbers, +with each pair of two numbers indicating the start and end of a +range. So for example `[10, 20, 100, 110]` suppresses changes +between 10 and 20, and between 100 and 110. +*/ +EditorState.changeFilter = changeFilter; +/** +Facet used to register a hook that gets a chance to update or +replace transaction specs before they are applied. This will +only be applied for transactions that don't have +[`filter`](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter) set to `false`. You +can either return a single transaction spec (possibly the input +transaction), or an array of specs (which will be combined in +the same way as the arguments to +[`EditorState.update`](https://codemirror.net/6/docs/ref/#state.EditorState.update)). + +When possible, it is recommended to avoid accessing +[`Transaction.state`](https://codemirror.net/6/docs/ref/#state.Transaction.state) in a filter, +since it will force creation of a state that will then be +discarded again, if the transaction is actually filtered. + +(This functionality should be used with care. Indiscriminately +modifying transaction is likely to break something or degrade +the user experience.) +*/ +EditorState.transactionFilter = transactionFilter; +/** +This is a more limited form of +[`transactionFilter`](https://codemirror.net/6/docs/ref/#state.EditorState^transactionFilter), +which can only add +[annotations](https://codemirror.net/6/docs/ref/#state.TransactionSpec.annotations) and +[effects](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects). _But_, this type +of filter runs even if the transaction has disabled regular +[filtering](https://codemirror.net/6/docs/ref/#state.TransactionSpec.filter), making it suitable +for effects that don't need to touch the changes or selection, +but do want to process every transaction. + +Extenders run _after_ filters, when both are present. +*/ +EditorState.transactionExtender = transactionExtender; +Compartment.reconfigure = /*@__PURE__*/StateEffect.define(); + +/** +Utility function for combining behaviors to fill in a config +object from an array of provided configs. `defaults` should hold +default values for all optional fields in `Config`. + +The function will, by default, error +when a field gets two values that aren't `===`-equal, but you can +provide combine functions per field to do something else. +*/ +function combineConfig(configs, defaults, // Should hold only the optional properties of Config, but I haven't managed to express that +combine = {}) { + let result = {}; + for (let config of configs) + for (let key of Object.keys(config)) { + let value = config[key], current = result[key]; + if (current === undefined) + result[key] = value; + else if (current === value || value === undefined) ; // No conflict + else if (Object.hasOwnProperty.call(combine, key)) + result[key] = combine[key](current, value); + else + throw new Error("Config merge conflict for field " + key); + } + for (let key in defaults) + if (result[key] === undefined) + result[key] = defaults[key]; + return result; +} + +/** +Each range is associated with a value, which must inherit from +this class. +*/ +class RangeValue { + /** + Compare this value with another value. Used when comparing + rangesets. The default implementation compares by identity. + Unless you are only creating a fixed number of unique instances + of your value type, it is a good idea to implement this + properly. + */ + eq(other) { return this == other; } + /** + Create a [range](https://codemirror.net/6/docs/ref/#state.Range) with this value. + */ + range(from, to = from) { return Range.create(from, to, this); } +} +RangeValue.prototype.startSide = RangeValue.prototype.endSide = 0; +RangeValue.prototype.point = false; +RangeValue.prototype.mapMode = MapMode.TrackDel; +/** +A range associates a value with a range of positions. +*/ +class Range { + constructor( + /** + The range's start position. + */ + from, + /** + Its end position. + */ + to, + /** + The value associated with this range. + */ + value) { + this.from = from; + this.to = to; + this.value = value; + } + /** + @internal + */ + static create(from, to, value) { + return new Range(from, to, value); + } +} +function cmpRange(a, b) { + return a.from - b.from || a.value.startSide - b.value.startSide; +} +class Chunk { + constructor(from, to, value, + // Chunks are marked with the largest point that occurs + // in them (or -1 for no points), so that scans that are + // only interested in points (such as the + // heightmap-related logic) can skip range-only chunks. + maxPoint) { + this.from = from; + this.to = to; + this.value = value; + this.maxPoint = maxPoint; + } + get length() { return this.to[this.to.length - 1]; } + // Find the index of the given position and side. Use the ranges' + // `from` pos when `end == false`, `to` when `end == true`. + findIndex(pos, side, end, startAt = 0) { + let arr = end ? this.to : this.from; + for (let lo = startAt, hi = arr.length;;) { + if (lo == hi) + return lo; + let mid = (lo + hi) >> 1; + let diff = arr[mid] - pos || (end ? this.value[mid].endSide : this.value[mid].startSide) - side; + if (mid == lo) + return diff >= 0 ? lo : hi; + if (diff >= 0) + hi = mid; + else + lo = mid + 1; + } + } + between(offset, from, to, f) { + for (let i = this.findIndex(from, -1000000000 /* Far */, true), e = this.findIndex(to, 1000000000 /* Far */, false, i); i < e; i++) + if (f(this.from[i] + offset, this.to[i] + offset, this.value[i]) === false) + return false; + } + map(offset, changes) { + let value = [], from = [], to = [], newPos = -1, maxPoint = -1; + for (let i = 0; i < this.value.length; i++) { + let val = this.value[i], curFrom = this.from[i] + offset, curTo = this.to[i] + offset, newFrom, newTo; + if (curFrom == curTo) { + let mapped = changes.mapPos(curFrom, val.startSide, val.mapMode); + if (mapped == null) + continue; + newFrom = newTo = mapped; + if (val.startSide != val.endSide) { + newTo = changes.mapPos(curFrom, val.endSide); + if (newTo < newFrom) + continue; + } + } + else { + newFrom = changes.mapPos(curFrom, val.startSide); + newTo = changes.mapPos(curTo, val.endSide); + if (newFrom > newTo || newFrom == newTo && val.startSide > 0 && val.endSide <= 0) + continue; + } + if ((newTo - newFrom || val.endSide - val.startSide) < 0) + continue; + if (newPos < 0) + newPos = newFrom; + if (val.point) + maxPoint = Math.max(maxPoint, newTo - newFrom); + value.push(val); + from.push(newFrom - newPos); + to.push(newTo - newPos); + } + return { mapped: value.length ? new Chunk(from, to, value, maxPoint) : null, pos: newPos }; + } +} +/** +A range set stores a collection of [ranges](https://codemirror.net/6/docs/ref/#state.Range) in a +way that makes them efficient to [map](https://codemirror.net/6/docs/ref/#state.RangeSet.map) and +[update](https://codemirror.net/6/docs/ref/#state.RangeSet.update). This is an immutable data +structure. +*/ +class RangeSet { + constructor( + /** + @internal + */ + chunkPos, + /** + @internal + */ + chunk, + /** + @internal + */ + nextLayer, + /** + @internal + */ + maxPoint) { + this.chunkPos = chunkPos; + this.chunk = chunk; + this.nextLayer = nextLayer; + this.maxPoint = maxPoint; + } + /** + @internal + */ + static create(chunkPos, chunk, nextLayer, maxPoint) { + return new RangeSet(chunkPos, chunk, nextLayer, maxPoint); + } + /** + @internal + */ + get length() { + let last = this.chunk.length - 1; + return last < 0 ? 0 : Math.max(this.chunkEnd(last), this.nextLayer.length); + } + /** + The number of ranges in the set. + */ + get size() { + if (this.isEmpty) + return 0; + let size = this.nextLayer.size; + for (let chunk of this.chunk) + size += chunk.value.length; + return size; + } + /** + @internal + */ + chunkEnd(index) { + return this.chunkPos[index] + this.chunk[index].length; + } + /** + Update the range set, optionally adding new ranges or filtering + out existing ones. + + (Note: The type parameter is just there as a kludge to work + around TypeScript variance issues that prevented `RangeSet` + from being a subtype of `RangeSet` when `X` is a subtype of + `Y`.) + */ + update(updateSpec) { + let { add = [], sort = false, filterFrom = 0, filterTo = this.length } = updateSpec; + let filter = updateSpec.filter; + if (add.length == 0 && !filter) + return this; + if (sort) + add = add.slice().sort(cmpRange); + if (this.isEmpty) + return add.length ? RangeSet.of(add) : this; + let cur = new LayerCursor(this, null, -1).goto(0), i = 0, spill = []; + let builder = new RangeSetBuilder(); + while (cur.value || i < add.length) { + if (i < add.length && (cur.from - add[i].from || cur.startSide - add[i].value.startSide) >= 0) { + let range = add[i++]; + if (!builder.addInner(range.from, range.to, range.value)) + spill.push(range); + } + else if (cur.rangeIndex == 1 && cur.chunkIndex < this.chunk.length && + (i == add.length || this.chunkEnd(cur.chunkIndex) < add[i].from) && + (!filter || filterFrom > this.chunkEnd(cur.chunkIndex) || filterTo < this.chunkPos[cur.chunkIndex]) && + builder.addChunk(this.chunkPos[cur.chunkIndex], this.chunk[cur.chunkIndex])) { + cur.nextChunk(); + } + else { + if (!filter || filterFrom > cur.to || filterTo < cur.from || filter(cur.from, cur.to, cur.value)) { + if (!builder.addInner(cur.from, cur.to, cur.value)) + spill.push(Range.create(cur.from, cur.to, cur.value)); + } + cur.next(); + } + } + return builder.finishInner(this.nextLayer.isEmpty && !spill.length ? RangeSet.empty + : this.nextLayer.update({ add: spill, filter, filterFrom, filterTo })); + } + /** + Map this range set through a set of changes, return the new set. + */ + map(changes) { + if (changes.empty || this.isEmpty) + return this; + let chunks = [], chunkPos = [], maxPoint = -1; + for (let i = 0; i < this.chunk.length; i++) { + let start = this.chunkPos[i], chunk = this.chunk[i]; + let touch = changes.touchesRange(start, start + chunk.length); + if (touch === false) { + maxPoint = Math.max(maxPoint, chunk.maxPoint); + chunks.push(chunk); + chunkPos.push(changes.mapPos(start)); + } + else if (touch === true) { + let { mapped, pos } = chunk.map(start, changes); + if (mapped) { + maxPoint = Math.max(maxPoint, mapped.maxPoint); + chunks.push(mapped); + chunkPos.push(pos); + } + } + } + let next = this.nextLayer.map(changes); + return chunks.length == 0 ? next : new RangeSet(chunkPos, chunks, next || RangeSet.empty, maxPoint); + } + /** + Iterate over the ranges that touch the region `from` to `to`, + calling `f` for each. There is no guarantee that the ranges will + be reported in any specific order. When the callback returns + `false`, iteration stops. + */ + between(from, to, f) { + if (this.isEmpty) + return; + for (let i = 0; i < this.chunk.length; i++) { + let start = this.chunkPos[i], chunk = this.chunk[i]; + if (to >= start && from <= start + chunk.length && + chunk.between(start, from - start, to - start, f) === false) + return; + } + this.nextLayer.between(from, to, f); + } + /** + Iterate over the ranges in this set, in order, including all + ranges that end at or after `from`. + */ + iter(from = 0) { + return HeapCursor.from([this]).goto(from); + } + /** + @internal + */ + get isEmpty() { return this.nextLayer == this; } + /** + Iterate over the ranges in a collection of sets, in order, + starting from `from`. + */ + static iter(sets, from = 0) { + return HeapCursor.from(sets).goto(from); + } + /** + Iterate over two groups of sets, calling methods on `comparator` + to notify it of possible differences. + */ + static compare(oldSets, newSets, + /** + This indicates how the underlying data changed between these + ranges, and is needed to synchronize the iteration. `from` and + `to` are coordinates in the _new_ space, after these changes. + */ + textDiff, comparator, + /** + Can be used to ignore all non-point ranges, and points below + the given size. When -1, all ranges are compared. + */ + minPointSize = -1) { + let a = oldSets.filter(set => set.maxPoint > 0 || !set.isEmpty && set.maxPoint >= minPointSize); + let b = newSets.filter(set => set.maxPoint > 0 || !set.isEmpty && set.maxPoint >= minPointSize); + let sharedChunks = findSharedChunks(a, b, textDiff); + let sideA = new SpanCursor(a, sharedChunks, minPointSize); + let sideB = new SpanCursor(b, sharedChunks, minPointSize); + textDiff.iterGaps((fromA, fromB, length) => compare(sideA, fromA, sideB, fromB, length, comparator)); + if (textDiff.empty && textDiff.length == 0) + compare(sideA, 0, sideB, 0, 0, comparator); + } + /** + Compare the contents of two groups of range sets, returning true + if they are equivalent in the given range. + */ + static eq(oldSets, newSets, from = 0, to) { + if (to == null) + to = 1000000000 /* Far */; + let a = oldSets.filter(set => !set.isEmpty && newSets.indexOf(set) < 0); + let b = newSets.filter(set => !set.isEmpty && oldSets.indexOf(set) < 0); + if (a.length != b.length) + return false; + if (!a.length) + return true; + let sharedChunks = findSharedChunks(a, b); + let sideA = new SpanCursor(a, sharedChunks, 0).goto(from), sideB = new SpanCursor(b, sharedChunks, 0).goto(from); + for (;;) { + if (sideA.to != sideB.to || + !sameValues(sideA.active, sideB.active) || + sideA.point && (!sideB.point || !sideA.point.eq(sideB.point))) + return false; + if (sideA.to > to) + return true; + sideA.next(); + sideB.next(); + } + } + /** + Iterate over a group of range sets at the same time, notifying + the iterator about the ranges covering every given piece of + content. Returns the open count (see + [`SpanIterator.span`](https://codemirror.net/6/docs/ref/#state.SpanIterator.span)) at the end + of the iteration. + */ + static spans(sets, from, to, iterator, + /** + When given and greater than -1, only points of at least this + size are taken into account. + */ + minPointSize = -1) { + let cursor = new SpanCursor(sets, null, minPointSize).goto(from), pos = from; + let open = cursor.openStart; + for (;;) { + let curTo = Math.min(cursor.to, to); + if (cursor.point) { + iterator.point(pos, curTo, cursor.point, cursor.activeForPoint(cursor.to), open, cursor.pointRank); + open = cursor.openEnd(curTo) + (cursor.to > curTo ? 1 : 0); + } + else if (curTo > pos) { + iterator.span(pos, curTo, cursor.active, open); + open = cursor.openEnd(curTo); + } + if (cursor.to > to) + break; + pos = cursor.to; + cursor.next(); + } + return open; + } + /** + Create a range set for the given range or array of ranges. By + default, this expects the ranges to be _sorted_ (by start + position and, if two start at the same position, + `value.startSide`). You can pass `true` as second argument to + cause the method to sort them. + */ + static of(ranges, sort = false) { + let build = new RangeSetBuilder(); + for (let range of ranges instanceof Range ? [ranges] : sort ? lazySort(ranges) : ranges) + build.add(range.from, range.to, range.value); + return build.finish(); + } +} +/** +The empty set of ranges. +*/ +RangeSet.empty = /*@__PURE__*/new RangeSet([], [], null, -1); +function lazySort(ranges) { + if (ranges.length > 1) + for (let prev = ranges[0], i = 1; i < ranges.length; i++) { + let cur = ranges[i]; + if (cmpRange(prev, cur) > 0) + return ranges.slice().sort(cmpRange); + prev = cur; + } + return ranges; +} +RangeSet.empty.nextLayer = RangeSet.empty; +/** +A range set builder is a data structure that helps build up a +[range set](https://codemirror.net/6/docs/ref/#state.RangeSet) directly, without first allocating +an array of [`Range`](https://codemirror.net/6/docs/ref/#state.Range) objects. +*/ +class RangeSetBuilder { + /** + Create an empty builder. + */ + constructor() { + this.chunks = []; + this.chunkPos = []; + this.chunkStart = -1; + this.last = null; + this.lastFrom = -1000000000 /* Far */; + this.lastTo = -1000000000 /* Far */; + this.from = []; + this.to = []; + this.value = []; + this.maxPoint = -1; + this.setMaxPoint = -1; + this.nextLayer = null; + } + finishChunk(newArrays) { + this.chunks.push(new Chunk(this.from, this.to, this.value, this.maxPoint)); + this.chunkPos.push(this.chunkStart); + this.chunkStart = -1; + this.setMaxPoint = Math.max(this.setMaxPoint, this.maxPoint); + this.maxPoint = -1; + if (newArrays) { + this.from = []; + this.to = []; + this.value = []; + } + } + /** + Add a range. Ranges should be added in sorted (by `from` and + `value.startSide`) order. + */ + add(from, to, value) { + if (!this.addInner(from, to, value)) + (this.nextLayer || (this.nextLayer = new RangeSetBuilder)).add(from, to, value); + } + /** + @internal + */ + addInner(from, to, value) { + let diff = from - this.lastTo || value.startSide - this.last.endSide; + if (diff <= 0 && (from - this.lastFrom || value.startSide - this.last.startSide) < 0) + throw new Error("Ranges must be added sorted by `from` position and `startSide`"); + if (diff < 0) + return false; + if (this.from.length == 250 /* ChunkSize */) + this.finishChunk(true); + if (this.chunkStart < 0) + this.chunkStart = from; + this.from.push(from - this.chunkStart); + this.to.push(to - this.chunkStart); + this.last = value; + this.lastFrom = from; + this.lastTo = to; + this.value.push(value); + if (value.point) + this.maxPoint = Math.max(this.maxPoint, to - from); + return true; + } + /** + @internal + */ + addChunk(from, chunk) { + if ((from - this.lastTo || chunk.value[0].startSide - this.last.endSide) < 0) + return false; + if (this.from.length) + this.finishChunk(true); + this.setMaxPoint = Math.max(this.setMaxPoint, chunk.maxPoint); + this.chunks.push(chunk); + this.chunkPos.push(from); + let last = chunk.value.length - 1; + this.last = chunk.value[last]; + this.lastFrom = chunk.from[last] + from; + this.lastTo = chunk.to[last] + from; + return true; + } + /** + Finish the range set. Returns the new set. The builder can't be + used anymore after this has been called. + */ + finish() { return this.finishInner(RangeSet.empty); } + /** + @internal + */ + finishInner(next) { + if (this.from.length) + this.finishChunk(false); + if (this.chunks.length == 0) + return next; + let result = RangeSet.create(this.chunkPos, this.chunks, this.nextLayer ? this.nextLayer.finishInner(next) : next, this.setMaxPoint); + this.from = null; // Make sure further `add` calls produce errors + return result; + } +} +function findSharedChunks(a, b, textDiff) { + let inA = new Map(); + for (let set of a) + for (let i = 0; i < set.chunk.length; i++) + if (set.chunk[i].maxPoint <= 0) + inA.set(set.chunk[i], set.chunkPos[i]); + let shared = new Set(); + for (let set of b) + for (let i = 0; i < set.chunk.length; i++) { + let known = inA.get(set.chunk[i]); + if (known != null && (textDiff ? textDiff.mapPos(known) : known) == set.chunkPos[i] && + !(textDiff === null || textDiff === void 0 ? void 0 : textDiff.touchesRange(known, known + set.chunk[i].length))) + shared.add(set.chunk[i]); + } + return shared; +} +class LayerCursor { + constructor(layer, skip, minPoint, rank = 0) { + this.layer = layer; + this.skip = skip; + this.minPoint = minPoint; + this.rank = rank; + } + get startSide() { return this.value ? this.value.startSide : 0; } + get endSide() { return this.value ? this.value.endSide : 0; } + goto(pos, side = -1000000000 /* Far */) { + this.chunkIndex = this.rangeIndex = 0; + this.gotoInner(pos, side, false); + return this; + } + gotoInner(pos, side, forward) { + while (this.chunkIndex < this.layer.chunk.length) { + let next = this.layer.chunk[this.chunkIndex]; + if (!(this.skip && this.skip.has(next) || + this.layer.chunkEnd(this.chunkIndex) < pos || + next.maxPoint < this.minPoint)) + break; + this.chunkIndex++; + forward = false; + } + if (this.chunkIndex < this.layer.chunk.length) { + let rangeIndex = this.layer.chunk[this.chunkIndex].findIndex(pos - this.layer.chunkPos[this.chunkIndex], side, true); + if (!forward || this.rangeIndex < rangeIndex) + this.setRangeIndex(rangeIndex); + } + this.next(); + } + forward(pos, side) { + if ((this.to - pos || this.endSide - side) < 0) + this.gotoInner(pos, side, true); + } + next() { + for (;;) { + if (this.chunkIndex == this.layer.chunk.length) { + this.from = this.to = 1000000000 /* Far */; + this.value = null; + break; + } + else { + let chunkPos = this.layer.chunkPos[this.chunkIndex], chunk = this.layer.chunk[this.chunkIndex]; + let from = chunkPos + chunk.from[this.rangeIndex]; + this.from = from; + this.to = chunkPos + chunk.to[this.rangeIndex]; + this.value = chunk.value[this.rangeIndex]; + this.setRangeIndex(this.rangeIndex + 1); + if (this.minPoint < 0 || this.value.point && this.to - this.from >= this.minPoint) + break; + } + } + } + setRangeIndex(index) { + if (index == this.layer.chunk[this.chunkIndex].value.length) { + this.chunkIndex++; + if (this.skip) { + while (this.chunkIndex < this.layer.chunk.length && this.skip.has(this.layer.chunk[this.chunkIndex])) + this.chunkIndex++; + } + this.rangeIndex = 0; + } + else { + this.rangeIndex = index; + } + } + nextChunk() { + this.chunkIndex++; + this.rangeIndex = 0; + this.next(); + } + compare(other) { + return this.from - other.from || this.startSide - other.startSide || this.rank - other.rank || + this.to - other.to || this.endSide - other.endSide; + } +} +class HeapCursor { + constructor(heap) { + this.heap = heap; + } + static from(sets, skip = null, minPoint = -1) { + let heap = []; + for (let i = 0; i < sets.length; i++) { + for (let cur = sets[i]; !cur.isEmpty; cur = cur.nextLayer) { + if (cur.maxPoint >= minPoint) + heap.push(new LayerCursor(cur, skip, minPoint, i)); + } + } + return heap.length == 1 ? heap[0] : new HeapCursor(heap); + } + get startSide() { return this.value ? this.value.startSide : 0; } + goto(pos, side = -1000000000 /* Far */) { + for (let cur of this.heap) + cur.goto(pos, side); + for (let i = this.heap.length >> 1; i >= 0; i--) + heapBubble(this.heap, i); + this.next(); + return this; + } + forward(pos, side) { + for (let cur of this.heap) + cur.forward(pos, side); + for (let i = this.heap.length >> 1; i >= 0; i--) + heapBubble(this.heap, i); + if ((this.to - pos || this.value.endSide - side) < 0) + this.next(); + } + next() { + if (this.heap.length == 0) { + this.from = this.to = 1000000000 /* Far */; + this.value = null; + this.rank = -1; + } + else { + let top = this.heap[0]; + this.from = top.from; + this.to = top.to; + this.value = top.value; + this.rank = top.rank; + if (top.value) + top.next(); + heapBubble(this.heap, 0); + } + } +} +function heapBubble(heap, index) { + for (let cur = heap[index];;) { + let childIndex = (index << 1) + 1; + if (childIndex >= heap.length) + break; + let child = heap[childIndex]; + if (childIndex + 1 < heap.length && child.compare(heap[childIndex + 1]) >= 0) { + child = heap[childIndex + 1]; + childIndex++; + } + if (cur.compare(child) < 0) + break; + heap[childIndex] = cur; + heap[index] = child; + index = childIndex; + } +} +class SpanCursor { + constructor(sets, skip, minPoint) { + this.minPoint = minPoint; + this.active = []; + this.activeTo = []; + this.activeRank = []; + this.minActive = -1; + // A currently active point range, if any + this.point = null; + this.pointFrom = 0; + this.pointRank = 0; + this.to = -1000000000 /* Far */; + this.endSide = 0; + this.openStart = -1; + this.cursor = HeapCursor.from(sets, skip, minPoint); + } + goto(pos, side = -1000000000 /* Far */) { + this.cursor.goto(pos, side); + this.active.length = this.activeTo.length = this.activeRank.length = 0; + this.minActive = -1; + this.to = pos; + this.endSide = side; + this.openStart = -1; + this.next(); + return this; + } + forward(pos, side) { + while (this.minActive > -1 && (this.activeTo[this.minActive] - pos || this.active[this.minActive].endSide - side) < 0) + this.removeActive(this.minActive); + this.cursor.forward(pos, side); + } + removeActive(index) { + remove(this.active, index); + remove(this.activeTo, index); + remove(this.activeRank, index); + this.minActive = findMinIndex(this.active, this.activeTo); + } + addActive(trackOpen) { + let i = 0, { value, to, rank } = this.cursor; + while (i < this.activeRank.length && this.activeRank[i] <= rank) + i++; + insert(this.active, i, value); + insert(this.activeTo, i, to); + insert(this.activeRank, i, rank); + if (trackOpen) + insert(trackOpen, i, this.cursor.from); + this.minActive = findMinIndex(this.active, this.activeTo); + } + // After calling this, if `this.point` != null, the next range is a + // point. Otherwise, it's a regular range, covered by `this.active`. + next() { + let from = this.to, wasPoint = this.point; + this.point = null; + let trackOpen = this.openStart < 0 ? [] : null, trackExtra = 0; + for (;;) { + let a = this.minActive; + if (a > -1 && (this.activeTo[a] - this.cursor.from || this.active[a].endSide - this.cursor.startSide) < 0) { + if (this.activeTo[a] > from) { + this.to = this.activeTo[a]; + this.endSide = this.active[a].endSide; + break; + } + this.removeActive(a); + if (trackOpen) + remove(trackOpen, a); + } + else if (!this.cursor.value) { + this.to = this.endSide = 1000000000 /* Far */; + break; + } + else if (this.cursor.from > from) { + this.to = this.cursor.from; + this.endSide = this.cursor.startSide; + break; + } + else { + let nextVal = this.cursor.value; + if (!nextVal.point) { // Opening a range + this.addActive(trackOpen); + this.cursor.next(); + } + else if (wasPoint && this.cursor.to == this.to && this.cursor.from < this.cursor.to) { + // Ignore any non-empty points that end precisely at the end of the prev point + this.cursor.next(); + } + else { // New point + this.point = nextVal; + this.pointFrom = this.cursor.from; + this.pointRank = this.cursor.rank; + this.to = this.cursor.to; + this.endSide = nextVal.endSide; + if (this.cursor.from < from) + trackExtra = 1; + this.cursor.next(); + this.forward(this.to, this.endSide); + break; + } + } + } + if (trackOpen) { + let openStart = 0; + while (openStart < trackOpen.length && trackOpen[openStart] < from) + openStart++; + this.openStart = openStart + trackExtra; + } + } + activeForPoint(to) { + if (!this.active.length) + return this.active; + let active = []; + for (let i = this.active.length - 1; i >= 0; i--) { + if (this.activeRank[i] < this.pointRank) + break; + if (this.activeTo[i] > to || this.activeTo[i] == to && this.active[i].endSide >= this.point.endSide) + active.push(this.active[i]); + } + return active.reverse(); + } + openEnd(to) { + let open = 0; + for (let i = this.activeTo.length - 1; i >= 0 && this.activeTo[i] > to; i--) + open++; + return open; + } +} +function compare(a, startA, b, startB, length, comparator) { + a.goto(startA); + b.goto(startB); + let endB = startB + length; + let pos = startB, dPos = startB - startA; + for (;;) { + let diff = (a.to + dPos) - b.to || a.endSide - b.endSide; + let end = diff < 0 ? a.to + dPos : b.to, clipEnd = Math.min(end, endB); + if (a.point || b.point) { + if (!(a.point && b.point && (a.point == b.point || a.point.eq(b.point)) && + sameValues(a.activeForPoint(a.to + dPos), b.activeForPoint(b.to)))) + comparator.comparePoint(pos, clipEnd, a.point, b.point); + } + else { + if (clipEnd > pos && !sameValues(a.active, b.active)) + comparator.compareRange(pos, clipEnd, a.active, b.active); + } + if (end > endB) + break; + pos = end; + if (diff <= 0) + a.next(); + if (diff >= 0) + b.next(); + } +} +function sameValues(a, b) { + if (a.length != b.length) + return false; + for (let i = 0; i < a.length; i++) + if (a[i] != b[i] && !a[i].eq(b[i])) + return false; + return true; +} +function remove(array, index) { + for (let i = index, e = array.length - 1; i < e; i++) + array[i] = array[i + 1]; + array.pop(); +} +function insert(array, index, value) { + for (let i = array.length - 1; i >= index; i--) + array[i + 1] = array[i]; + array[index] = value; +} +function findMinIndex(value, array) { + let found = -1, foundPos = 1000000000 /* Far */; + for (let i = 0; i < array.length; i++) + if ((array[i] - foundPos || value[i].endSide - value[found].endSide) < 0) { + found = i; + foundPos = array[i]; + } + return found; +} + +/** +Count the column position at the given offset into the string, +taking extending characters and tab size into account. +*/ +function countColumn(string, tabSize, to = string.length) { + let n = 0; + for (let i = 0; i < to;) { + if (string.charCodeAt(i) == 9) { + n += tabSize - (n % tabSize); + i++; + } + else { + n++; + i = findClusterBreak(string, i); + } + } + return n; +} +/** +Find the offset that corresponds to the given column position in a +string, taking extending characters and tab size into account. By +default, the string length is returned when it is too short to +reach the column. Pass `strict` true to make it return -1 in that +situation. +*/ +function findColumn(string, col, tabSize, strict) { + for (let i = 0, n = 0;;) { + if (n >= col) + return i; + if (i == string.length) + break; + n += string.charCodeAt(i) == 9 ? tabSize - (n % tabSize) : 1; + i = findClusterBreak(string, i); + } + return strict === true ? -1 : string.length; +} + +export { Annotation, AnnotationType, ChangeDesc, ChangeSet, CharCategory, Compartment, EditorSelection, EditorState, Facet, Line, MapMode, Prec, Range, RangeSet, RangeSetBuilder, RangeValue, SelectionRange, StateEffect, StateEffectType, StateField, Text, Transaction, codePointAt, codePointSize, combineConfig, countColumn, findClusterBreak, findColumn, fromCodePoint }; diff --git a/node_modules/@codemirror/state/package.json b/node_modules/@codemirror/state/package.json new file mode 100644 index 0000000000..7a357261f1 --- /dev/null +++ b/node_modules/@codemirror/state/package.json @@ -0,0 +1,35 @@ +{ + "name": "@codemirror/state", + "version": "6.0.0", + "description": "Editor state data structures for the CodeMirror code editor", + "scripts": { + "test": "cm-runtests", + "prepare": "cm-buildhelper src/index.ts" + }, + "keywords": [ + "editor", + "code" + ], + "author": { + "name": "Marijn Haverbeke", + "email": "marijnh@gmail.com", + "url": "http://marijnhaverbeke.nl" + }, + "type": "module", + "main": "dist/index.cjs", + "exports": { + "import": "./dist/index.js", + "require": "./dist/index.cjs" + }, + "types": "dist/index.d.ts", + "module": "dist/index.js", + "sideEffects": false, + "license": "MIT", + "devDependencies": { + "@codemirror/buildhelper": "^0.1.5" + }, + "repository": { + "type": "git", + "url": "https://github.com/codemirror/state.git" + } +} diff --git a/node_modules/@codemirror/view/.github/workflows/dispatch.yml b/node_modules/@codemirror/view/.github/workflows/dispatch.yml new file mode 100644 index 0000000000..955205089e --- /dev/null +++ b/node_modules/@codemirror/view/.github/workflows/dispatch.yml @@ -0,0 +1,16 @@ +name: Trigger CI +on: push + +jobs: + build: + name: Dispatch to main repo + runs-on: ubuntu-latest + steps: + - name: Emit repository_dispatch + uses: mvasigh/dispatch-action@main + with: + # You should create a personal access token and store it in your repository + token: ${{ secrets.DISPATCH_AUTH }} + repo: codemirror.next + owner: codemirror + event_type: push diff --git a/node_modules/@codemirror/view/CHANGELOG.md b/node_modules/@codemirror/view/CHANGELOG.md new file mode 100644 index 0000000000..40a97ba00e --- /dev/null +++ b/node_modules/@codemirror/view/CHANGELOG.md @@ -0,0 +1,873 @@ +## 6.0.0 (2022-06-08) + +### New features + +The new static `EditorView.findFromDOM` method can be used to retrieve an editor instance from its DOM structure. + +Instead of passing a constructed state to the `EditorView` constructor, it is now also possible to inline the configuration options to the state in the view config object. + +## 0.20.7 (2022-05-30) + +### Bug fixes + +Fix an issue on Chrome Android where the DOM could fail to display the actual document after backspace. + +Avoid an issue on Chrome Android where DOM changes were sometimes inappropriately replace by a backspace key effect due to spurious beforeinput events. + +Fix a problem where the content element's width didn't cover the width of the actual content. + +Work around a bug in Chrome 102 which caused wheel scrolling of the editor to be interrupted every few lines. + +## 0.20.6 (2022-05-20) + +### Bug fixes + +Make sure the editor re-measures itself when its attributes are updated. + +## 0.20.5 (2022-05-18) + +### Bug fixes + +Fix an issue where gutter elements without any markers in them would not get the `cm-gutterElement` class assigned. + +Fix an issue where DOM event handlers registered by plugins were retained indefinitely, even after the editor was reconfigured. + +## 0.20.4 (2022-05-03) + +### Bug fixes + +Prevent Mac-style behavior of inserting a period when the user inserts two spaces. + +Fix an issue where the editor would sometimes not restore the DOM selection when refocused with a selection identical to the one it held when it lost focus. + +## 0.20.3 (2022-04-27) + +### Bug fixes + +Fix a bug where the input handling could crash on repeated (or held) backspace presses on Chrome Android. + +## 0.20.2 (2022-04-22) + +### New features + +The new `hideOn` option to `hoverTooltip` allows more fine-grained control over when the tooltip should hide. + +## 0.20.1 (2022-04-20) + +### Bug fixes + +Remove debug statements that accidentally made it into 0.20.0. + +Fix a regression in `moveVertically`. + +## 0.20.0 (2022-04-20) + +### Breaking changes + +The deprecated interfaces `blockAtHeight`, `visualLineAtHeight`, `viewportLines`, `visualLineAt`, `scrollPosIntoView`, `scrollTo`, and `centerOn` were removed from the library. + +All decorations are now provided through `EditorView.decorations`, and are part of a single precedence ordering. Decoration sources that need access to the view are provided as functions. + +Atomic ranges are now specified through a facet (`EditorView.atomicRanges`). + +Scroll margins are now specified through a facet (`EditorView.scrollMargins`). + +Plugin fields no longer exist in the library (and are replaced by facets holding function values). + +This package no longer re-exports the Range type from @codemirror/state. + +### Bug fixes + +Fix a bug where zero-length block widgets could cause `viewportLineBlocks` to contain overlapping ranges. + +### New features + +The new `perLineTextDirection` facet configures whether the editor reads text direction per line, or uses a single direction for the entire editor. `EditorView.textDirectionAt` returns the direction around a given position. + +`rectangularSelection` and `crosshairCursor` from @codemirror/rectangular-selection were merged into this package. + +This package now exports the tooltip functionality that used to live in @codemirror/tooltip. + +The exports from the old @codemirror/panel package are now available from this package. + +The exports from the old @codemirror/gutter package are now available from this package. + +## 0.19.48 (2022-03-30) + +### Bug fixes + +Fix an issue where DOM syncing could crash when a DOM node was moved from a parent to a child node (via widgets reusing existing nodes). + +To avoid interfering with things like a vim mode too much, the editor will now only activate the tab-to-move-focus escape hatch after an escape press that wasn't handled by an event handler. + +Make sure the view measures itself before the page is printed. + +Tweak types of view plugin defining functions to avoid TypeScript errors when the plugin value doesn't have any of the interface's properties. + +## 0.19.47 (2022-03-08) + +### Bug fixes + +Fix an issue where block widgets at the start of the viewport could break height computations. + +## 0.19.46 (2022-03-03) + +### Bug fixes + +Fix a bug where block widgets on the edges of viewports could cause the positioning of content to misalign with the gutter and height computations. + +Improve cursor height next to widgets. + +Fix a bug where mapping positions to screen coordinates could return incorred coordinates during composition. + +## 0.19.45 (2022-02-23) + +### Bug fixes + +Fix an issue where the library failed to call `WidgetType.destroy` on the old widget when replacing a widget with a different widget of the same type. + +Fix an issue where the editor would compute DOM positions inside composition contexts incorrectly in some cases, causing the selection to be put in the wrong place and needlessly interrupting compositions. + +Fix leaking of resize event handlers. + +## 0.19.44 (2022-02-17) + +### Bug fixes + +Fix a crash that occasionally occurred when drag-selecting in a way that scrolled the editor. + +### New features + +The new `EditorView.compositionStarted` property indicates whether a composition is starting. + +## 0.19.43 (2022-02-16) + +### Bug fixes + +Fix several issues where editing or composition went wrong due to our zero-width space kludge characters ending up in unexpected places. + +Make sure the editor re-measures its dimensions whenever its theme changes. + +Fix an issue where some keys on Android phones could leave the editor DOM unsynced with the actual document. + +## 0.19.42 (2022-02-05) + +### Bug fixes + +Fix a regression in cursor position determination after making an edit next to a widget. + +## 0.19.41 (2022-02-04) + +### Bug fixes + +Fix an issue where the editor's view of its content height could go out of sync with the DOM when a line-wrapping editor had its width changed, causing wrapping to change. + +Fix a bug that caused the editor to draw way too much content when scrolling to a position in an editor (much) taller than the window. + +Report an error when a replace decoration from a plugin crosses a line break, rather than silently ignoring it. + +Fix an issue where reading DOM changes was broken when `lineSeparator` contained more than one character. + +Make ordering of replace and mark decorations with the same extent and inclusivness more predictable by giving replace decorations precedence. + +Fix a bug where, on Chrome, replacement across line boundaries and next to widgets could cause bogus zero-width characters to appear in the content. + +## 0.19.40 (2022-01-19) + +### Bug fixes + +Make composition input properly appear at secondary cursors (except when those are in the DOM node with the composition, in which case the browser won't allow us to intervene without aborting the composition). + +Fix a bug that cause the editor to get confused about which content was visible after scrolling something into view. + +Fix a bug where the dummy elements rendered around widgets could end up in a separate set of wrapping marks, and thus become visible. + +`EditorView.moveVertically` now preserves the `assoc` property of the input range. + +Get rid of gaps between selection elements drawn by `drawSelection`. + +Fix an issue where replacing text next to a widget might leak bogus zero-width spaces into the document. + +Avoid browser selection mishandling when a focused view has `setState` called by eagerly refocusing it. + +## 0.19.39 (2022-01-06) + +### Bug fixes + +Make sure the editor signals a `geometryChanged` update when its width changes. + +### New features + +`EditorView.darkTheme` can now be queried to figure out whether the editor is using a dark theme. + +## 0.19.38 (2022-01-05) + +### Bug fixes + +Fix a bug that caused line decorations with a `class` property to suppress all other line decorations for that line. + +Fix a bug that caused scroll effects to be corrupted when further updates came in before they were applied. + +Fix an issue where, depending on which way a floating point rounding error fell, `posAtCoords` (and thus vertical cursor motion) for positions outside of the vertical range of the document might or might not return the start/end of the document. + +## 0.19.37 (2021-12-22) + +### Bug fixes + +Fix regression where plugin replacing decorations that span to the end of the line are ignored. + +## 0.19.36 (2021-12-22) + +### Bug fixes + +Fix a crash in `posAtCoords` when the position lies in a block widget that is rendered but scrolled out of view. + +Adding block decorations from a plugin now raises an error. Replacing decorations that cross lines are ignored, when provided by a plugin. + +Fix inverted interpretation of the `precise` argument to `posAtCoords`. + +## 0.19.35 (2021-12-20) + +### Bug fixes + +The editor will now handle double-taps as if they are double-clicks, rather than letting the browser's native behavior happen (because the latter often does the wrong thing). + +Fix an issue where backspacing out a selection on Chrome Android would sometimes only delete the last character due to event order issues. + +`posAtCoords`, without second argument, will no longer return null for positions below or above the document. + +## 0.19.34 (2021-12-17) + +### Bug fixes + +Fix a bug where content line elements would in some cases lose their `cm-line` class. + +## 0.19.33 (2021-12-16) + +### Breaking changes + +`EditorView.scrollTo` and `EditorView.centerOn` are deprecated in favor of `EditorView.scrollIntoView`, and will be removed in the next breaking release. + +### Bug fixes + +Fix an issue that could cause the editor to unnecessarily interfere with composition (especially visible on macOS Chrome). + +A composition started with multiple lines selected will no longer be interruptd by the editor. + +### New features + +The new `EditorView.scrollIntoView` function allows you to do more fine-grained scrolling. + +## 0.19.32 (2021-12-15) + +### Bug fixes + +Fix a bug where CodeMirror's own event handers would run even after a user-supplied handler called `preventDefault` on an event. + +Properly draw selections when negative text-indent is used for soft wrapping. + +Fix an issue where `viewportLineBlocks` could hold inaccurate height information when the vertical scaling changed. + +Fixes drop cursor positioning when the document is scrolled. Force a content measure when the editor comes into view + +Fix a bug that could cause the editor to not measure its layout the first time it came into view. + +## 0.19.31 (2021-12-13) + +### New features + +The package now exports a `dropCursor` extension that draws a cursor at the current drop position when dragging content over the editor. + +## 0.19.30 (2021-12-13) + +### Bug fixes + +Refine Android key event handling to work properly in a GBoard corner case where pressing Enter fires a bunch of spurious deleteContentBackward events. + +Fix a crash in `drawSelection` for some kinds of selections. + +Prevent a possibility where some content updates causes duplicate text to remain in DOM. + +### New features + +Support a `maxLength` option to `MatchDecorator` that allows user code to control how far it scans into hidden parts of viewport lines. + +## 0.19.29 (2021-12-09) + +### Bug fixes + +Fix a bug that could cause out-of-view editors to get a nonsensical viewport and fail to scroll into view when asked to. + +Fix a bug where would return 0 when clicking below the content if the last line was replaced with a block widget decoration. + +Fix an issue where clicking at the position of the previous cursor in a blurred editor would cause the selection to reset to the start of the document. + +Fix an issue where composition could be interrupted if the browser created a new node inside a mark decoration node. + +## 0.19.28 (2021-12-08) + +### Bug fixes + +Fix an issue where pressing Enter on Chrome Android during composition did not fire key handlers for Enter. + +Avoid a Chrome bug where the virtual keyboard closes when pressing backspace after a widget. + +Fix an issue where the editor could show a horizontal scroll bar even after all lines that caused it had been deleted or changed. + +## 0.19.27 (2021-12-06) + +### Bug fixes + +Fix a bug that could cause `EditorView.plugin` to inappropriately return `null` during plugin initialization. + +Fix a bug where a block widget without `estimatedHeight` at the end of the document could fail to be drawn + +## 0.19.26 (2021-12-03) + +### New features + +Widgets can now define a `destroy` method that is called when they are removed from the view. + +## 0.19.25 (2021-12-02) + +### Bug fixes + +Widgets around replaced ranges are now visible when their side does not point towards the replaced range. + +A replaced line with a line decoration no longer creates an extra empty line block in the editor. + +The `scrollPastEnd` extension will now over-reserve space at the bottom of the editor on startup, to prevent restored scroll positions from being clipped. + +### New features + +`EditorView.editorAttributes` and `contentAttributes` may now hold functions that produce the attributes. + +## 0.19.24 (2021-12-01) + +### Bug fixes + +Fix a bug where `lineBlockAt`, for queries inside the viewport, would always return the first line in the viewport. + +## 0.19.23 (2021-11-30) + +### Bug fixes + +Fix an issue where after some kinds of changes, `EditorView.viewportLineBlocks` held an out-of-date set of blocks. + +### New features + +Export `EditorView.documentPadding`, with information about the vertical padding of the document. + +## 0.19.22 (2021-11-30) + +### Bug fixes + +Fix an issue where editors with large vertical padding (for example via `scrollPastEnd`) could sometimes lose their scroll position on Chrome. + +Avoid some unnecessary DOM measuring work by more carefully checking whether it is needed. + +### New features + +The new `elementAtHeight`, `lineBlockAtHeight`, and `lineBlockAt` methods provide a simpler and more efficient replacement for the (now deprecated) `blockAtHeight`, `visualLineAtHeight`, and `visualLineAt` methods. + +The editor view now exports a `documentTop` getter that gives you the vertical position of the top of the document. All height info is queried and reported relative to this top. + +The editor view's new `viewportLineBlocks` property provides an array of in-viewport line blocks, and replaces the (now deprecated) `viewportLines` method. + +## 0.19.21 (2021-11-26) + +### Bug fixes + +Fix a problem where the DOM update would unnecessarily trigger browser relayouts. + +## 0.19.20 (2021-11-19) + +### Bug fixes + +Run a measure cycle when the editor's size spontaneously changes. + +## 0.19.19 (2021-11-17) + +### Bug fixes + +Fix a bug that caused the precedence of `editorAttributes` and `contentAttributes` to be inverted, making lower-precedence extensions override higher-precedence ones. + +## 0.19.18 (2021-11-16) + +### Bug fixes + +Fix an issue where the editor wasn't aware it was line-wrapping with its own `lineWrapping` extension enabled. + +## 0.19.17 (2021-11-16) + +### Bug fixes + +Avoid an issue where stretches of whitespace on line wrap points could cause the cursor to be placed outside of the content. + +## 0.19.16 (2021-11-11) + +### Breaking changes + +Block replacement decorations now default to inclusive, because non-inclusive block decorations are rarely what you need. + +### Bug fixes + +Fix an issue that caused block widgets to always have a large side value, making it impossible to show them between to replacement decorations. + +Fix a crash that could happen after some types of viewport changes, due to a bug in the block widget view data structure. + +## 0.19.15 (2021-11-09) + +### Bug fixes + +Fix a bug where the editor would think it was invisible when the document body was given screen height and scroll behavior. + +Fix selection reading inside a shadow root on iOS. + +## 0.19.14 (2021-11-07) + +### Bug fixes + +Fix an issue where typing into a read-only editor would move the selection. + +Fix slowness when backspace is held down on iOS. + +## 0.19.13 (2021-11-06) + +### Bug fixes + +Fix a bug where backspace, enter, and delete would get applied twice on iOS. + +## 0.19.12 (2021-11-04) + +### Bug fixes + +Make sure the workaround for the lost virtual keyboard on Chrome Android also works on slower phones. Slight style change in beforeinput handler + +Avoid failure cases in viewport-based rendering of very long lines. + +## 0.19.11 (2021-11-03) + +### Breaking changes + +`EditorView.scrollPosIntoView` has been deprecated. Use the `EditorView.scrollTo` effect instead. + +### New features + +The new `EditorView.centerOn` effect can be used to scroll a given range to the center of the view. + +## 0.19.10 (2021-11-02) + +### Bug fixes + +Don't crash when `IntersectionObserver` fires its callback without any records. Try to handle some backspace issues on Chrome Android + +Using backspace near uneditable widgets on Chrome Android should now be more reliable. + +Work around a number of browser bugs by always rendering zero-width spaces around in-content widgets, so that browsers will treat the positions near them as valid cursor positions and not try to run composition across widget boundaries. + +Work around bogus composition changes created by Chrome Android after handled backspace presses. + +Work around an issue where tapping on an uneditable node in the editor would sometimes fail to show the virtual keyboard on Chrome Android. + +Prevent translation services from translating the editor content. Show direction override characters as special chars by default + +`specialChars` will now, by default, replace direction override chars, to mitigate https://trojansource.codes/ attacks. + +### New features + +The editor view will, if `parent` is given but `root` is not, derive the root from the parent element. + +Line decorations now accept a `class` property to directly add DOM classes to the line. + +## 0.19.9 (2021-10-01) + +### Bug fixes + +Fix an issue where some kinds of reflows in the surrounding document could move unrendered parts of the editor into view without the editor noticing and updating its viewport. + +Fix an occasional crash in the selection drawing extension. + +## 0.19.8 (2021-09-26) + +### Bug fixes + +Fix a bug that could, on DOM changes near block widgets, insert superfluous line breaks. + +Make interacting with a destroyed editor view do nothing, rather than crash, to avoid tripping people up with pending timeouts and such. + +Make sure `ViewUpdate.viewportChanged` is true whenever `visibleRanges` changes, so that plugins acting only on visible ranges can use it to check when to update. + +Fix line-wise cut on empty lines. + +## 0.19.7 (2021-09-13) + +### Bug fixes + +The view is now aware of the new `EditorState.readOnly` property, and suppresses events that modify the document when it is true. + +## 0.19.6 (2021-09-10) + +### Bug fixes + +Remove a `console.log` that slipped into the previous release. + +## 0.19.5 (2021-09-09) + +### New features + +The new `EditorView.scrollTo` effect can be used to scroll a given range into view. + +## 0.19.4 (2021-09-01) + +### Bug fixes + +Fix an issue where lines containing just a widget decoration wrapped in a mark decoration could be displayed with 0 height. + +## 0.19.3 (2021-08-25) + +### Bug fixes + +Fix a view corruption that could happen in situations involving overlapping mark decorations. + +## 0.19.2 (2021-08-23) + +### New features + +The package now exports a `scrollPastEnd` function, which returns an extension that adds space below the document to allow the last line to be scrolled to the top of the editor. + +## 0.19.1 (2021-08-11) + +### Breaking changes + +The view now emits new-style user event annotations for the transactions it generates. + +### Bug fixes + +Fix a bug where `coordsAtPos` would allow the passed `side` argument to override widget sides, producing incorrect cursor positions. + +Fix a bug that could cause content lines to be misaligned in certain situations involving widgets at the end of lines. + +Fix an issue where, if the browser decided to modify DOM attributes in the content in response to some editing action, the view failed to reset those again. + +## 0.18.19 (2021-07-12) + +### Bug fixes + +Fix a regression where `EditorView.editable.of(false)` didn't disable editing on Webkit-based browsers. + +## 0.18.18 (2021-07-06) + +### Bug fixes + +Fix a bug that caused `EditorView.moveVertically` to only move by one line, even when given a custom distance, in some cases. + +Hide Safari's native bold/italic/underline controls for the content. + +Fix a CSS problem that prevented Safari from breaking words longer than the line in line-wrapping mode. + +Avoid a problem where composition would be inappropriately abored on Safari. + +Fix drag-selection that scrolls the content by dragging past the visible viewport. + +### New features + +`posAtCoords` now has an imprecise mode where it'll return an approximate position even for parts of the document that aren't currently rendered. + +## 0.18.17 (2021-06-14) + +### Bug fixes + +Make `drawSelection` behave properly when lines are split by block widgets. + +Make sure drawn selections that span a single line break don't leave a gap between the lines. + +## 0.18.16 (2021-06-03) + +### Bug fixes + +Fix a crash that could occur when the document changed during mouse selection. + +Fix a bug where composition inside styled content would sometimes be inappropriately aborted by editor DOM updates. + +### New features + +`MouseSelectionStyle.update` may now return true to indicate it should be queried for a new selection after the update. + +## 0.18.15 (2021-06-01) + +### Bug fixes + +Fix a bug that would, in very specific circumstances, cause `posAtCoords` to go into an infinite loop in Safari. + +Fix a bug where some types of IME input on Mobile Safari would drop text. + +## 0.18.14 (2021-05-28) + +### Bug fixes + +Fix an issue where the DOM selection was sometimes not properly updated when next to a widget. + +Invert the order in which overlapping decorations are drawn so that higher-precedence decorations are nested inside lower-precedence ones (and thus override their styling). + +Fix a but in `posAtCoords` where it would in some situations return -1 instead of `null`. + +### New features + +A new plugin field, `PluginField.atomicRanges`, can be used to cause cursor motion to skip past some ranges of the document. + +## 0.18.13 (2021-05-20) + +### Bug fixes + +Fix a bug that would cause the content DOM update to crash in specific circumstances. + +Work around an issue where, after some types of changes, Mobile Safari would ignore Enter presses. + +Make iOS enter and backspace handling more robust, so that platform bugs are less likely to break those keys in the editor. + +Fix a regression where Esc + Tab no longer allowed the user to exit the editor. + +### New features + +You can now drop text files into the editor. + +## 0.18.12 (2021-05-10) + +### Bug fixes + +Work around a Mobile Safari bug where, after backspacing out the last character on a line, Enter didn't work anymore. + +Work around a problem in Mobile Safari where you couldn't tap to put the cursor at the end of a line that ended in a widget. + +## 0.18.11 (2021-04-30) + +### Bug fixes + +Add an attribute to prevent the Grammarly browser extension from messing with the editor content. + +Fix more issues around selection handling a Shadow DOM in Safari. + +## 0.18.10 (2021-04-27) + +### Bug fixes + +Fix a bug where some types of updates wouldn't properly cause marks around the changes to be joined in the DOM. + +Fix an issue where the content and gutters in a fixed-height editor could be smaller than the editor height. + +Fix a crash on Safari when initializing an editor in an unfocused window. + +Fix a bug where the editor would incorrectly conclude it was out of view in some types of absolutely positioned parent elements. + +## 0.18.9 (2021-04-23) + +### Bug fixes + +Fix a crash that occurred when determining DOM coordinates in some specific situations. + +Fix a crash when a DOM change that ended at a zero-width view element (widget) removed that element from the DOM. + +Disable autocorrect and autocapitalize by default, since in most code-editor contexts they get in the way. You can use `EditorView.contentAttributes` to override this. + +Fix a bug that interfered with native touch selection handling on Android. + +Fix an unnecessary DOM update after composition that would disrupt touch selection on Android. + +Add a workaround for Safari's broken selection reporting when the editor is in a shadow DOM tree. + +Fix select-all from the context menu on Safari. + +## 0.18.8 (2021-04-19) + +### Bug fixes + +Handle selection replacements where the inserted text matches the start/end of the replaced text better. + +Fix an issue where the editor would miss scroll events when it was placed in a DOM component slot. + +## 0.18.7 (2021-04-13) + +### Bug fixes + +Fix a crash when drag-selecting out of the editor with editable turned off. + +Backspace and delete now largely work in an editor without a keymap. + +Pressing backspace on iOS should now properly update the virtual keyboard's capitalize and autocorrect state. + +Prevent random line-wrapping in (non-wrapping) editors on Mobile Safari. +## 0.18.6 (2021-04-08) + +### Bug fixes + +Fix an issue in the compiled output that would break the code when minified with terser. + +## 0.18.5 (2021-04-07) + +### Bug fixes + +Improve handling of bidi text with brackets (conforming to Unicode 13's bidi algorithm). + +Fix the position where `drawSelection` displays the cursor on bidi boundaries. + +## 0.18.4 (2021-04-07) + +### Bug fixes + +Fix an issue where the default focus ring gets obscured by the gutters and active line. + +Fix an issue where the editor believed Chrome Android didn't support the CSS `tab-size` style. + +Don't style active lines when there are non-empty selection ranges, so that the active line background doesn't obscure the selection. + +Make iOS autocapitalize update properly when you press Enter. + +## 0.18.3 (2021-03-19) + +### Breaking changes + +The outer DOM element now has class `cm-editor` instead of `cm-wrap` (`cm-wrap` will be present as well until 0.19). + +### Bug fixes + +Improve behavior of `posAtCoords` when the position is near text but not in any character's actual box. + +## 0.18.2 (2021-03-19) + +### Bug fixes + +Triple-clicking now selects the line break after the clicked line (if any). + +Fix an issue where the `drawSelection` plugin would fail to draw the top line of the selection when it started in an empty line. + +Fix an issue where, at the end of a specific type of composition on iOS, the editor read the DOM before the browser was done updating it. + +## 0.18.1 (2021-03-05) + +### Bug fixes + +Fix an issue where, on iOS, some types of IME would cause the composed content to be deleted when confirming a composition. + +## 0.18.0 (2021-03-03) + +### Breaking changes + +The `themeClass` function and ``-style selectors in themes are no longer supported (prefixing with `cm-` should be done manually now). + +Themes must now use `&` (instead of an extra `$`) to target the editor wrapper element. + +The editor no longer adds `cm-light` or `cm-dark` classes. Targeting light or dark configurations in base themes should now be done by using a `&light` or `&dark` top-level selector. + +## 0.17.13 (2021-03-03) + +### Bug fixes + +Work around a Firefox bug where it won't draw the cursor when it is between uneditable elements. + +Fix a bug that broke built-in mouse event handling. + +## 0.17.12 (2021-03-02) + +### Bug fixes + +Avoid interfering with touch events, to allow native selection behavior. + +Fix a bug that broke sub-selectors with multiple `&` placeholders in themes. + +## 0.17.11 (2021-02-25) + +### Bug fixes + +Fix vertical cursor motion on Safari with a larger line-height. + +Fix incorrect selection drawing (with `drawSelection`) when the selection spans to just after a soft wrap point. + +Fix an issue where compositions on Safari were inappropriately aborted in some circumstances. + +The view will now redraw when the `EditorView.phrases` facet changes, to make sure translated text is properly updated. + +## 0.17.10 (2021-02-22) + +### Bug fixes + +Long words without spaces, when line-wrapping is enabled, are now properly broken. + +Fix the horizontal position of selections drawn by `drawSelection` in right-to-left editors with a scrollbar. + +## 0.17.9 (2021-02-18) + +### Bug fixes + +Fix an issue where pasting linewise at the start of a line left the cursor before the inserted content. + +## 0.17.8 (2021-02-16) + +### Bug fixes + +Fix a problem where the DOM selection and the editor state could get out of sync in non-editable mode. + +Fix a crash when the editor was hidden on Safari, due to `getClientRects` returning an empty list. + +Prevent Firefox from making the scrollable element keyboard-focusable. + +## 0.17.7 (2021-01-25) + +### New features + +Add an `EditorView.announce` state effect that can be used to conveniently provide screen reader announcements. + +## 0.17.6 (2021-01-22) + +### Bug fixes + +Avoid creating very high scroll containers for large documents so that we don't overflow the DOM's fixed-precision numbers. + +## 0.17.5 (2021-01-15) + +### Bug fixes + +Fix a bug that would create space-filling placeholders with incorrect height when document is very large. + +## 0.17.4 (2021-01-14) + +### Bug fixes + +The `drawSelection` extension will now reuse cursor DOM nodes when the number of cursors stays the same, allowing some degree of cursor transition animation. + +Makes highlighted special characters styleable (``) and fix their default look in dark themes to have appropriate contrast. + +### New features + +Adds a new `MatchDecorator` helper class which can be used to easily maintain decorations on content that matches a regular expression. + +## 0.17.3 (2021-01-06) + +### New features + +The package now also exports a CommonJS module. + +## 0.17.2 (2021-01-04) + +### Bug fixes + +Work around Chrome problem where the native shift-enter behavior inserts two line breaks. + +Make bracket closing and bracket pair removing more reliable on Android. + +Fix bad cursor position and superfluous change transactions after pressing enter when in a composition on Android. + +Fix issue where the wrong character was deleted when backspacing out a character before an identical copy of that character on Android. + +## 0.17.1 (2020-12-30) + +### Bug fixes + +Fix a bug that prevented `ViewUpdate.focusChanged` from ever being true. + +## 0.17.0 (2020-12-29) + +### Breaking changes + +First numbered release. + diff --git a/node_modules/@codemirror/view/LICENSE b/node_modules/@codemirror/view/LICENSE new file mode 100644 index 0000000000..3af12e62d9 --- /dev/null +++ b/node_modules/@codemirror/view/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (C) 2018-2021 by Marijn Haverbeke and others + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/node_modules/@codemirror/view/README.md b/node_modules/@codemirror/view/README.md new file mode 100644 index 0000000000..c7754a1083 --- /dev/null +++ b/node_modules/@codemirror/view/README.md @@ -0,0 +1,18 @@ +# @codemirror/view [![NPM version](https://img.shields.io/npm/v/@codemirror/view.svg)](https://www.npmjs.org/package/@codemirror/view) + +[ [**WEBSITE**](https://codemirror.net/6/) | [**DOCS**](https://codemirror.net/6/docs/ref/#view) | [**ISSUES**](https://github.com/codemirror/codemirror.next/issues) | [**FORUM**](https://discuss.codemirror.net/c/next/) | [**CHANGELOG**](https://github.com/codemirror/view/blob/main/CHANGELOG.md) ] + +This package implements the DOM view component for the +[CodeMirror](https://codemirror.net/6/) code editor. + +The [project page](https://codemirror.net/6/) has more information, a +number of [examples](https://codemirror.net/6/examples/) and the +[documentation](https://codemirror.net/6/docs/). + +This code is released under an +[MIT license](https://github.com/codemirror/view/tree/main/LICENSE). + +We aim to be an inclusive, welcoming community. To make that explicit, +we have a [code of +conduct](http://contributor-covenant.org/version/1/1/0/) that applies +to communication around the project. diff --git a/node_modules/@codemirror/view/dist/index.cjs b/node_modules/@codemirror/view/dist/index.cjs new file mode 100644 index 0000000000..7eed729c14 --- /dev/null +++ b/node_modules/@codemirror/view/dist/index.cjs @@ -0,0 +1,9021 @@ +'use strict'; + +Object.defineProperty(exports, '__esModule', { value: true }); + +var state = require('@codemirror/state'); +var styleMod = require('style-mod'); +var w3cKeyname = require('w3c-keyname'); + +function getSelection(root) { + let target; + // Browsers differ on whether shadow roots have a getSelection + // method. If it exists, use that, otherwise, call it on the + // document. + if (root.nodeType == 11) { // Shadow root + target = root.getSelection ? root : root.ownerDocument; + } + else { + target = root; + } + return target.getSelection(); +} +function contains(dom, node) { + return node ? dom == node || dom.contains(node.nodeType != 1 ? node.parentNode : node) : false; +} +function deepActiveElement() { + let elt = document.activeElement; + while (elt && elt.shadowRoot) + elt = elt.shadowRoot.activeElement; + return elt; +} +function hasSelection(dom, selection) { + if (!selection.anchorNode) + return false; + try { + // Firefox will raise 'permission denied' errors when accessing + // properties of `sel.anchorNode` when it's in a generated CSS + // element. + return contains(dom, selection.anchorNode); + } + catch (_) { + return false; + } +} +function clientRectsFor(dom) { + if (dom.nodeType == 3) + return textRange(dom, 0, dom.nodeValue.length).getClientRects(); + else if (dom.nodeType == 1) + return dom.getClientRects(); + else + return []; +} +// Scans forward and backward through DOM positions equivalent to the +// given one to see if the two are in the same place (i.e. after a +// text node vs at the end of that text node) +function isEquivalentPosition(node, off, targetNode, targetOff) { + return targetNode ? (scanFor(node, off, targetNode, targetOff, -1) || + scanFor(node, off, targetNode, targetOff, 1)) : false; +} +function domIndex(node) { + for (var index = 0;; index++) { + node = node.previousSibling; + if (!node) + return index; + } +} +function scanFor(node, off, targetNode, targetOff, dir) { + for (;;) { + if (node == targetNode && off == targetOff) + return true; + if (off == (dir < 0 ? 0 : maxOffset(node))) { + if (node.nodeName == "DIV") + return false; + let parent = node.parentNode; + if (!parent || parent.nodeType != 1) + return false; + off = domIndex(node) + (dir < 0 ? 0 : 1); + node = parent; + } + else if (node.nodeType == 1) { + node = node.childNodes[off + (dir < 0 ? -1 : 0)]; + if (node.nodeType == 1 && node.contentEditable == "false") + return false; + off = dir < 0 ? maxOffset(node) : 0; + } + else { + return false; + } + } +} +function maxOffset(node) { + return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length; +} +const Rect0 = { left: 0, right: 0, top: 0, bottom: 0 }; +function flattenRect(rect, left) { + let x = left ? rect.left : rect.right; + return { left: x, right: x, top: rect.top, bottom: rect.bottom }; +} +function windowRect(win) { + return { left: 0, right: win.innerWidth, + top: 0, bottom: win.innerHeight }; +} +function scrollRectIntoView(dom, rect, side, x, y, xMargin, yMargin, ltr) { + let doc = dom.ownerDocument, win = doc.defaultView; + for (let cur = dom; cur;) { + if (cur.nodeType == 1) { // Element + let bounding, top = cur == doc.body; + if (top) { + bounding = windowRect(win); + } + else { + if (cur.scrollHeight <= cur.clientHeight && cur.scrollWidth <= cur.clientWidth) { + cur = cur.parentNode; + continue; + } + let rect = cur.getBoundingClientRect(); + // Make sure scrollbar width isn't included in the rectangle + bounding = { left: rect.left, right: rect.left + cur.clientWidth, + top: rect.top, bottom: rect.top + cur.clientHeight }; + } + let moveX = 0, moveY = 0; + if (y == "nearest") { + if (rect.top < bounding.top) { + moveY = -(bounding.top - rect.top + yMargin); + if (side > 0 && rect.bottom > bounding.bottom + moveY) + moveY = rect.bottom - bounding.bottom + moveY + yMargin; + } + else if (rect.bottom > bounding.bottom) { + moveY = rect.bottom - bounding.bottom + yMargin; + if (side < 0 && (rect.top - moveY) < bounding.top) + moveY = -(bounding.top + moveY - rect.top + yMargin); + } + } + else { + let rectHeight = rect.bottom - rect.top, boundingHeight = bounding.bottom - bounding.top; + let targetTop = y == "center" && rectHeight <= boundingHeight ? rect.top + rectHeight / 2 - boundingHeight / 2 : + y == "start" || y == "center" && side < 0 ? rect.top - yMargin : + rect.bottom - boundingHeight + yMargin; + moveY = targetTop - bounding.top; + } + if (x == "nearest") { + if (rect.left < bounding.left) { + moveX = -(bounding.left - rect.left + xMargin); + if (side > 0 && rect.right > bounding.right + moveX) + moveX = rect.right - bounding.right + moveX + xMargin; + } + else if (rect.right > bounding.right) { + moveX = rect.right - bounding.right + xMargin; + if (side < 0 && rect.left < bounding.left + moveX) + moveX = -(bounding.left + moveX - rect.left + xMargin); + } + } + else { + let targetLeft = x == "center" ? rect.left + (rect.right - rect.left) / 2 - (bounding.right - bounding.left) / 2 : + (x == "start") == ltr ? rect.left - xMargin : + rect.right - (bounding.right - bounding.left) + xMargin; + moveX = targetLeft - bounding.left; + } + if (moveX || moveY) { + if (top) { + win.scrollBy(moveX, moveY); + } + else { + if (moveY) { + let start = cur.scrollTop; + cur.scrollTop += moveY; + moveY = cur.scrollTop - start; + } + if (moveX) { + let start = cur.scrollLeft; + cur.scrollLeft += moveX; + moveX = cur.scrollLeft - start; + } + rect = { left: rect.left - moveX, top: rect.top - moveY, + right: rect.right - moveX, bottom: rect.bottom - moveY }; + } + } + if (top) + break; + cur = cur.assignedSlot || cur.parentNode; + x = y = "nearest"; + } + else if (cur.nodeType == 11) { // A shadow root + cur = cur.host; + } + else { + break; + } + } +} +class DOMSelectionState { + constructor() { + this.anchorNode = null; + this.anchorOffset = 0; + this.focusNode = null; + this.focusOffset = 0; + } + eq(domSel) { + return this.anchorNode == domSel.anchorNode && this.anchorOffset == domSel.anchorOffset && + this.focusNode == domSel.focusNode && this.focusOffset == domSel.focusOffset; + } + setRange(range) { + this.set(range.anchorNode, range.anchorOffset, range.focusNode, range.focusOffset); + } + set(anchorNode, anchorOffset, focusNode, focusOffset) { + this.anchorNode = anchorNode; + this.anchorOffset = anchorOffset; + this.focusNode = focusNode; + this.focusOffset = focusOffset; + } +} +let preventScrollSupported = null; +// Feature-detects support for .focus({preventScroll: true}), and uses +// a fallback kludge when not supported. +function focusPreventScroll(dom) { + if (dom.setActive) + return dom.setActive(); // in IE + if (preventScrollSupported) + return dom.focus(preventScrollSupported); + let stack = []; + for (let cur = dom; cur; cur = cur.parentNode) { + stack.push(cur, cur.scrollTop, cur.scrollLeft); + if (cur == cur.ownerDocument) + break; + } + dom.focus(preventScrollSupported == null ? { + get preventScroll() { + preventScrollSupported = { preventScroll: true }; + return true; + } + } : undefined); + if (!preventScrollSupported) { + preventScrollSupported = false; + for (let i = 0; i < stack.length;) { + let elt = stack[i++], top = stack[i++], left = stack[i++]; + if (elt.scrollTop != top) + elt.scrollTop = top; + if (elt.scrollLeft != left) + elt.scrollLeft = left; + } + } +} +let scratchRange; +function textRange(node, from, to = from) { + let range = scratchRange || (scratchRange = document.createRange()); + range.setEnd(node, to); + range.setStart(node, from); + return range; +} +function dispatchKey(elt, name, code) { + let options = { key: name, code: name, keyCode: code, which: code, cancelable: true }; + let down = new KeyboardEvent("keydown", options); + down.synthetic = true; + elt.dispatchEvent(down); + let up = new KeyboardEvent("keyup", options); + up.synthetic = true; + elt.dispatchEvent(up); + return down.defaultPrevented || up.defaultPrevented; +} +function getRoot(node) { + while (node) { + if (node && (node.nodeType == 9 || node.nodeType == 11 && node.host)) + return node; + node = node.assignedSlot || node.parentNode; + } + return null; +} +function clearAttributes(node) { + while (node.attributes.length) + node.removeAttributeNode(node.attributes[0]); +} + +class DOMPos { + constructor(node, offset, precise = true) { + this.node = node; + this.offset = offset; + this.precise = precise; + } + static before(dom, precise) { return new DOMPos(dom.parentNode, domIndex(dom), precise); } + static after(dom, precise) { return new DOMPos(dom.parentNode, domIndex(dom) + 1, precise); } +} +const noChildren = []; +class ContentView { + constructor() { + this.parent = null; + this.dom = null; + this.dirty = 2 /* Node */; + } + get editorView() { + if (!this.parent) + throw new Error("Accessing view in orphan content view"); + return this.parent.editorView; + } + get overrideDOMText() { return null; } + get posAtStart() { + return this.parent ? this.parent.posBefore(this) : 0; + } + get posAtEnd() { + return this.posAtStart + this.length; + } + posBefore(view) { + let pos = this.posAtStart; + for (let child of this.children) { + if (child == view) + return pos; + pos += child.length + child.breakAfter; + } + throw new RangeError("Invalid child in posBefore"); + } + posAfter(view) { + return this.posBefore(view) + view.length; + } + // Will return a rectangle directly before (when side < 0), after + // (side > 0) or directly on (when the browser supports it) the + // given position. + coordsAt(_pos, _side) { return null; } + sync(track) { + if (this.dirty & 2 /* Node */) { + let parent = this.dom; + let prev = null, next; + for (let child of this.children) { + if (child.dirty) { + if (!child.dom && (next = prev ? prev.nextSibling : parent.firstChild)) { + let contentView = ContentView.get(next); + if (!contentView || !contentView.parent && contentView.constructor == child.constructor) + child.reuseDOM(next); + } + child.sync(track); + child.dirty = 0 /* Not */; + } + next = prev ? prev.nextSibling : parent.firstChild; + if (track && !track.written && track.node == parent && next != child.dom) + track.written = true; + if (child.dom.parentNode == parent) { + while (next && next != child.dom) + next = rm$1(next); + } + else { + parent.insertBefore(child.dom, next); + } + prev = child.dom; + } + next = prev ? prev.nextSibling : parent.firstChild; + if (next && track && track.node == parent) + track.written = true; + while (next) + next = rm$1(next); + } + else if (this.dirty & 1 /* Child */) { + for (let child of this.children) + if (child.dirty) { + child.sync(track); + child.dirty = 0 /* Not */; + } + } + } + reuseDOM(_dom) { } + localPosFromDOM(node, offset) { + let after; + if (node == this.dom) { + after = this.dom.childNodes[offset]; + } + else { + let bias = maxOffset(node) == 0 ? 0 : offset == 0 ? -1 : 1; + for (;;) { + let parent = node.parentNode; + if (parent == this.dom) + break; + if (bias == 0 && parent.firstChild != parent.lastChild) { + if (node == parent.firstChild) + bias = -1; + else + bias = 1; + } + node = parent; + } + if (bias < 0) + after = node; + else + after = node.nextSibling; + } + if (after == this.dom.firstChild) + return 0; + while (after && !ContentView.get(after)) + after = after.nextSibling; + if (!after) + return this.length; + for (let i = 0, pos = 0;; i++) { + let child = this.children[i]; + if (child.dom == after) + return pos; + pos += child.length + child.breakAfter; + } + } + domBoundsAround(from, to, offset = 0) { + let fromI = -1, fromStart = -1, toI = -1, toEnd = -1; + for (let i = 0, pos = offset, prevEnd = offset; i < this.children.length; i++) { + let child = this.children[i], end = pos + child.length; + if (pos < from && end > to) + return child.domBoundsAround(from, to, pos); + if (end >= from && fromI == -1) { + fromI = i; + fromStart = pos; + } + if (pos > to && child.dom.parentNode == this.dom) { + toI = i; + toEnd = prevEnd; + break; + } + prevEnd = end; + pos = end + child.breakAfter; + } + return { from: fromStart, to: toEnd < 0 ? offset + this.length : toEnd, + startDOM: (fromI ? this.children[fromI - 1].dom.nextSibling : null) || this.dom.firstChild, + endDOM: toI < this.children.length && toI >= 0 ? this.children[toI].dom : null }; + } + markDirty(andParent = false) { + this.dirty |= 2 /* Node */; + this.markParentsDirty(andParent); + } + markParentsDirty(childList) { + for (let parent = this.parent; parent; parent = parent.parent) { + if (childList) + parent.dirty |= 2 /* Node */; + if (parent.dirty & 1 /* Child */) + return; + parent.dirty |= 1 /* Child */; + childList = false; + } + } + setParent(parent) { + if (this.parent != parent) { + this.parent = parent; + if (this.dirty) + this.markParentsDirty(true); + } + } + setDOM(dom) { + if (this.dom) + this.dom.cmView = null; + this.dom = dom; + dom.cmView = this; + } + get rootView() { + for (let v = this;;) { + let parent = v.parent; + if (!parent) + return v; + v = parent; + } + } + replaceChildren(from, to, children = noChildren) { + this.markDirty(); + for (let i = from; i < to; i++) { + let child = this.children[i]; + if (child.parent == this) + child.destroy(); + } + this.children.splice(from, to - from, ...children); + for (let i = 0; i < children.length; i++) + children[i].setParent(this); + } + ignoreMutation(_rec) { return false; } + ignoreEvent(_event) { return false; } + childCursor(pos = this.length) { + return new ChildCursor(this.children, pos, this.children.length); + } + childPos(pos, bias = 1) { + return this.childCursor().findPos(pos, bias); + } + toString() { + let name = this.constructor.name.replace("View", ""); + return name + (this.children.length ? "(" + this.children.join() + ")" : + this.length ? "[" + (name == "Text" ? this.text : this.length) + "]" : "") + + (this.breakAfter ? "#" : ""); + } + static get(node) { return node.cmView; } + get isEditable() { return true; } + merge(from, to, source, hasStart, openStart, openEnd) { + return false; + } + become(other) { return false; } + // When this is a zero-length view with a side, this should return a + // number <= 0 to indicate it is before its position, or a + // number > 0 when after its position. + getSide() { return 0; } + destroy() { + this.parent = null; + } +} +ContentView.prototype.breakAfter = 0; +// Remove a DOM node and return its next sibling. +function rm$1(dom) { + let next = dom.nextSibling; + dom.parentNode.removeChild(dom); + return next; +} +class ChildCursor { + constructor(children, pos, i) { + this.children = children; + this.pos = pos; + this.i = i; + this.off = 0; + } + findPos(pos, bias = 1) { + for (;;) { + if (pos > this.pos || pos == this.pos && + (bias > 0 || this.i == 0 || this.children[this.i - 1].breakAfter)) { + this.off = pos - this.pos; + return this; + } + let next = this.children[--this.i]; + this.pos -= next.length + next.breakAfter; + } + } +} +function replaceRange(parent, fromI, fromOff, toI, toOff, insert, breakAtStart, openStart, openEnd) { + let { children } = parent; + let before = children.length ? children[fromI] : null; + let last = insert.length ? insert[insert.length - 1] : null; + let breakAtEnd = last ? last.breakAfter : breakAtStart; + // Change within a single child + if (fromI == toI && before && !breakAtStart && !breakAtEnd && insert.length < 2 && + before.merge(fromOff, toOff, insert.length ? last : null, fromOff == 0, openStart, openEnd)) + return; + if (toI < children.length) { + let after = children[toI]; + // Make sure the end of the child after the update is preserved in `after` + if (after && toOff < after.length) { + // If we're splitting a child, separate part of it to avoid that + // being mangled when updating the child before the update. + if (fromI == toI) { + after = after.split(toOff); + toOff = 0; + } + // If the element after the replacement should be merged with + // the last replacing element, update `content` + if (!breakAtEnd && last && after.merge(0, toOff, last, true, 0, openEnd)) { + insert[insert.length - 1] = after; + } + else { + // Remove the start of the after element, if necessary, and + // add it to `content`. + if (toOff) + after.merge(0, toOff, null, false, 0, openEnd); + insert.push(after); + } + } + else if (after === null || after === void 0 ? void 0 : after.breakAfter) { + // The element at `toI` is entirely covered by this range. + // Preserve its line break, if any. + if (last) + last.breakAfter = 1; + else + breakAtStart = 1; + } + // Since we've handled the next element from the current elements + // now, make sure `toI` points after that. + toI++; + } + if (before) { + before.breakAfter = breakAtStart; + if (fromOff > 0) { + if (!breakAtStart && insert.length && before.merge(fromOff, before.length, insert[0], false, openStart, 0)) { + before.breakAfter = insert.shift().breakAfter; + } + else if (fromOff < before.length || before.children.length && before.children[before.children.length - 1].length == 0) { + before.merge(fromOff, before.length, null, false, openStart, 0); + } + fromI++; + } + } + // Try to merge widgets on the boundaries of the replacement + while (fromI < toI && insert.length) { + if (children[toI - 1].become(insert[insert.length - 1])) { + toI--; + insert.pop(); + openEnd = insert.length ? 0 : openStart; + } + else if (children[fromI].become(insert[0])) { + fromI++; + insert.shift(); + openStart = insert.length ? 0 : openEnd; + } + else { + break; + } + } + if (!insert.length && fromI && toI < children.length && !children[fromI - 1].breakAfter && + children[toI].merge(0, 0, children[fromI - 1], false, openStart, openEnd)) + fromI--; + if (fromI < toI || insert.length) + parent.replaceChildren(fromI, toI, insert); +} +function mergeChildrenInto(parent, from, to, insert, openStart, openEnd) { + let cur = parent.childCursor(); + let { i: toI, off: toOff } = cur.findPos(to, 1); + let { i: fromI, off: fromOff } = cur.findPos(from, -1); + let dLen = from - to; + for (let view of insert) + dLen += view.length; + parent.length += dLen; + replaceRange(parent, fromI, fromOff, toI, toOff, insert, 0, openStart, openEnd); +} + +let nav = typeof navigator != "undefined" ? navigator : { userAgent: "", vendor: "", platform: "" }; +let doc = typeof document != "undefined" ? document : { documentElement: { style: {} } }; +const ie_edge = /Edge\/(\d+)/.exec(nav.userAgent); +const ie_upto10 = /MSIE \d/.test(nav.userAgent); +const ie_11up = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(nav.userAgent); +const ie = !!(ie_upto10 || ie_11up || ie_edge); +const gecko = !ie && /gecko\/(\d+)/i.test(nav.userAgent); +const chrome = !ie && /Chrome\/(\d+)/.exec(nav.userAgent); +const webkit = "webkitFontSmoothing" in doc.documentElement.style; +const safari = !ie && /Apple Computer/.test(nav.vendor); +const ios = safari && (/Mobile\/\w+/.test(nav.userAgent) || nav.maxTouchPoints > 2); +var browser = { + mac: ios || /Mac/.test(nav.platform), + windows: /Win/.test(nav.platform), + linux: /Linux|X11/.test(nav.platform), + ie, + ie_version: ie_upto10 ? doc.documentMode || 6 : ie_11up ? +ie_11up[1] : ie_edge ? +ie_edge[1] : 0, + gecko, + gecko_version: gecko ? +(/Firefox\/(\d+)/.exec(nav.userAgent) || [0, 0])[1] : 0, + chrome: !!chrome, + chrome_version: chrome ? +chrome[1] : 0, + ios, + android: /Android\b/.test(nav.userAgent), + webkit, + safari, + webkit_version: webkit ? +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0, + tabSize: doc.documentElement.style.tabSize != null ? "tab-size" : "-moz-tab-size" +}; + +const MaxJoinLen = 256; +class TextView extends ContentView { + constructor(text) { + super(); + this.text = text; + } + get length() { return this.text.length; } + createDOM(textDOM) { + this.setDOM(textDOM || document.createTextNode(this.text)); + } + sync(track) { + if (!this.dom) + this.createDOM(); + if (this.dom.nodeValue != this.text) { + if (track && track.node == this.dom) + track.written = true; + this.dom.nodeValue = this.text; + } + } + reuseDOM(dom) { + if (dom.nodeType == 3) + this.createDOM(dom); + } + merge(from, to, source) { + if (source && (!(source instanceof TextView) || this.length - (to - from) + source.length > MaxJoinLen)) + return false; + this.text = this.text.slice(0, from) + (source ? source.text : "") + this.text.slice(to); + this.markDirty(); + return true; + } + split(from) { + let result = new TextView(this.text.slice(from)); + this.text = this.text.slice(0, from); + this.markDirty(); + return result; + } + localPosFromDOM(node, offset) { + return node == this.dom ? offset : offset ? this.text.length : 0; + } + domAtPos(pos) { return new DOMPos(this.dom, pos); } + domBoundsAround(_from, _to, offset) { + return { from: offset, to: offset + this.length, startDOM: this.dom, endDOM: this.dom.nextSibling }; + } + coordsAt(pos, side) { + return textCoords(this.dom, pos, side); + } +} +class MarkView extends ContentView { + constructor(mark, children = [], length = 0) { + super(); + this.mark = mark; + this.children = children; + this.length = length; + for (let ch of children) + ch.setParent(this); + } + setAttrs(dom) { + clearAttributes(dom); + if (this.mark.class) + dom.className = this.mark.class; + if (this.mark.attrs) + for (let name in this.mark.attrs) + dom.setAttribute(name, this.mark.attrs[name]); + return dom; + } + reuseDOM(node) { + if (node.nodeName == this.mark.tagName.toUpperCase()) { + this.setDOM(node); + this.dirty |= 4 /* Attrs */ | 2 /* Node */; + } + } + sync(track) { + if (!this.dom) + this.setDOM(this.setAttrs(document.createElement(this.mark.tagName))); + else if (this.dirty & 4 /* Attrs */) + this.setAttrs(this.dom); + super.sync(track); + } + merge(from, to, source, _hasStart, openStart, openEnd) { + if (source && (!(source instanceof MarkView && source.mark.eq(this.mark)) || + (from && openStart <= 0) || (to < this.length && openEnd <= 0))) + return false; + mergeChildrenInto(this, from, to, source ? source.children : [], openStart - 1, openEnd - 1); + this.markDirty(); + return true; + } + split(from) { + let result = [], off = 0, detachFrom = -1, i = 0; + for (let elt of this.children) { + let end = off + elt.length; + if (end > from) + result.push(off < from ? elt.split(from - off) : elt); + if (detachFrom < 0 && off >= from) + detachFrom = i; + off = end; + i++; + } + let length = this.length - from; + this.length = from; + if (detachFrom > -1) { + this.children.length = detachFrom; + this.markDirty(); + } + return new MarkView(this.mark, result, length); + } + domAtPos(pos) { + return inlineDOMAtPos(this.dom, this.children, pos); + } + coordsAt(pos, side) { + return coordsInChildren(this, pos, side); + } +} +function textCoords(text, pos, side) { + let length = text.nodeValue.length; + if (pos > length) + pos = length; + let from = pos, to = pos, flatten = 0; + if (pos == 0 && side < 0 || pos == length && side >= 0) { + if (!(browser.chrome || browser.gecko)) { // These browsers reliably return valid rectangles for empty ranges + if (pos) { + from--; + flatten = 1; + } // FIXME this is wrong in RTL text + else if (to < length) { + to++; + flatten = -1; + } + } + } + else { + if (side < 0) + from--; + else if (to < length) + to++; + } + let rects = textRange(text, from, to).getClientRects(); + if (!rects.length) + return Rect0; + let rect = rects[(flatten ? flatten < 0 : side >= 0) ? 0 : rects.length - 1]; + if (browser.safari && !flatten && rect.width == 0) + rect = Array.prototype.find.call(rects, r => r.width) || rect; + return flatten ? flattenRect(rect, flatten < 0) : rect || null; +} +// Also used for collapsed ranges that don't have a placeholder widget! +class WidgetView extends ContentView { + constructor(widget, length, side) { + super(); + this.widget = widget; + this.length = length; + this.side = side; + this.prevWidget = null; + } + static create(widget, length, side) { + return new (widget.customView || WidgetView)(widget, length, side); + } + split(from) { + let result = WidgetView.create(this.widget, this.length - from, this.side); + this.length -= from; + return result; + } + sync() { + if (!this.dom || !this.widget.updateDOM(this.dom)) { + if (this.dom && this.prevWidget) + this.prevWidget.destroy(this.dom); + this.prevWidget = null; + this.setDOM(this.widget.toDOM(this.editorView)); + this.dom.contentEditable = "false"; + } + } + getSide() { return this.side; } + merge(from, to, source, hasStart, openStart, openEnd) { + if (source && (!(source instanceof WidgetView) || !this.widget.compare(source.widget) || + from > 0 && openStart <= 0 || to < this.length && openEnd <= 0)) + return false; + this.length = from + (source ? source.length : 0) + (this.length - to); + return true; + } + become(other) { + if (other.length == this.length && other instanceof WidgetView && other.side == this.side) { + if (this.widget.constructor == other.widget.constructor) { + if (!this.widget.eq(other.widget)) + this.markDirty(true); + if (this.dom && !this.prevWidget) + this.prevWidget = this.widget; + this.widget = other.widget; + return true; + } + } + return false; + } + ignoreMutation() { return true; } + ignoreEvent(event) { return this.widget.ignoreEvent(event); } + get overrideDOMText() { + if (this.length == 0) + return state.Text.empty; + let top = this; + while (top.parent) + top = top.parent; + let view = top.editorView, text = view && view.state.doc, start = this.posAtStart; + return text ? text.slice(start, start + this.length) : state.Text.empty; + } + domAtPos(pos) { + return pos == 0 ? DOMPos.before(this.dom) : DOMPos.after(this.dom, pos == this.length); + } + domBoundsAround() { return null; } + coordsAt(pos, side) { + let rects = this.dom.getClientRects(), rect = null; + if (!rects.length) + return Rect0; + for (let i = pos > 0 ? rects.length - 1 : 0;; i += (pos > 0 ? -1 : 1)) { + rect = rects[i]; + if (pos > 0 ? i == 0 : i == rects.length - 1 || rect.top < rect.bottom) + break; + } + return (pos == 0 && side > 0 || pos == this.length && side <= 0) ? rect : flattenRect(rect, pos == 0); + } + get isEditable() { return false; } + destroy() { + super.destroy(); + if (this.dom) + this.widget.destroy(this.dom); + } +} +class CompositionView extends WidgetView { + domAtPos(pos) { + let { topView, text } = this.widget; + if (!topView) + return new DOMPos(text, Math.min(pos, text.nodeValue.length)); + return scanCompositionTree(pos, 0, topView, text, (v, p) => v.domAtPos(p), p => new DOMPos(text, Math.min(p, text.nodeValue.length))); + } + sync() { this.setDOM(this.widget.toDOM()); } + localPosFromDOM(node, offset) { + let { topView, text } = this.widget; + if (!topView) + return Math.min(offset, this.length); + return posFromDOMInCompositionTree(node, offset, topView, text); + } + ignoreMutation() { return false; } + get overrideDOMText() { return null; } + coordsAt(pos, side) { + let { topView, text } = this.widget; + if (!topView) + return textCoords(text, pos, side); + return scanCompositionTree(pos, side, topView, text, (v, pos, side) => v.coordsAt(pos, side), (pos, side) => textCoords(text, pos, side)); + } + destroy() { + var _a; + super.destroy(); + (_a = this.widget.topView) === null || _a === void 0 ? void 0 : _a.destroy(); + } + get isEditable() { return true; } +} +// Uses the old structure of a chunk of content view frozen for +// composition to try and find a reasonable DOM location for the given +// offset. +function scanCompositionTree(pos, side, view, text, enterView, fromText) { + if (view instanceof MarkView) { + for (let child of view.children) { + let hasComp = contains(child.dom, text); + let len = hasComp ? text.nodeValue.length : child.length; + if (pos < len || pos == len && child.getSide() <= 0) + return hasComp ? scanCompositionTree(pos, side, child, text, enterView, fromText) : enterView(child, pos, side); + pos -= len; + } + return enterView(view, view.length, -1); + } + else if (view.dom == text) { + return fromText(pos, side); + } + else { + return enterView(view, pos, side); + } +} +function posFromDOMInCompositionTree(node, offset, view, text) { + if (view instanceof MarkView) { + for (let child of view.children) { + let pos = 0, hasComp = contains(child.dom, text); + if (contains(child.dom, node)) + return pos + (hasComp ? posFromDOMInCompositionTree(node, offset, child, text) : child.localPosFromDOM(node, offset)); + pos += hasComp ? text.nodeValue.length : child.length; + } + } + else if (view.dom == text) { + return Math.min(offset, text.nodeValue.length); + } + return view.localPosFromDOM(node, offset); +} +// These are drawn around uneditable widgets to avoid a number of +// browser bugs that show up when the cursor is directly next to +// uneditable inline content. +class WidgetBufferView extends ContentView { + constructor(side) { + super(); + this.side = side; + } + get length() { return 0; } + merge() { return false; } + become(other) { + return other instanceof WidgetBufferView && other.side == this.side; + } + split() { return new WidgetBufferView(this.side); } + sync() { + if (!this.dom) { + let dom = document.createElement("img"); + dom.className = "cm-widgetBuffer"; + dom.setAttribute("aria-hidden", "true"); + this.setDOM(dom); + } + } + getSide() { return this.side; } + domAtPos(pos) { return DOMPos.before(this.dom); } + localPosFromDOM() { return 0; } + domBoundsAround() { return null; } + coordsAt(pos) { + let imgRect = this.dom.getBoundingClientRect(); + // Since the height doesn't correspond to text height, try + // to borrow the height from some sibling node. + let siblingRect = inlineSiblingRect(this, this.side > 0 ? -1 : 1); + return siblingRect && siblingRect.top < imgRect.bottom && siblingRect.bottom > imgRect.top + ? { left: imgRect.left, right: imgRect.right, top: siblingRect.top, bottom: siblingRect.bottom } : imgRect; + } + get overrideDOMText() { + return state.Text.empty; + } +} +TextView.prototype.children = WidgetView.prototype.children = WidgetBufferView.prototype.children = noChildren; +function inlineSiblingRect(view, side) { + let parent = view.parent, index = parent ? parent.children.indexOf(view) : -1; + while (parent && index >= 0) { + if (side < 0 ? index > 0 : index < parent.children.length) { + let next = parent.children[index + side]; + if (next instanceof TextView) { + let nextRect = next.coordsAt(side < 0 ? next.length : 0, side); + if (nextRect) + return nextRect; + } + index += side; + } + else if (parent instanceof MarkView && parent.parent) { + index = parent.parent.children.indexOf(parent) + (side < 0 ? 0 : 1); + parent = parent.parent; + } + else { + let last = parent.dom.lastChild; + if (last && last.nodeName == "BR") + return last.getClientRects()[0]; + break; + } + } + return undefined; +} +function inlineDOMAtPos(dom, children, pos) { + let i = 0; + for (let off = 0; i < children.length; i++) { + let child = children[i], end = off + child.length; + if (end == off && child.getSide() <= 0) + continue; + if (pos > off && pos < end && child.dom.parentNode == dom) + return child.domAtPos(pos - off); + if (pos <= off) + break; + off = end; + } + for (; i > 0; i--) { + let before = children[i - 1].dom; + if (before.parentNode == dom) + return DOMPos.after(before); + } + return new DOMPos(dom, 0); +} +// Assumes `view`, if a mark view, has precisely 1 child. +function joinInlineInto(parent, view, open) { + let last, { children } = parent; + if (open > 0 && view instanceof MarkView && children.length && + (last = children[children.length - 1]) instanceof MarkView && last.mark.eq(view.mark)) { + joinInlineInto(last, view.children[0], open - 1); + } + else { + children.push(view); + view.setParent(parent); + } + parent.length += view.length; +} +function coordsInChildren(view, pos, side) { + for (let off = 0, i = 0; i < view.children.length; i++) { + let child = view.children[i], end = off + child.length, next; + if ((side <= 0 || end == view.length || child.getSide() > 0 ? end >= pos : end > pos) && + (pos < end || i + 1 == view.children.length || (next = view.children[i + 1]).length || next.getSide() > 0)) { + let flatten = 0; + if (end == off) { + if (child.getSide() <= 0) + continue; + flatten = side = -child.getSide(); + } + let rect = child.coordsAt(Math.max(0, pos - off), side); + return flatten && rect ? flattenRect(rect, side < 0) : rect; + } + off = end; + } + let last = view.dom.lastChild; + if (!last) + return view.dom.getBoundingClientRect(); + let rects = clientRectsFor(last); + return rects[rects.length - 1] || null; +} + +function combineAttrs(source, target) { + for (let name in source) { + if (name == "class" && target.class) + target.class += " " + source.class; + else if (name == "style" && target.style) + target.style += ";" + source.style; + else + target[name] = source[name]; + } + return target; +} +function attrsEq(a, b) { + if (a == b) + return true; + if (!a || !b) + return false; + let keysA = Object.keys(a), keysB = Object.keys(b); + if (keysA.length != keysB.length) + return false; + for (let key of keysA) { + if (keysB.indexOf(key) == -1 || a[key] !== b[key]) + return false; + } + return true; +} +function updateAttrs(dom, prev, attrs) { + let changed = null; + if (prev) + for (let name in prev) + if (!(attrs && name in attrs)) + dom.removeAttribute(changed = name); + if (attrs) + for (let name in attrs) + if (!(prev && prev[name] == attrs[name])) + dom.setAttribute(changed = name, attrs[name]); + return !!changed; +} + +/** +Widgets added to the content are described by subclasses of this +class. Using a description object like that makes it possible to +delay creating of the DOM structure for a widget until it is +needed, and to avoid redrawing widgets even if the decorations +that define them are recreated. +*/ +class WidgetType { + /** + Compare this instance to another instance of the same type. + (TypeScript can't express this, but only instances of the same + specific class will be passed to this method.) This is used to + avoid redrawing widgets when they are replaced by a new + decoration of the same type. The default implementation just + returns `false`, which will cause new instances of the widget to + always be redrawn. + */ + eq(widget) { return false; } + /** + Update a DOM element created by a widget of the same type (but + different, non-`eq` content) to reflect this widget. May return + true to indicate that it could update, false to indicate it + couldn't (in which case the widget will be redrawn). The default + implementation just returns false. + */ + updateDOM(dom) { return false; } + /** + @internal + */ + compare(other) { + return this == other || this.constructor == other.constructor && this.eq(other); + } + /** + The estimated height this widget will have, to be used when + estimating the height of content that hasn't been drawn. May + return -1 to indicate you don't know. The default implementation + returns -1. + */ + get estimatedHeight() { return -1; } + /** + Can be used to configure which kinds of events inside the widget + should be ignored by the editor. The default is to ignore all + events. + */ + ignoreEvent(event) { return true; } + /** + @internal + */ + get customView() { return null; } + /** + This is called when the an instance of the widget is removed + from the editor view. + */ + destroy(dom) { } +} +/** +The different types of blocks that can occur in an editor view. +*/ +exports.BlockType = void 0; +(function (BlockType) { + /** + A line of text. + */ + BlockType[BlockType["Text"] = 0] = "Text"; + /** + A block widget associated with the position after it. + */ + BlockType[BlockType["WidgetBefore"] = 1] = "WidgetBefore"; + /** + A block widget associated with the position before it. + */ + BlockType[BlockType["WidgetAfter"] = 2] = "WidgetAfter"; + /** + A block widget [replacing](https://codemirror.net/6/docs/ref/#view.Decoration^replace) a range of content. + */ + BlockType[BlockType["WidgetRange"] = 3] = "WidgetRange"; +})(exports.BlockType || (exports.BlockType = {})); +/** +A decoration provides information on how to draw or style a piece +of content. You'll usually use it wrapped in a +[`Range`](https://codemirror.net/6/docs/ref/#state.Range), which adds a start and end position. +@nonabstract +*/ +class Decoration extends state.RangeValue { + constructor( + /** + @internal + */ + startSide, + /** + @internal + */ + endSide, + /** + @internal + */ + widget, + /** + The config object used to create this decoration. You can + include additional properties in there to store metadata about + your decoration. + */ + spec) { + super(); + this.startSide = startSide; + this.endSide = endSide; + this.widget = widget; + this.spec = spec; + } + /** + @internal + */ + get heightRelevant() { return false; } + /** + Create a mark decoration, which influences the styling of the + content in its range. Nested mark decorations will cause nested + DOM elements to be created. Nesting order is determined by + precedence of the [facet](https://codemirror.net/6/docs/ref/#view.EditorView^decorations), with + the higher-precedence decorations creating the inner DOM nodes. + Such elements are split on line boundaries and on the boundaries + of lower-precedence decorations. + */ + static mark(spec) { + return new MarkDecoration(spec); + } + /** + Create a widget decoration, which displays a DOM element at the + given position. + */ + static widget(spec) { + let side = spec.side || 0, block = !!spec.block; + side += block ? (side > 0 ? 300000000 /* BlockAfter */ : -400000000 /* BlockBefore */) : (side > 0 ? 100000000 /* InlineAfter */ : -100000000 /* InlineBefore */); + return new PointDecoration(spec, side, side, block, spec.widget || null, false); + } + /** + Create a replace decoration which replaces the given range with + a widget, or simply hides it. + */ + static replace(spec) { + let block = !!spec.block, startSide, endSide; + if (spec.isBlockGap) { + startSide = -500000000 /* GapStart */; + endSide = 400000000 /* GapEnd */; + } + else { + let { start, end } = getInclusive(spec, block); + startSide = (start ? (block ? -300000000 /* BlockIncStart */ : -1 /* InlineIncStart */) : 500000000 /* NonIncStart */) - 1; + endSide = (end ? (block ? 200000000 /* BlockIncEnd */ : 1 /* InlineIncEnd */) : -600000000 /* NonIncEnd */) + 1; + } + return new PointDecoration(spec, startSide, endSide, block, spec.widget || null, true); + } + /** + Create a line decoration, which can add DOM attributes to the + line starting at the given position. + */ + static line(spec) { + return new LineDecoration(spec); + } + /** + Build a [`DecorationSet`](https://codemirror.net/6/docs/ref/#view.DecorationSet) from the given + decorated range or ranges. If the ranges aren't already sorted, + pass `true` for `sort` to make the library sort them for you. + */ + static set(of, sort = false) { + return state.RangeSet.of(of, sort); + } + /** + @internal + */ + hasHeight() { return this.widget ? this.widget.estimatedHeight > -1 : false; } +} +/** +The empty set of decorations. +*/ +Decoration.none = state.RangeSet.empty; +class MarkDecoration extends Decoration { + constructor(spec) { + let { start, end } = getInclusive(spec); + super(start ? -1 /* InlineIncStart */ : 500000000 /* NonIncStart */, end ? 1 /* InlineIncEnd */ : -600000000 /* NonIncEnd */, null, spec); + this.tagName = spec.tagName || "span"; + this.class = spec.class || ""; + this.attrs = spec.attributes || null; + } + eq(other) { + return this == other || + other instanceof MarkDecoration && + this.tagName == other.tagName && + this.class == other.class && + attrsEq(this.attrs, other.attrs); + } + range(from, to = from) { + if (from >= to) + throw new RangeError("Mark decorations may not be empty"); + return super.range(from, to); + } +} +MarkDecoration.prototype.point = false; +class LineDecoration extends Decoration { + constructor(spec) { + super(-200000000 /* Line */, -200000000 /* Line */, null, spec); + } + eq(other) { + return other instanceof LineDecoration && attrsEq(this.spec.attributes, other.spec.attributes); + } + range(from, to = from) { + if (to != from) + throw new RangeError("Line decoration ranges must be zero-length"); + return super.range(from, to); + } +} +LineDecoration.prototype.mapMode = state.MapMode.TrackBefore; +LineDecoration.prototype.point = true; +class PointDecoration extends Decoration { + constructor(spec, startSide, endSide, block, widget, isReplace) { + super(startSide, endSide, widget, spec); + this.block = block; + this.isReplace = isReplace; + this.mapMode = !block ? state.MapMode.TrackDel : startSide <= 0 ? state.MapMode.TrackBefore : state.MapMode.TrackAfter; + } + // Only relevant when this.block == true + get type() { + return this.startSide < this.endSide ? exports.BlockType.WidgetRange + : this.startSide <= 0 ? exports.BlockType.WidgetBefore : exports.BlockType.WidgetAfter; + } + get heightRelevant() { return this.block || !!this.widget && this.widget.estimatedHeight >= 5; } + eq(other) { + return other instanceof PointDecoration && + widgetsEq(this.widget, other.widget) && + this.block == other.block && + this.startSide == other.startSide && this.endSide == other.endSide; + } + range(from, to = from) { + if (this.isReplace && (from > to || (from == to && this.startSide > 0 && this.endSide <= 0))) + throw new RangeError("Invalid range for replacement decoration"); + if (!this.isReplace && to != from) + throw new RangeError("Widget decorations can only have zero-length ranges"); + return super.range(from, to); + } +} +PointDecoration.prototype.point = true; +function getInclusive(spec, block = false) { + let { inclusiveStart: start, inclusiveEnd: end } = spec; + if (start == null) + start = spec.inclusive; + if (end == null) + end = spec.inclusive; + return { start: start !== null && start !== void 0 ? start : block, end: end !== null && end !== void 0 ? end : block }; +} +function widgetsEq(a, b) { + return a == b || !!(a && b && a.compare(b)); +} +function addRange(from, to, ranges, margin = 0) { + let last = ranges.length - 1; + if (last >= 0 && ranges[last] + margin >= from) + ranges[last] = Math.max(ranges[last], to); + else + ranges.push(from, to); +} + +class LineView extends ContentView { + constructor() { + super(...arguments); + this.children = []; + this.length = 0; + this.prevAttrs = undefined; + this.attrs = null; + this.breakAfter = 0; + } + // Consumes source + merge(from, to, source, hasStart, openStart, openEnd) { + if (source) { + if (!(source instanceof LineView)) + return false; + if (!this.dom) + source.transferDOM(this); // Reuse source.dom when appropriate + } + if (hasStart) + this.setDeco(source ? source.attrs : null); + mergeChildrenInto(this, from, to, source ? source.children : [], openStart, openEnd); + return true; + } + split(at) { + let end = new LineView; + end.breakAfter = this.breakAfter; + if (this.length == 0) + return end; + let { i, off } = this.childPos(at); + if (off) { + end.append(this.children[i].split(off), 0); + this.children[i].merge(off, this.children[i].length, null, false, 0, 0); + i++; + } + for (let j = i; j < this.children.length; j++) + end.append(this.children[j], 0); + while (i > 0 && this.children[i - 1].length == 0) + this.children[--i].destroy(); + this.children.length = i; + this.markDirty(); + this.length = at; + return end; + } + transferDOM(other) { + if (!this.dom) + return; + this.markDirty(); + other.setDOM(this.dom); + other.prevAttrs = this.prevAttrs === undefined ? this.attrs : this.prevAttrs; + this.prevAttrs = undefined; + this.dom = null; + } + setDeco(attrs) { + if (!attrsEq(this.attrs, attrs)) { + if (this.dom) { + this.prevAttrs = this.attrs; + this.markDirty(); + } + this.attrs = attrs; + } + } + append(child, openStart) { + joinInlineInto(this, child, openStart); + } + // Only called when building a line view in ContentBuilder + addLineDeco(deco) { + let attrs = deco.spec.attributes, cls = deco.spec.class; + if (attrs) + this.attrs = combineAttrs(attrs, this.attrs || {}); + if (cls) + this.attrs = combineAttrs({ class: cls }, this.attrs || {}); + } + domAtPos(pos) { + return inlineDOMAtPos(this.dom, this.children, pos); + } + reuseDOM(node) { + if (node.nodeName == "DIV") { + this.setDOM(node); + this.dirty |= 4 /* Attrs */ | 2 /* Node */; + } + } + sync(track) { + var _a; + if (!this.dom) { + this.setDOM(document.createElement("div")); + this.dom.className = "cm-line"; + this.prevAttrs = this.attrs ? null : undefined; + } + else if (this.dirty & 4 /* Attrs */) { + clearAttributes(this.dom); + this.dom.className = "cm-line"; + this.prevAttrs = this.attrs ? null : undefined; + } + if (this.prevAttrs !== undefined) { + updateAttrs(this.dom, this.prevAttrs, this.attrs); + this.dom.classList.add("cm-line"); + this.prevAttrs = undefined; + } + super.sync(track); + let last = this.dom.lastChild; + while (last && ContentView.get(last) instanceof MarkView) + last = last.lastChild; + if (!last || !this.length || + last.nodeName != "BR" && ((_a = ContentView.get(last)) === null || _a === void 0 ? void 0 : _a.isEditable) == false && + (!browser.ios || !this.children.some(ch => ch instanceof TextView))) { + let hack = document.createElement("BR"); + hack.cmIgnore = true; + this.dom.appendChild(hack); + } + } + measureTextSize() { + if (this.children.length == 0 || this.length > 20) + return null; + let totalWidth = 0; + for (let child of this.children) { + if (!(child instanceof TextView)) + return null; + let rects = clientRectsFor(child.dom); + if (rects.length != 1) + return null; + totalWidth += rects[0].width; + } + return { lineHeight: this.dom.getBoundingClientRect().height, + charWidth: totalWidth / this.length }; + } + coordsAt(pos, side) { + return coordsInChildren(this, pos, side); + } + become(_other) { return false; } + get type() { return exports.BlockType.Text; } + static find(docView, pos) { + for (let i = 0, off = 0; i < docView.children.length; i++) { + let block = docView.children[i], end = off + block.length; + if (end >= pos) { + if (block instanceof LineView) + return block; + if (end > pos) + break; + } + off = end + block.breakAfter; + } + return null; + } +} +class BlockWidgetView extends ContentView { + constructor(widget, length, type) { + super(); + this.widget = widget; + this.length = length; + this.type = type; + this.breakAfter = 0; + this.prevWidget = null; + } + merge(from, to, source, _takeDeco, openStart, openEnd) { + if (source && (!(source instanceof BlockWidgetView) || !this.widget.compare(source.widget) || + from > 0 && openStart <= 0 || to < this.length && openEnd <= 0)) + return false; + this.length = from + (source ? source.length : 0) + (this.length - to); + return true; + } + domAtPos(pos) { + return pos == 0 ? DOMPos.before(this.dom) : DOMPos.after(this.dom, pos == this.length); + } + split(at) { + let len = this.length - at; + this.length = at; + let end = new BlockWidgetView(this.widget, len, this.type); + end.breakAfter = this.breakAfter; + return end; + } + get children() { return noChildren; } + sync() { + if (!this.dom || !this.widget.updateDOM(this.dom)) { + if (this.dom && this.prevWidget) + this.prevWidget.destroy(this.dom); + this.prevWidget = null; + this.setDOM(this.widget.toDOM(this.editorView)); + this.dom.contentEditable = "false"; + } + } + get overrideDOMText() { + return this.parent ? this.parent.view.state.doc.slice(this.posAtStart, this.posAtEnd) : state.Text.empty; + } + domBoundsAround() { return null; } + become(other) { + if (other instanceof BlockWidgetView && other.type == this.type && + other.widget.constructor == this.widget.constructor) { + if (!other.widget.eq(this.widget)) + this.markDirty(true); + if (this.dom && !this.prevWidget) + this.prevWidget = this.widget; + this.widget = other.widget; + this.length = other.length; + this.breakAfter = other.breakAfter; + return true; + } + return false; + } + ignoreMutation() { return true; } + ignoreEvent(event) { return this.widget.ignoreEvent(event); } + destroy() { + super.destroy(); + if (this.dom) + this.widget.destroy(this.dom); + } +} + +class ContentBuilder { + constructor(doc, pos, end, disallowBlockEffectsFor) { + this.doc = doc; + this.pos = pos; + this.end = end; + this.disallowBlockEffectsFor = disallowBlockEffectsFor; + this.content = []; + this.curLine = null; + this.breakAtStart = 0; + this.pendingBuffer = 0 /* No */; + // Set to false directly after a widget that covers the position after it + this.atCursorPos = true; + this.openStart = -1; + this.openEnd = -1; + this.text = ""; + this.textOff = 0; + this.cursor = doc.iter(); + this.skip = pos; + } + posCovered() { + if (this.content.length == 0) + return !this.breakAtStart && this.doc.lineAt(this.pos).from != this.pos; + let last = this.content[this.content.length - 1]; + return !last.breakAfter && !(last instanceof BlockWidgetView && last.type == exports.BlockType.WidgetBefore); + } + getLine() { + if (!this.curLine) { + this.content.push(this.curLine = new LineView); + this.atCursorPos = true; + } + return this.curLine; + } + flushBuffer(active) { + if (this.pendingBuffer) { + this.curLine.append(wrapMarks(new WidgetBufferView(-1), active), active.length); + this.pendingBuffer = 0 /* No */; + } + } + addBlockWidget(view) { + this.flushBuffer([]); + this.curLine = null; + this.content.push(view); + } + finish(openEnd) { + if (!openEnd) + this.flushBuffer([]); + else + this.pendingBuffer = 0 /* No */; + if (!this.posCovered()) + this.getLine(); + } + buildText(length, active, openStart) { + while (length > 0) { + if (this.textOff == this.text.length) { + let { value, lineBreak, done } = this.cursor.next(this.skip); + this.skip = 0; + if (done) + throw new Error("Ran out of text content when drawing inline views"); + if (lineBreak) { + if (!this.posCovered()) + this.getLine(); + if (this.content.length) + this.content[this.content.length - 1].breakAfter = 1; + else + this.breakAtStart = 1; + this.flushBuffer([]); + this.curLine = null; + length--; + continue; + } + else { + this.text = value; + this.textOff = 0; + } + } + let take = Math.min(this.text.length - this.textOff, length, 512 /* Chunk */); + this.flushBuffer(active.slice(0, openStart)); + this.getLine().append(wrapMarks(new TextView(this.text.slice(this.textOff, this.textOff + take)), active), openStart); + this.atCursorPos = true; + this.textOff += take; + length -= take; + openStart = 0; + } + } + span(from, to, active, openStart) { + this.buildText(to - from, active, openStart); + this.pos = to; + if (this.openStart < 0) + this.openStart = openStart; + } + point(from, to, deco, active, openStart, index) { + if (this.disallowBlockEffectsFor[index] && deco instanceof PointDecoration) { + if (deco.block) + throw new RangeError("Block decorations may not be specified via plugins"); + if (to > this.doc.lineAt(this.pos).to) + throw new RangeError("Decorations that replace line breaks may not be specified via plugins"); + } + let len = to - from; + if (deco instanceof PointDecoration) { + if (deco.block) { + let { type } = deco; + if (type == exports.BlockType.WidgetAfter && !this.posCovered()) + this.getLine(); + this.addBlockWidget(new BlockWidgetView(deco.widget || new NullWidget("div"), len, type)); + } + else { + let view = WidgetView.create(deco.widget || new NullWidget("span"), len, deco.startSide); + let cursorBefore = this.atCursorPos && !view.isEditable && openStart <= active.length && (from < to || deco.startSide > 0); + let cursorAfter = !view.isEditable && (from < to || deco.startSide <= 0); + let line = this.getLine(); + if (this.pendingBuffer == 2 /* IfCursor */ && !cursorBefore) + this.pendingBuffer = 0 /* No */; + this.flushBuffer(active); + if (cursorBefore) { + line.append(wrapMarks(new WidgetBufferView(1), active), openStart); + openStart = active.length + Math.max(0, openStart - active.length); + } + line.append(wrapMarks(view, active), openStart); + this.atCursorPos = cursorAfter; + this.pendingBuffer = !cursorAfter ? 0 /* No */ : from < to ? 1 /* Yes */ : 2 /* IfCursor */; + } + } + else if (this.doc.lineAt(this.pos).from == this.pos) { // Line decoration + this.getLine().addLineDeco(deco); + } + if (len) { + // Advance the iterator past the replaced content + if (this.textOff + len <= this.text.length) { + this.textOff += len; + } + else { + this.skip += len - (this.text.length - this.textOff); + this.text = ""; + this.textOff = 0; + } + this.pos = to; + } + if (this.openStart < 0) + this.openStart = openStart; + } + static build(text, from, to, decorations, dynamicDecorationMap) { + let builder = new ContentBuilder(text, from, to, dynamicDecorationMap); + builder.openEnd = state.RangeSet.spans(decorations, from, to, builder); + if (builder.openStart < 0) + builder.openStart = builder.openEnd; + builder.finish(builder.openEnd); + return builder; + } +} +function wrapMarks(view, active) { + for (let mark of active) + view = new MarkView(mark, [view], view.length); + return view; +} +class NullWidget extends WidgetType { + constructor(tag) { + super(); + this.tag = tag; + } + eq(other) { return other.tag == this.tag; } + toDOM() { return document.createElement(this.tag); } + updateDOM(elt) { return elt.nodeName.toLowerCase() == this.tag; } +} + +const clickAddsSelectionRange = state.Facet.define(); +const dragMovesSelection$1 = state.Facet.define(); +const mouseSelectionStyle = state.Facet.define(); +const exceptionSink = state.Facet.define(); +const updateListener = state.Facet.define(); +const inputHandler = state.Facet.define(); +const perLineTextDirection = state.Facet.define({ + combine: values => values.some(x => x) +}); +class ScrollTarget { + constructor(range, y = "nearest", x = "nearest", yMargin = 5, xMargin = 5) { + this.range = range; + this.y = y; + this.x = x; + this.yMargin = yMargin; + this.xMargin = xMargin; + } + map(changes) { + return changes.empty ? this : new ScrollTarget(this.range.map(changes), this.y, this.x, this.yMargin, this.xMargin); + } +} +const scrollIntoView = state.StateEffect.define({ map: (t, ch) => t.map(ch) }); +/** +Log or report an unhandled exception in client code. Should +probably only be used by extension code that allows client code to +provide functions, and calls those functions in a context where an +exception can't be propagated to calling code in a reasonable way +(for example when in an event handler). + +Either calls a handler registered with +[`EditorView.exceptionSink`](https://codemirror.net/6/docs/ref/#view.EditorView^exceptionSink), +`window.onerror`, if defined, or `console.error` (in which case +it'll pass `context`, when given, as first argument). +*/ +function logException(state, exception, context) { + let handler = state.facet(exceptionSink); + if (handler.length) + handler[0](exception); + else if (window.onerror) + window.onerror(String(exception), context, undefined, undefined, exception); + else if (context) + console.error(context + ":", exception); + else + console.error(exception); +} +const editable = state.Facet.define({ combine: values => values.length ? values[0] : true }); +let nextPluginID = 0; +const viewPlugin = state.Facet.define(); +/** +View plugins associate stateful values with a view. They can +influence the way the content is drawn, and are notified of things +that happen in the view. +*/ +class ViewPlugin { + constructor( + /** + @internal + */ + id, + /** + @internal + */ + create, + /** + @internal + */ + domEventHandlers, buildExtensions) { + this.id = id; + this.create = create; + this.domEventHandlers = domEventHandlers; + this.extension = buildExtensions(this); + } + /** + Define a plugin from a constructor function that creates the + plugin's value, given an editor view. + */ + static define(create, spec) { + const { eventHandlers, provide, decorations: deco } = spec || {}; + return new ViewPlugin(nextPluginID++, create, eventHandlers, plugin => { + let ext = [viewPlugin.of(plugin)]; + if (deco) + ext.push(decorations.of(view => { + let pluginInst = view.plugin(plugin); + return pluginInst ? deco(pluginInst) : Decoration.none; + })); + if (provide) + ext.push(provide(plugin)); + return ext; + }); + } + /** + Create a plugin for a class whose constructor takes a single + editor view as argument. + */ + static fromClass(cls, spec) { + return ViewPlugin.define(view => new cls(view), spec); + } +} +class PluginInstance { + constructor(spec) { + this.spec = spec; + // When starting an update, all plugins have this field set to the + // update object, indicating they need to be updated. When finished + // updating, it is set to `false`. Retrieving a plugin that needs to + // be updated with `view.plugin` forces an eager update. + this.mustUpdate = null; + // This is null when the plugin is initially created, but + // initialized on the first update. + this.value = null; + } + update(view) { + if (!this.value) { + if (this.spec) { + try { + this.value = this.spec.create(view); + } + catch (e) { + logException(view.state, e, "CodeMirror plugin crashed"); + this.deactivate(); + } + } + } + else if (this.mustUpdate) { + let update = this.mustUpdate; + this.mustUpdate = null; + if (this.value.update) { + try { + this.value.update(update); + } + catch (e) { + logException(update.state, e, "CodeMirror plugin crashed"); + if (this.value.destroy) + try { + this.value.destroy(); + } + catch (_) { } + this.deactivate(); + } + } + } + return this; + } + destroy(view) { + var _a; + if ((_a = this.value) === null || _a === void 0 ? void 0 : _a.destroy) { + try { + this.value.destroy(); + } + catch (e) { + logException(view.state, e, "CodeMirror plugin crashed"); + } + } + } + deactivate() { + this.spec = this.value = null; + } +} +const editorAttributes = state.Facet.define(); +const contentAttributes = state.Facet.define(); +// Provide decorations +const decorations = state.Facet.define(); +const atomicRanges = state.Facet.define(); +const scrollMargins = state.Facet.define(); +const styleModule = state.Facet.define(); +class ChangedRange { + constructor(fromA, toA, fromB, toB) { + this.fromA = fromA; + this.toA = toA; + this.fromB = fromB; + this.toB = toB; + } + join(other) { + return new ChangedRange(Math.min(this.fromA, other.fromA), Math.max(this.toA, other.toA), Math.min(this.fromB, other.fromB), Math.max(this.toB, other.toB)); + } + addToSet(set) { + let i = set.length, me = this; + for (; i > 0; i--) { + let range = set[i - 1]; + if (range.fromA > me.toA) + continue; + if (range.toA < me.fromA) + break; + me = me.join(range); + set.splice(i - 1, 1); + } + set.splice(i, 0, me); + return set; + } + static extendWithRanges(diff, ranges) { + if (ranges.length == 0) + return diff; + let result = []; + for (let dI = 0, rI = 0, posA = 0, posB = 0;; dI++) { + let next = dI == diff.length ? null : diff[dI], off = posA - posB; + let end = next ? next.fromB : 1e9; + while (rI < ranges.length && ranges[rI] < end) { + let from = ranges[rI], to = ranges[rI + 1]; + let fromB = Math.max(posB, from), toB = Math.min(end, to); + if (fromB <= toB) + new ChangedRange(fromB + off, toB + off, fromB, toB).addToSet(result); + if (to > end) + break; + else + rI += 2; + } + if (!next) + return result; + new ChangedRange(next.fromA, next.toA, next.fromB, next.toB).addToSet(result); + posA = next.toA; + posB = next.toB; + } + } +} +/** +View [plugins](https://codemirror.net/6/docs/ref/#view.ViewPlugin) are given instances of this +class, which describe what happened, whenever the view is updated. +*/ +class ViewUpdate { + constructor( + /** + The editor view that the update is associated with. + */ + view, + /** + The new editor state. + */ + state$1, + /** + The transactions involved in the update. May be empty. + */ + transactions) { + this.view = view; + this.state = state$1; + this.transactions = transactions; + /** + @internal + */ + this.flags = 0; + this.startState = view.state; + this.changes = state.ChangeSet.empty(this.startState.doc.length); + for (let tr of transactions) + this.changes = this.changes.compose(tr.changes); + let changedRanges = []; + this.changes.iterChangedRanges((fromA, toA, fromB, toB) => changedRanges.push(new ChangedRange(fromA, toA, fromB, toB))); + this.changedRanges = changedRanges; + let focus = view.hasFocus; + if (focus != view.inputState.notifiedFocused) { + view.inputState.notifiedFocused = focus; + this.flags |= 1 /* Focus */; + } + } + /** + @internal + */ + static create(view, state, transactions) { + return new ViewUpdate(view, state, transactions); + } + /** + Tells you whether the [viewport](https://codemirror.net/6/docs/ref/#view.EditorView.viewport) or + [visible ranges](https://codemirror.net/6/docs/ref/#view.EditorView.visibleRanges) changed in this + update. + */ + get viewportChanged() { + return (this.flags & 4 /* Viewport */) > 0; + } + /** + Indicates whether the height of a block element in the editor + changed in this update. + */ + get heightChanged() { + return (this.flags & 2 /* Height */) > 0; + } + /** + Returns true when the document was modified or the size of the + editor, or elements within the editor, changed. + */ + get geometryChanged() { + return this.docChanged || (this.flags & (8 /* Geometry */ | 2 /* Height */)) > 0; + } + /** + True when this update indicates a focus change. + */ + get focusChanged() { + return (this.flags & 1 /* Focus */) > 0; + } + /** + Whether the document changed in this update. + */ + get docChanged() { + return !this.changes.empty; + } + /** + Whether the selection was explicitly set in this update. + */ + get selectionSet() { + return this.transactions.some(tr => tr.selection); + } + /** + @internal + */ + get empty() { return this.flags == 0 && this.transactions.length == 0; } +} + +/** +Used to indicate [text direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection). +*/ +exports.Direction = void 0; +(function (Direction) { + // (These are chosen to match the base levels, in bidi algorithm + // terms, of spans in that direction.) + /** + Left-to-right. + */ + Direction[Direction["LTR"] = 0] = "LTR"; + /** + Right-to-left. + */ + Direction[Direction["RTL"] = 1] = "RTL"; +})(exports.Direction || (exports.Direction = {})); +const LTR = exports.Direction.LTR, RTL = exports.Direction.RTL; +// Decode a string with each type encoded as log2(type) +function dec(str) { + let result = []; + for (let i = 0; i < str.length; i++) + result.push(1 << +str[i]); + return result; +} +// Character types for codepoints 0 to 0xf8 +const LowTypes = dec("88888888888888888888888888888888888666888888787833333333337888888000000000000000000000000008888880000000000000000000000000088888888888888888888888888888888888887866668888088888663380888308888800000000000000000000000800000000000000000000000000000008"); +// Character types for codepoints 0x600 to 0x6f9 +const ArabicTypes = dec("4444448826627288999999999992222222222222222222222222222222222222222222222229999999999999999999994444444444644222822222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222999999949999999229989999223333333333"); +const Brackets = Object.create(null), BracketStack = []; +// There's a lot more in +// https://www.unicode.org/Public/UCD/latest/ucd/BidiBrackets.txt, +// which are left out to keep code size down. +for (let p of ["()", "[]", "{}"]) { + let l = p.charCodeAt(0), r = p.charCodeAt(1); + Brackets[l] = r; + Brackets[r] = -l; +} +function charType(ch) { + return ch <= 0xf7 ? LowTypes[ch] : + 0x590 <= ch && ch <= 0x5f4 ? 2 /* R */ : + 0x600 <= ch && ch <= 0x6f9 ? ArabicTypes[ch - 0x600] : + 0x6ee <= ch && ch <= 0x8ac ? 4 /* AL */ : + 0x2000 <= ch && ch <= 0x200b ? 256 /* NI */ : + ch == 0x200c ? 256 /* NI */ : 1 /* L */; +} +const BidiRE = /[\u0590-\u05f4\u0600-\u06ff\u0700-\u08ac]/; +/** +Represents a contiguous range of text that has a single direction +(as in left-to-right or right-to-left). +*/ +class BidiSpan { + /** + @internal + */ + constructor( + /** + The start of the span (relative to the start of the line). + */ + from, + /** + The end of the span. + */ + to, + /** + The ["bidi + level"](https://unicode.org/reports/tr9/#Basic_Display_Algorithm) + of the span (in this context, 0 means + left-to-right, 1 means right-to-left, 2 means left-to-right + number inside right-to-left text). + */ + level) { + this.from = from; + this.to = to; + this.level = level; + } + /** + The direction of this span. + */ + get dir() { return this.level % 2 ? RTL : LTR; } + /** + @internal + */ + side(end, dir) { return (this.dir == dir) == end ? this.to : this.from; } + /** + @internal + */ + static find(order, index, level, assoc) { + let maybe = -1; + for (let i = 0; i < order.length; i++) { + let span = order[i]; + if (span.from <= index && span.to >= index) { + if (span.level == level) + return i; + // When multiple spans match, if assoc != 0, take the one that + // covers that side, otherwise take the one with the minimum + // level. + if (maybe < 0 || (assoc != 0 ? (assoc < 0 ? span.from < index : span.to > index) : order[maybe].level > span.level)) + maybe = i; + } + } + if (maybe < 0) + throw new RangeError("Index out of range"); + return maybe; + } +} +// Reused array of character types +const types = []; +function computeOrder(line, direction) { + let len = line.length, outerType = direction == LTR ? 1 /* L */ : 2 /* R */, oppositeType = direction == LTR ? 2 /* R */ : 1 /* L */; + if (!line || outerType == 1 /* L */ && !BidiRE.test(line)) + return trivialOrder(len); + // W1. Examine each non-spacing mark (NSM) in the level run, and + // change the type of the NSM to the type of the previous + // character. If the NSM is at the start of the level run, it will + // get the type of sor. + // W2. Search backwards from each instance of a European number + // until the first strong type (R, L, AL, or sor) is found. If an + // AL is found, change the type of the European number to Arabic + // number. + // W3. Change all ALs to R. + // (Left after this: L, R, EN, AN, ET, CS, NI) + for (let i = 0, prev = outerType, prevStrong = outerType; i < len; i++) { + let type = charType(line.charCodeAt(i)); + if (type == 512 /* NSM */) + type = prev; + else if (type == 8 /* EN */ && prevStrong == 4 /* AL */) + type = 16 /* AN */; + types[i] = type == 4 /* AL */ ? 2 /* R */ : type; + if (type & 7 /* Strong */) + prevStrong = type; + prev = type; + } + // W5. A sequence of European terminators adjacent to European + // numbers changes to all European numbers. + // W6. Otherwise, separators and terminators change to Other + // Neutral. + // W7. Search backwards from each instance of a European number + // until the first strong type (R, L, or sor) is found. If an L is + // found, then change the type of the European number to L. + // (Left after this: L, R, EN+AN, NI) + for (let i = 0, prev = outerType, prevStrong = outerType; i < len; i++) { + let type = types[i]; + if (type == 128 /* CS */) { + if (i < len - 1 && prev == types[i + 1] && (prev & 24 /* Num */)) + type = types[i] = prev; + else + types[i] = 256 /* NI */; + } + else if (type == 64 /* ET */) { + let end = i + 1; + while (end < len && types[end] == 64 /* ET */) + end++; + let replace = (i && prev == 8 /* EN */) || (end < len && types[end] == 8 /* EN */) ? (prevStrong == 1 /* L */ ? 1 /* L */ : 8 /* EN */) : 256 /* NI */; + for (let j = i; j < end; j++) + types[j] = replace; + i = end - 1; + } + else if (type == 8 /* EN */ && prevStrong == 1 /* L */) { + types[i] = 1 /* L */; + } + prev = type; + if (type & 7 /* Strong */) + prevStrong = type; + } + // N0. Process bracket pairs in an isolating run sequence + // sequentially in the logical order of the text positions of the + // opening paired brackets using the logic given below. Within this + // scope, bidirectional types EN and AN are treated as R. + for (let i = 0, sI = 0, context = 0, ch, br, type; i < len; i++) { + // Keeps [startIndex, type, strongSeen] triples for each open + // bracket on BracketStack. + if (br = Brackets[ch = line.charCodeAt(i)]) { + if (br < 0) { // Closing bracket + for (let sJ = sI - 3; sJ >= 0; sJ -= 3) { + if (BracketStack[sJ + 1] == -br) { + let flags = BracketStack[sJ + 2]; + let type = (flags & 2 /* EmbedInside */) ? outerType : + !(flags & 4 /* OppositeInside */) ? 0 : + (flags & 1 /* OppositeBefore */) ? oppositeType : outerType; + if (type) + types[i] = types[BracketStack[sJ]] = type; + sI = sJ; + break; + } + } + } + else if (BracketStack.length == 189 /* MaxDepth */) { + break; + } + else { + BracketStack[sI++] = i; + BracketStack[sI++] = ch; + BracketStack[sI++] = context; + } + } + else if ((type = types[i]) == 2 /* R */ || type == 1 /* L */) { + let embed = type == outerType; + context = embed ? 0 : 1 /* OppositeBefore */; + for (let sJ = sI - 3; sJ >= 0; sJ -= 3) { + let cur = BracketStack[sJ + 2]; + if (cur & 2 /* EmbedInside */) + break; + if (embed) { + BracketStack[sJ + 2] |= 2 /* EmbedInside */; + } + else { + if (cur & 4 /* OppositeInside */) + break; + BracketStack[sJ + 2] |= 4 /* OppositeInside */; + } + } + } + } + // N1. A sequence of neutrals takes the direction of the + // surrounding strong text if the text on both sides has the same + // direction. European and Arabic numbers act as if they were R in + // terms of their influence on neutrals. Start-of-level-run (sor) + // and end-of-level-run (eor) are used at level run boundaries. + // N2. Any remaining neutrals take the embedding direction. + // (Left after this: L, R, EN+AN) + for (let i = 0; i < len; i++) { + if (types[i] == 256 /* NI */) { + let end = i + 1; + while (end < len && types[end] == 256 /* NI */) + end++; + let beforeL = (i ? types[i - 1] : outerType) == 1 /* L */; + let afterL = (end < len ? types[end] : outerType) == 1 /* L */; + let replace = beforeL == afterL ? (beforeL ? 1 /* L */ : 2 /* R */) : outerType; + for (let j = i; j < end; j++) + types[j] = replace; + i = end - 1; + } + } + // Here we depart from the documented algorithm, in order to avoid + // building up an actual levels array. Since there are only three + // levels (0, 1, 2) in an implementation that doesn't take + // explicit embedding into account, we can build up the order on + // the fly, without following the level-based algorithm. + let order = []; + if (outerType == 1 /* L */) { + for (let i = 0; i < len;) { + let start = i, rtl = types[i++] != 1 /* L */; + while (i < len && rtl == (types[i] != 1 /* L */)) + i++; + if (rtl) { + for (let j = i; j > start;) { + let end = j, l = types[--j] != 2 /* R */; + while (j > start && l == (types[j - 1] != 2 /* R */)) + j--; + order.push(new BidiSpan(j, end, l ? 2 : 1)); + } + } + else { + order.push(new BidiSpan(start, i, 0)); + } + } + } + else { + for (let i = 0; i < len;) { + let start = i, rtl = types[i++] == 2 /* R */; + while (i < len && rtl == (types[i] == 2 /* R */)) + i++; + order.push(new BidiSpan(start, i, rtl ? 1 : 2)); + } + } + return order; +} +function trivialOrder(length) { + return [new BidiSpan(0, length, 0)]; +} +let movedOver = ""; +function moveVisually(line, order, dir, start, forward) { + var _a; + let startIndex = start.head - line.from, spanI = -1; + if (startIndex == 0) { + if (!forward || !line.length) + return null; + if (order[0].level != dir) { + startIndex = order[0].side(false, dir); + spanI = 0; + } + } + else if (startIndex == line.length) { + if (forward) + return null; + let last = order[order.length - 1]; + if (last.level != dir) { + startIndex = last.side(true, dir); + spanI = order.length - 1; + } + } + if (spanI < 0) + spanI = BidiSpan.find(order, startIndex, (_a = start.bidiLevel) !== null && _a !== void 0 ? _a : -1, start.assoc); + let span = order[spanI]; + // End of span. (But not end of line--that was checked for above.) + if (startIndex == span.side(forward, dir)) { + span = order[spanI += forward ? 1 : -1]; + startIndex = span.side(!forward, dir); + } + let indexForward = forward == (span.dir == dir); + let nextIndex = state.findClusterBreak(line.text, startIndex, indexForward); + movedOver = line.text.slice(Math.min(startIndex, nextIndex), Math.max(startIndex, nextIndex)); + if (nextIndex != span.side(forward, dir)) + return state.EditorSelection.cursor(nextIndex + line.from, indexForward ? -1 : 1, span.level); + let nextSpan = spanI == (forward ? order.length - 1 : 0) ? null : order[spanI + (forward ? 1 : -1)]; + if (!nextSpan && span.level != dir) + return state.EditorSelection.cursor(forward ? line.to : line.from, forward ? -1 : 1, dir); + if (nextSpan && nextSpan.level < span.level) + return state.EditorSelection.cursor(nextSpan.side(!forward, dir) + line.from, forward ? 1 : -1, nextSpan.level); + return state.EditorSelection.cursor(nextIndex + line.from, forward ? -1 : 1, span.level); +} + +const LineBreakPlaceholder = "\uffff"; +class DOMReader { + constructor(points, state$1) { + this.points = points; + this.text = ""; + this.lineSeparator = state$1.facet(state.EditorState.lineSeparator); + } + append(text) { + this.text += text; + } + lineBreak() { + this.text += LineBreakPlaceholder; + } + readRange(start, end) { + if (!start) + return this; + let parent = start.parentNode; + for (let cur = start;;) { + this.findPointBefore(parent, cur); + this.readNode(cur); + let next = cur.nextSibling; + if (next == end) + break; + let view = ContentView.get(cur), nextView = ContentView.get(next); + if (view && nextView ? view.breakAfter : + (view ? view.breakAfter : isBlockElement(cur)) || + (isBlockElement(next) && (cur.nodeName != "BR" || cur.cmIgnore))) + this.lineBreak(); + cur = next; + } + this.findPointBefore(parent, end); + return this; + } + readTextNode(node) { + let text = node.nodeValue; + for (let point of this.points) + if (point.node == node) + point.pos = this.text.length + Math.min(point.offset, text.length); + for (let off = 0, re = this.lineSeparator ? null : /\r\n?|\n/g;;) { + let nextBreak = -1, breakSize = 1, m; + if (this.lineSeparator) { + nextBreak = text.indexOf(this.lineSeparator, off); + breakSize = this.lineSeparator.length; + } + else if (m = re.exec(text)) { + nextBreak = m.index; + breakSize = m[0].length; + } + this.append(text.slice(off, nextBreak < 0 ? text.length : nextBreak)); + if (nextBreak < 0) + break; + this.lineBreak(); + if (breakSize > 1) + for (let point of this.points) + if (point.node == node && point.pos > this.text.length) + point.pos -= breakSize - 1; + off = nextBreak + breakSize; + } + } + readNode(node) { + if (node.cmIgnore) + return; + let view = ContentView.get(node); + let fromView = view && view.overrideDOMText; + if (fromView != null) { + this.findPointInside(node, fromView.length); + for (let i = fromView.iter(); !i.next().done;) { + if (i.lineBreak) + this.lineBreak(); + else + this.append(i.value); + } + } + else if (node.nodeType == 3) { + this.readTextNode(node); + } + else if (node.nodeName == "BR") { + if (node.nextSibling) + this.lineBreak(); + } + else if (node.nodeType == 1) { + this.readRange(node.firstChild, null); + } + } + findPointBefore(node, next) { + for (let point of this.points) + if (point.node == node && node.childNodes[point.offset] == next) + point.pos = this.text.length; + } + findPointInside(node, maxLen) { + for (let point of this.points) + if (node.nodeType == 3 ? point.node == node : node.contains(point.node)) + point.pos = this.text.length + Math.min(maxLen, point.offset); + } +} +function isBlockElement(node) { + return node.nodeType == 1 && /^(DIV|P|LI|UL|OL|BLOCKQUOTE|DD|DT|H\d|SECTION|PRE)$/.test(node.nodeName); +} +class DOMPoint { + constructor(node, offset) { + this.node = node; + this.offset = offset; + this.pos = -1; + } +} + +class DocView extends ContentView { + constructor(view) { + super(); + this.view = view; + this.compositionDeco = Decoration.none; + this.decorations = []; + this.dynamicDecorationMap = []; + // Track a minimum width for the editor. When measuring sizes in + // measureVisibleLineHeights, this is updated to point at the width + // of a given element and its extent in the document. When a change + // happens in that range, these are reset. That way, once we've seen + // a line/element of a given length, we keep the editor wide enough + // to fit at least that element, until it is changed, at which point + // we forget it again. + this.minWidth = 0; + this.minWidthFrom = 0; + this.minWidthTo = 0; + // Track whether the DOM selection was set in a lossy way, so that + // we don't mess it up when reading it back it + this.impreciseAnchor = null; + this.impreciseHead = null; + this.forceSelection = false; + // Used by the resize observer to ignore resizes that we caused + // ourselves + this.lastUpdate = Date.now(); + this.setDOM(view.contentDOM); + this.children = [new LineView]; + this.children[0].setParent(this); + this.updateDeco(); + this.updateInner([new ChangedRange(0, 0, 0, view.state.doc.length)], 0); + } + get root() { return this.view.root; } + get editorView() { return this.view; } + get length() { return this.view.state.doc.length; } + // Update the document view to a given state. scrollIntoView can be + // used as a hint to compute a new viewport that includes that + // position, if we know the editor is going to scroll that position + // into view. + update(update) { + let changedRanges = update.changedRanges; + if (this.minWidth > 0 && changedRanges.length) { + if (!changedRanges.every(({ fromA, toA }) => toA < this.minWidthFrom || fromA > this.minWidthTo)) { + this.minWidth = this.minWidthFrom = this.minWidthTo = 0; + } + else { + this.minWidthFrom = update.changes.mapPos(this.minWidthFrom, 1); + this.minWidthTo = update.changes.mapPos(this.minWidthTo, 1); + } + } + if (this.view.inputState.composing < 0) + this.compositionDeco = Decoration.none; + else if (update.transactions.length || this.dirty) + this.compositionDeco = computeCompositionDeco(this.view, update.changes); + // When the DOM nodes around the selection are moved to another + // parent, Chrome sometimes reports a different selection through + // getSelection than the one that it actually shows to the user. + // This forces a selection update when lines are joined to work + // around that. Issue #54 + if ((browser.ie || browser.chrome) && !this.compositionDeco.size && update && + update.state.doc.lines != update.startState.doc.lines) + this.forceSelection = true; + let prevDeco = this.decorations, deco = this.updateDeco(); + let decoDiff = findChangedDeco(prevDeco, deco, update.changes); + changedRanges = ChangedRange.extendWithRanges(changedRanges, decoDiff); + if (this.dirty == 0 /* Not */ && changedRanges.length == 0) { + return false; + } + else { + this.updateInner(changedRanges, update.startState.doc.length); + if (update.transactions.length) + this.lastUpdate = Date.now(); + return true; + } + } + // Used by update and the constructor do perform the actual DOM + // update + updateInner(changes, oldLength) { + this.view.viewState.mustMeasureContent = true; + this.updateChildren(changes, oldLength); + let { observer } = this.view; + observer.ignore(() => { + // Lock the height during redrawing, since Chrome sometimes + // messes with the scroll position during DOM mutation (though + // no relayout is triggered and I cannot imagine how it can + // recompute the scroll position without a layout) + this.dom.style.height = this.view.viewState.contentHeight + "px"; + this.dom.style.flexBasis = this.minWidth ? this.minWidth + "px" : ""; + // Chrome will sometimes, when DOM mutations occur directly + // around the selection, get confused and report a different + // selection from the one it displays (issue #218). This tries + // to detect that situation. + let track = browser.chrome || browser.ios ? { node: observer.selectionRange.focusNode, written: false } : undefined; + this.sync(track); + this.dirty = 0 /* Not */; + if (track && (track.written || observer.selectionRange.focusNode != track.node)) + this.forceSelection = true; + this.dom.style.height = ""; + }); + let gaps = []; + if (this.view.viewport.from || this.view.viewport.to < this.view.state.doc.length) + for (let child of this.children) + if (child instanceof BlockWidgetView && child.widget instanceof BlockGapWidget) + gaps.push(child.dom); + observer.updateGaps(gaps); + } + updateChildren(changes, oldLength) { + let cursor = this.childCursor(oldLength); + for (let i = changes.length - 1;; i--) { + let next = i >= 0 ? changes[i] : null; + if (!next) + break; + let { fromA, toA, fromB, toB } = next; + let { content, breakAtStart, openStart, openEnd } = ContentBuilder.build(this.view.state.doc, fromB, toB, this.decorations, this.dynamicDecorationMap); + let { i: toI, off: toOff } = cursor.findPos(toA, 1); + let { i: fromI, off: fromOff } = cursor.findPos(fromA, -1); + replaceRange(this, fromI, fromOff, toI, toOff, content, breakAtStart, openStart, openEnd); + } + } + // Sync the DOM selection to this.state.selection + updateSelection(mustRead = false, fromPointer = false) { + if (mustRead) + this.view.observer.readSelectionRange(); + if (!(fromPointer || this.mayControlSelection()) || + browser.ios && this.view.inputState.rapidCompositionStart) + return; + let force = this.forceSelection; + this.forceSelection = false; + let main = this.view.state.selection.main; + // FIXME need to handle the case where the selection falls inside a block range + let anchor = this.domAtPos(main.anchor); + let head = main.empty ? anchor : this.domAtPos(main.head); + // Always reset on Firefox when next to an uneditable node to + // avoid invisible cursor bugs (#111) + if (browser.gecko && main.empty && betweenUneditable(anchor)) { + let dummy = document.createTextNode(""); + this.view.observer.ignore(() => anchor.node.insertBefore(dummy, anchor.node.childNodes[anchor.offset] || null)); + anchor = head = new DOMPos(dummy, 0); + force = true; + } + let domSel = this.view.observer.selectionRange; + // If the selection is already here, or in an equivalent position, don't touch it + if (force || !domSel.focusNode || + !isEquivalentPosition(anchor.node, anchor.offset, domSel.anchorNode, domSel.anchorOffset) || + !isEquivalentPosition(head.node, head.offset, domSel.focusNode, domSel.focusOffset)) { + this.view.observer.ignore(() => { + // Chrome Android will hide the virtual keyboard when tapping + // inside an uneditable node, and not bring it back when we + // move the cursor to its proper position. This tries to + // restore the keyboard by cycling focus. + if (browser.android && browser.chrome && this.dom.contains(domSel.focusNode) && + inUneditable(domSel.focusNode, this.dom)) { + this.dom.blur(); + this.dom.focus({ preventScroll: true }); + } + let rawSel = getSelection(this.root); + if (main.empty) { + // Work around https://bugzilla.mozilla.org/show_bug.cgi?id=1612076 + if (browser.gecko) { + let nextTo = nextToUneditable(anchor.node, anchor.offset); + if (nextTo && nextTo != (1 /* Before */ | 2 /* After */)) { + let text = nearbyTextNode(anchor.node, anchor.offset, nextTo == 1 /* Before */ ? 1 : -1); + if (text) + anchor = new DOMPos(text, nextTo == 1 /* Before */ ? 0 : text.nodeValue.length); + } + } + rawSel.collapse(anchor.node, anchor.offset); + if (main.bidiLevel != null && domSel.cursorBidiLevel != null) + domSel.cursorBidiLevel = main.bidiLevel; + } + else if (rawSel.extend) { + // Selection.extend can be used to create an 'inverted' selection + // (one where the focus is before the anchor), but not all + // browsers support it yet. + rawSel.collapse(anchor.node, anchor.offset); + rawSel.extend(head.node, head.offset); + } + else { + // Primitive (IE) way + let range = document.createRange(); + if (main.anchor > main.head) + [anchor, head] = [head, anchor]; + range.setEnd(head.node, head.offset); + range.setStart(anchor.node, anchor.offset); + rawSel.removeAllRanges(); + rawSel.addRange(range); + } + }); + this.view.observer.setSelectionRange(anchor, head); + } + this.impreciseAnchor = anchor.precise ? null : new DOMPos(domSel.anchorNode, domSel.anchorOffset); + this.impreciseHead = head.precise ? null : new DOMPos(domSel.focusNode, domSel.focusOffset); + } + enforceCursorAssoc() { + if (this.compositionDeco.size) + return; + let cursor = this.view.state.selection.main; + let sel = getSelection(this.root); + if (!cursor.empty || !cursor.assoc || !sel.modify) + return; + let line = LineView.find(this, cursor.head); + if (!line) + return; + let lineStart = line.posAtStart; + if (cursor.head == lineStart || cursor.head == lineStart + line.length) + return; + let before = this.coordsAt(cursor.head, -1), after = this.coordsAt(cursor.head, 1); + if (!before || !after || before.bottom > after.top) + return; + let dom = this.domAtPos(cursor.head + cursor.assoc); + sel.collapse(dom.node, dom.offset); + sel.modify("move", cursor.assoc < 0 ? "forward" : "backward", "lineboundary"); + } + mayControlSelection() { + return this.view.state.facet(editable) ? this.root.activeElement == this.dom + : hasSelection(this.dom, this.view.observer.selectionRange); + } + nearest(dom) { + for (let cur = dom; cur;) { + let domView = ContentView.get(cur); + if (domView && domView.rootView == this) + return domView; + cur = cur.parentNode; + } + return null; + } + posFromDOM(node, offset) { + let view = this.nearest(node); + if (!view) + throw new RangeError("Trying to find position for a DOM position outside of the document"); + return view.localPosFromDOM(node, offset) + view.posAtStart; + } + domAtPos(pos) { + let { i, off } = this.childCursor().findPos(pos, -1); + for (; i < this.children.length - 1;) { + let child = this.children[i]; + if (off < child.length || child instanceof LineView) + break; + i++; + off = 0; + } + return this.children[i].domAtPos(off); + } + coordsAt(pos, side) { + for (let off = this.length, i = this.children.length - 1;; i--) { + let child = this.children[i], start = off - child.breakAfter - child.length; + if (pos > start || + (pos == start && child.type != exports.BlockType.WidgetBefore && child.type != exports.BlockType.WidgetAfter && + (!i || side == 2 || this.children[i - 1].breakAfter || + (this.children[i - 1].type == exports.BlockType.WidgetBefore && side > -2)))) + return child.coordsAt(pos - start, side); + off = start; + } + } + measureVisibleLineHeights(viewport) { + let result = [], { from, to } = viewport; + let contentWidth = this.view.contentDOM.clientWidth; + let isWider = contentWidth > Math.max(this.view.scrollDOM.clientWidth, this.minWidth) + 1; + let widest = -1, ltr = this.view.textDirection == exports.Direction.LTR; + for (let pos = 0, i = 0; i < this.children.length; i++) { + let child = this.children[i], end = pos + child.length; + if (end > to) + break; + if (pos >= from) { + let childRect = child.dom.getBoundingClientRect(); + result.push(childRect.height); + if (isWider) { + let last = child.dom.lastChild; + let rects = last ? clientRectsFor(last) : []; + if (rects.length) { + let rect = rects[rects.length - 1]; + let width = ltr ? rect.right - childRect.left : childRect.right - rect.left; + if (width > widest) { + widest = width; + this.minWidth = contentWidth; + this.minWidthFrom = pos; + this.minWidthTo = end; + } + } + } + } + pos = end + child.breakAfter; + } + return result; + } + textDirectionAt(pos) { + let { i } = this.childPos(pos, 1); + return getComputedStyle(this.children[i].dom).direction == "rtl" ? exports.Direction.RTL : exports.Direction.LTR; + } + measureTextSize() { + for (let child of this.children) { + if (child instanceof LineView) { + let measure = child.measureTextSize(); + if (measure) + return measure; + } + } + // If no workable line exists, force a layout of a measurable element + let dummy = document.createElement("div"), lineHeight, charWidth; + dummy.className = "cm-line"; + dummy.textContent = "abc def ghi jkl mno pqr stu"; + this.view.observer.ignore(() => { + this.dom.appendChild(dummy); + let rect = clientRectsFor(dummy.firstChild)[0]; + lineHeight = dummy.getBoundingClientRect().height; + charWidth = rect ? rect.width / 27 : 7; + dummy.remove(); + }); + return { lineHeight, charWidth }; + } + childCursor(pos = this.length) { + // Move back to start of last element when possible, so that + // `ChildCursor.findPos` doesn't have to deal with the edge case + // of being after the last element. + let i = this.children.length; + if (i) + pos -= this.children[--i].length; + return new ChildCursor(this.children, pos, i); + } + computeBlockGapDeco() { + let deco = [], vs = this.view.viewState; + for (let pos = 0, i = 0;; i++) { + let next = i == vs.viewports.length ? null : vs.viewports[i]; + let end = next ? next.from - 1 : this.length; + if (end > pos) { + let height = vs.lineBlockAt(end).bottom - vs.lineBlockAt(pos).top; + deco.push(Decoration.replace({ + widget: new BlockGapWidget(height), + block: true, + inclusive: true, + isBlockGap: true, + }).range(pos, end)); + } + if (!next) + break; + pos = next.to + 1; + } + return Decoration.set(deco); + } + updateDeco() { + let allDeco = this.view.state.facet(decorations).map((d, i) => { + let dynamic = this.dynamicDecorationMap[i] = typeof d == "function"; + return dynamic ? d(this.view) : d; + }); + for (let i = allDeco.length; i < allDeco.length + 3; i++) + this.dynamicDecorationMap[i] = false; + return this.decorations = [ + ...allDeco, + this.compositionDeco, + this.computeBlockGapDeco(), + this.view.viewState.lineGapDeco + ]; + } + scrollIntoView(target) { + let { range } = target; + let rect = this.coordsAt(range.head, range.empty ? range.assoc : range.head > range.anchor ? -1 : 1), other; + if (!rect) + return; + if (!range.empty && (other = this.coordsAt(range.anchor, range.anchor > range.head ? -1 : 1))) + rect = { left: Math.min(rect.left, other.left), top: Math.min(rect.top, other.top), + right: Math.max(rect.right, other.right), bottom: Math.max(rect.bottom, other.bottom) }; + let mLeft = 0, mRight = 0, mTop = 0, mBottom = 0; + for (let margins of this.view.state.facet(scrollMargins).map(f => f(this.view))) + if (margins) { + let { left, right, top, bottom } = margins; + if (left != null) + mLeft = Math.max(mLeft, left); + if (right != null) + mRight = Math.max(mRight, right); + if (top != null) + mTop = Math.max(mTop, top); + if (bottom != null) + mBottom = Math.max(mBottom, bottom); + } + let targetRect = { + left: rect.left - mLeft, top: rect.top - mTop, + right: rect.right + mRight, bottom: rect.bottom + mBottom + }; + scrollRectIntoView(this.view.scrollDOM, targetRect, range.head < range.anchor ? -1 : 1, target.x, target.y, target.xMargin, target.yMargin, this.view.textDirection == exports.Direction.LTR); + } +} +function betweenUneditable(pos) { + return pos.node.nodeType == 1 && pos.node.firstChild && + (pos.offset == 0 || pos.node.childNodes[pos.offset - 1].contentEditable == "false") && + (pos.offset == pos.node.childNodes.length || pos.node.childNodes[pos.offset].contentEditable == "false"); +} +class BlockGapWidget extends WidgetType { + constructor(height) { + super(); + this.height = height; + } + toDOM() { + let elt = document.createElement("div"); + this.updateDOM(elt); + return elt; + } + eq(other) { return other.height == this.height; } + updateDOM(elt) { + elt.style.height = this.height + "px"; + return true; + } + get estimatedHeight() { return this.height; } +} +function compositionSurroundingNode(view) { + let sel = view.observer.selectionRange; + let textNode = sel.focusNode && nearbyTextNode(sel.focusNode, sel.focusOffset, 0); + if (!textNode) + return null; + let cView = view.docView.nearest(textNode); + if (!cView) + return null; + if (cView instanceof LineView) { + let topNode = textNode; + while (topNode.parentNode != cView.dom) + topNode = topNode.parentNode; + let prev = topNode.previousSibling; + while (prev && !ContentView.get(prev)) + prev = prev.previousSibling; + let pos = prev ? ContentView.get(prev).posAtEnd : cView.posAtStart; + return { from: pos, to: pos, node: topNode, text: textNode }; + } + else { + for (;;) { + let { parent } = cView; + if (!parent) + return null; + if (parent instanceof LineView) + break; + cView = parent; + } + let from = cView.posAtStart; + return { from, to: from + cView.length, node: cView.dom, text: textNode }; + } +} +function computeCompositionDeco(view, changes) { + let surrounding = compositionSurroundingNode(view); + if (!surrounding) + return Decoration.none; + let { from, to, node, text: textNode } = surrounding; + let newFrom = changes.mapPos(from, 1), newTo = Math.max(newFrom, changes.mapPos(to, -1)); + let { state } = view, text = node.nodeType == 3 ? node.nodeValue : + new DOMReader([], state).readRange(node.firstChild, null).text; + if (newTo - newFrom < text.length) { + if (state.doc.sliceString(newFrom, Math.min(state.doc.length, newFrom + text.length), LineBreakPlaceholder) == text) + newTo = newFrom + text.length; + else if (state.doc.sliceString(Math.max(0, newTo - text.length), newTo, LineBreakPlaceholder) == text) + newFrom = newTo - text.length; + else + return Decoration.none; + } + else if (state.doc.sliceString(newFrom, newTo, LineBreakPlaceholder) != text) { + return Decoration.none; + } + let topView = ContentView.get(node); + if (topView instanceof CompositionView) + topView = topView.widget.topView; + else if (topView) + topView.parent = null; + return Decoration.set(Decoration.replace({ widget: new CompositionWidget(node, textNode, topView), inclusive: true }) + .range(newFrom, newTo)); +} +class CompositionWidget extends WidgetType { + constructor(top, text, topView) { + super(); + this.top = top; + this.text = text; + this.topView = topView; + } + eq(other) { return this.top == other.top && this.text == other.text; } + toDOM() { return this.top; } + ignoreEvent() { return false; } + get customView() { return CompositionView; } +} +function nearbyTextNode(node, offset, side) { + for (;;) { + if (node.nodeType == 3) + return node; + if (node.nodeType == 1 && offset > 0 && side <= 0) { + node = node.childNodes[offset - 1]; + offset = maxOffset(node); + } + else if (node.nodeType == 1 && offset < node.childNodes.length && side >= 0) { + node = node.childNodes[offset]; + offset = 0; + } + else { + return null; + } + } +} +function nextToUneditable(node, offset) { + if (node.nodeType != 1) + return 0; + return (offset && node.childNodes[offset - 1].contentEditable == "false" ? 1 /* Before */ : 0) | + (offset < node.childNodes.length && node.childNodes[offset].contentEditable == "false" ? 2 /* After */ : 0); +} +class DecorationComparator$1 { + constructor() { + this.changes = []; + } + compareRange(from, to) { addRange(from, to, this.changes); } + comparePoint(from, to) { addRange(from, to, this.changes); } +} +function findChangedDeco(a, b, diff) { + let comp = new DecorationComparator$1; + state.RangeSet.compare(a, b, diff, comp); + return comp.changes; +} +function inUneditable(node, inside) { + for (let cur = node; cur && cur != inside; cur = cur.assignedSlot || cur.parentNode) { + if (cur.nodeType == 1 && cur.contentEditable == 'false') { + return true; + } + } + return false; +} + +function groupAt(state$1, pos, bias = 1) { + let categorize = state$1.charCategorizer(pos); + let line = state$1.doc.lineAt(pos), linePos = pos - line.from; + if (line.length == 0) + return state.EditorSelection.cursor(pos); + if (linePos == 0) + bias = 1; + else if (linePos == line.length) + bias = -1; + let from = linePos, to = linePos; + if (bias < 0) + from = state.findClusterBreak(line.text, linePos, false); + else + to = state.findClusterBreak(line.text, linePos); + let cat = categorize(line.text.slice(from, to)); + while (from > 0) { + let prev = state.findClusterBreak(line.text, from, false); + if (categorize(line.text.slice(prev, from)) != cat) + break; + from = prev; + } + while (to < line.length) { + let next = state.findClusterBreak(line.text, to); + if (categorize(line.text.slice(to, next)) != cat) + break; + to = next; + } + return state.EditorSelection.range(from + line.from, to + line.from); +} +// Search the DOM for the {node, offset} position closest to the given +// coordinates. Very inefficient and crude, but can usually be avoided +// by calling caret(Position|Range)FromPoint instead. +function getdx(x, rect) { + return rect.left > x ? rect.left - x : Math.max(0, x - rect.right); +} +function getdy(y, rect) { + return rect.top > y ? rect.top - y : Math.max(0, y - rect.bottom); +} +function yOverlap(a, b) { + return a.top < b.bottom - 1 && a.bottom > b.top + 1; +} +function upTop(rect, top) { + return top < rect.top ? { top, left: rect.left, right: rect.right, bottom: rect.bottom } : rect; +} +function upBot(rect, bottom) { + return bottom > rect.bottom ? { top: rect.top, left: rect.left, right: rect.right, bottom } : rect; +} +function domPosAtCoords(parent, x, y) { + let closest, closestRect, closestX, closestY; + let above, below, aboveRect, belowRect; + for (let child = parent.firstChild; child; child = child.nextSibling) { + let rects = clientRectsFor(child); + for (let i = 0; i < rects.length; i++) { + let rect = rects[i]; + if (closestRect && yOverlap(closestRect, rect)) + rect = upTop(upBot(rect, closestRect.bottom), closestRect.top); + let dx = getdx(x, rect), dy = getdy(y, rect); + if (dx == 0 && dy == 0) + return child.nodeType == 3 ? domPosInText(child, x, y) : domPosAtCoords(child, x, y); + if (!closest || closestY > dy || closestY == dy && closestX > dx) { + closest = child; + closestRect = rect; + closestX = dx; + closestY = dy; + } + if (dx == 0) { + if (y > rect.bottom && (!aboveRect || aboveRect.bottom < rect.bottom)) { + above = child; + aboveRect = rect; + } + else if (y < rect.top && (!belowRect || belowRect.top > rect.top)) { + below = child; + belowRect = rect; + } + } + else if (aboveRect && yOverlap(aboveRect, rect)) { + aboveRect = upBot(aboveRect, rect.bottom); + } + else if (belowRect && yOverlap(belowRect, rect)) { + belowRect = upTop(belowRect, rect.top); + } + } + } + if (aboveRect && aboveRect.bottom >= y) { + closest = above; + closestRect = aboveRect; + } + else if (belowRect && belowRect.top <= y) { + closest = below; + closestRect = belowRect; + } + if (!closest) + return { node: parent, offset: 0 }; + let clipX = Math.max(closestRect.left, Math.min(closestRect.right, x)); + if (closest.nodeType == 3) + return domPosInText(closest, clipX, y); + if (!closestX && closest.contentEditable == "true") + return domPosAtCoords(closest, clipX, y); + let offset = Array.prototype.indexOf.call(parent.childNodes, closest) + + (x >= (closestRect.left + closestRect.right) / 2 ? 1 : 0); + return { node: parent, offset }; +} +function domPosInText(node, x, y) { + let len = node.nodeValue.length; + let closestOffset = -1, closestDY = 1e9, generalSide = 0; + for (let i = 0; i < len; i++) { + let rects = textRange(node, i, i + 1).getClientRects(); + for (let j = 0; j < rects.length; j++) { + let rect = rects[j]; + if (rect.top == rect.bottom) + continue; + if (!generalSide) + generalSide = x - rect.left; + let dy = (rect.top > y ? rect.top - y : y - rect.bottom) - 1; + if (rect.left - 1 <= x && rect.right + 1 >= x && dy < closestDY) { + let right = x >= (rect.left + rect.right) / 2, after = right; + if (browser.chrome || browser.gecko) { + // Check for RTL on browsers that support getting client + // rects for empty ranges. + let rectBefore = textRange(node, i).getBoundingClientRect(); + if (rectBefore.left == rect.right) + after = !right; + } + if (dy <= 0) + return { node, offset: i + (after ? 1 : 0) }; + closestOffset = i + (after ? 1 : 0); + closestDY = dy; + } + } + } + return { node, offset: closestOffset > -1 ? closestOffset : generalSide > 0 ? node.nodeValue.length : 0 }; +} +function posAtCoords(view, { x, y }, precise, bias = -1) { + var _a; + let content = view.contentDOM.getBoundingClientRect(), docTop = content.top + view.viewState.paddingTop; + let block, { docHeight } = view.viewState; + let yOffset = y - docTop; + if (yOffset < 0) + return 0; + if (yOffset > docHeight) + return view.state.doc.length; + // Scan for a text block near the queried y position + for (let halfLine = view.defaultLineHeight / 2, bounced = false;;) { + block = view.elementAtHeight(yOffset); + if (block.type == exports.BlockType.Text) + break; + for (;;) { + // Move the y position out of this block + yOffset = bias > 0 ? block.bottom + halfLine : block.top - halfLine; + if (yOffset >= 0 && yOffset <= docHeight) + break; + // If the document consists entirely of replaced widgets, we + // won't find a text block, so return 0 + if (bounced) + return precise ? null : 0; + bounced = true; + bias = -bias; + } + } + y = docTop + yOffset; + let lineStart = block.from; + // If this is outside of the rendered viewport, we can't determine a position + if (lineStart < view.viewport.from) + return view.viewport.from == 0 ? 0 : precise ? null : posAtCoordsImprecise(view, content, block, x, y); + if (lineStart > view.viewport.to) + return view.viewport.to == view.state.doc.length ? view.state.doc.length : + precise ? null : posAtCoordsImprecise(view, content, block, x, y); + // Prefer ShadowRootOrDocument.elementFromPoint if present, fall back to document if not + let doc = view.dom.ownerDocument; + let root = view.root.elementFromPoint ? view.root : doc; + let element = root.elementFromPoint(x, y); + if (element && !view.contentDOM.contains(element)) + element = null; + // If the element is unexpected, clip x at the sides of the content area and try again + if (!element) { + x = Math.max(content.left + 1, Math.min(content.right - 1, x)); + element = root.elementFromPoint(x, y); + if (element && !view.contentDOM.contains(element)) + element = null; + } + // There's visible editor content under the point, so we can try + // using caret(Position|Range)FromPoint as a shortcut + let node, offset = -1; + if (element && ((_a = view.docView.nearest(element)) === null || _a === void 0 ? void 0 : _a.isEditable) != false) { + if (doc.caretPositionFromPoint) { + let pos = doc.caretPositionFromPoint(x, y); + if (pos) + ({ offsetNode: node, offset } = pos); + } + else if (doc.caretRangeFromPoint) { + let range = doc.caretRangeFromPoint(x, y); + if (range) { + ({ startContainer: node, startOffset: offset } = range); + if (browser.safari && isSuspiciousCaretResult(node, offset, x)) + node = undefined; + } + } + } + // No luck, do our own (potentially expensive) search + if (!node || !view.docView.dom.contains(node)) { + let line = LineView.find(view.docView, lineStart); + if (!line) + return yOffset > block.top + block.height / 2 ? block.to : block.from; + ({ node, offset } = domPosAtCoords(line.dom, x, y)); + } + return view.docView.posFromDOM(node, offset); +} +function posAtCoordsImprecise(view, contentRect, block, x, y) { + let into = Math.round((x - contentRect.left) * view.defaultCharacterWidth); + if (view.lineWrapping && block.height > view.defaultLineHeight * 1.5) { + let line = Math.floor((y - block.top) / view.defaultLineHeight); + into += line * view.viewState.heightOracle.lineLength; + } + let content = view.state.sliceDoc(block.from, block.to); + return block.from + state.findColumn(content, into, view.state.tabSize); +} +// In case of a high line height, Safari's caretRangeFromPoint treats +// the space between lines as belonging to the last character of the +// line before. This is used to detect such a result so that it can be +// ignored (issue #401). +function isSuspiciousCaretResult(node, offset, x) { + let len; + if (node.nodeType != 3 || offset != (len = node.nodeValue.length)) + return false; + for (let next = node.nextSibling; next; next = next.nextSibling) + if (next.nodeType != 1 || next.nodeName != "BR") + return false; + return textRange(node, len - 1, len).getBoundingClientRect().left > x; +} +function moveToLineBoundary(view, start, forward, includeWrap) { + let line = view.state.doc.lineAt(start.head); + let coords = !includeWrap || !view.lineWrapping ? null + : view.coordsAtPos(start.assoc < 0 && start.head > line.from ? start.head - 1 : start.head); + if (coords) { + let editorRect = view.dom.getBoundingClientRect(); + let direction = view.textDirectionAt(line.from); + let pos = view.posAtCoords({ x: forward == (direction == exports.Direction.LTR) ? editorRect.right - 1 : editorRect.left + 1, + y: (coords.top + coords.bottom) / 2 }); + if (pos != null) + return state.EditorSelection.cursor(pos, forward ? -1 : 1); + } + let lineView = LineView.find(view.docView, start.head); + let end = lineView ? (forward ? lineView.posAtEnd : lineView.posAtStart) : (forward ? line.to : line.from); + return state.EditorSelection.cursor(end, forward ? -1 : 1); +} +function moveByChar(view, start, forward, by) { + let line = view.state.doc.lineAt(start.head), spans = view.bidiSpans(line); + let direction = view.textDirectionAt(line.from); + for (let cur = start, check = null;;) { + let next = moveVisually(line, spans, direction, cur, forward), char = movedOver; + if (!next) { + if (line.number == (forward ? view.state.doc.lines : 1)) + return cur; + char = "\n"; + line = view.state.doc.line(line.number + (forward ? 1 : -1)); + spans = view.bidiSpans(line); + next = state.EditorSelection.cursor(forward ? line.from : line.to); + } + if (!check) { + if (!by) + return next; + check = by(char); + } + else if (!check(char)) { + return cur; + } + cur = next; + } +} +function byGroup(view, pos, start) { + let categorize = view.state.charCategorizer(pos); + let cat = categorize(start); + return (next) => { + let nextCat = categorize(next); + if (cat == state.CharCategory.Space) + cat = nextCat; + return cat == nextCat; + }; +} +function moveVertically(view, start, forward, distance) { + let startPos = start.head, dir = forward ? 1 : -1; + if (startPos == (forward ? view.state.doc.length : 0)) + return state.EditorSelection.cursor(startPos, start.assoc); + let goal = start.goalColumn, startY; + let rect = view.contentDOM.getBoundingClientRect(); + let startCoords = view.coordsAtPos(startPos), docTop = view.documentTop; + if (startCoords) { + if (goal == null) + goal = startCoords.left - rect.left; + startY = dir < 0 ? startCoords.top : startCoords.bottom; + } + else { + let line = view.viewState.lineBlockAt(startPos); + if (goal == null) + goal = Math.min(rect.right - rect.left, view.defaultCharacterWidth * (startPos - line.from)); + startY = (dir < 0 ? line.top : line.bottom) + docTop; + } + let resolvedGoal = rect.left + goal; + let dist = distance !== null && distance !== void 0 ? distance : (view.defaultLineHeight >> 1); + for (let extra = 0;; extra += 10) { + let curY = startY + (dist + extra) * dir; + let pos = posAtCoords(view, { x: resolvedGoal, y: curY }, false, dir); + if (curY < rect.top || curY > rect.bottom || (dir < 0 ? pos < startPos : pos > startPos)) + return state.EditorSelection.cursor(pos, start.assoc, undefined, goal); + } +} +function skipAtoms(view, oldPos, pos) { + let atoms = view.state.facet(atomicRanges).map(f => f(view)); + for (;;) { + let moved = false; + for (let set of atoms) { + set.between(pos.from - 1, pos.from + 1, (from, to, value) => { + if (pos.from > from && pos.from < to) { + pos = oldPos.from > pos.from ? state.EditorSelection.cursor(from, 1) : state.EditorSelection.cursor(to, -1); + moved = true; + } + }); + } + if (!moved) + return pos; + } +} + +// This will also be where dragging info and such goes +class InputState { + constructor(view) { + this.lastKeyCode = 0; + this.lastKeyTime = 0; + this.chromeScrollHack = -1; + // On iOS, some keys need to have their default behavior happen + // (after which we retroactively handle them and reset the DOM) to + // avoid messing up the virtual keyboard state. + this.pendingIOSKey = undefined; + this.lastSelectionOrigin = null; + this.lastSelectionTime = 0; + this.lastEscPress = 0; + this.lastContextMenu = 0; + this.scrollHandlers = []; + this.registeredEvents = []; + this.customHandlers = []; + // -1 means not in a composition. Otherwise, this counts the number + // of changes made during the composition. The count is used to + // avoid treating the start state of the composition, before any + // changes have been made, as part of the composition. + this.composing = -1; + // Tracks whether the next change should be marked as starting the + // composition (null means no composition, true means next is the + // first, false means first has already been marked for this + // composition) + this.compositionFirstChange = null; + this.compositionEndedAt = 0; + this.rapidCompositionStart = false; + this.mouseSelection = null; + for (let type in handlers) { + let handler = handlers[type]; + view.contentDOM.addEventListener(type, (event) => { + if (!eventBelongsToEditor(view, event) || this.ignoreDuringComposition(event)) + return; + if (type == "keydown" && this.keydown(view, event)) + return; + if (this.mustFlushObserver(event)) + view.observer.forceFlush(); + if (this.runCustomHandlers(type, view, event)) + event.preventDefault(); + else + handler(view, event); + }); + this.registeredEvents.push(type); + } + if (browser.chrome && browser.chrome_version >= 102) { + // On Chrome 102, viewport updates somehow stop wheel-based + // scrolling. Turning off pointer events during the scroll seems + // to avoid the issue. + view.scrollDOM.addEventListener("wheel", () => { + if (this.chromeScrollHack < 0) + view.contentDOM.style.pointerEvents = "none"; + else + window.clearTimeout(this.chromeScrollHack); + this.chromeScrollHack = setTimeout(() => { + this.chromeScrollHack = -1; + view.contentDOM.style.pointerEvents = ""; + }, 100); + }, { passive: true }); + } + this.notifiedFocused = view.hasFocus; + // On Safari adding an input event handler somehow prevents an + // issue where the composition vanishes when you press enter. + if (browser.safari) + view.contentDOM.addEventListener("input", () => null); + } + setSelectionOrigin(origin) { + this.lastSelectionOrigin = origin; + this.lastSelectionTime = Date.now(); + } + ensureHandlers(view, plugins) { + var _a; + let handlers; + this.customHandlers = []; + for (let plugin of plugins) + if (handlers = (_a = plugin.update(view).spec) === null || _a === void 0 ? void 0 : _a.domEventHandlers) { + this.customHandlers.push({ plugin: plugin.value, handlers }); + for (let type in handlers) + if (this.registeredEvents.indexOf(type) < 0 && type != "scroll") { + this.registeredEvents.push(type); + view.contentDOM.addEventListener(type, (event) => { + if (!eventBelongsToEditor(view, event)) + return; + if (this.runCustomHandlers(type, view, event)) + event.preventDefault(); + }); + } + } + } + runCustomHandlers(type, view, event) { + for (let set of this.customHandlers) { + let handler = set.handlers[type]; + if (handler) { + try { + if (handler.call(set.plugin, event, view) || event.defaultPrevented) + return true; + } + catch (e) { + logException(view.state, e); + } + } + } + return false; + } + runScrollHandlers(view, event) { + for (let set of this.customHandlers) { + let handler = set.handlers.scroll; + if (handler) { + try { + handler.call(set.plugin, event, view); + } + catch (e) { + logException(view.state, e); + } + } + } + } + keydown(view, event) { + // Must always run, even if a custom handler handled the event + this.lastKeyCode = event.keyCode; + this.lastKeyTime = Date.now(); + if (event.keyCode == 9 && Date.now() < this.lastEscPress + 2000) + return true; + // Chrome for Android usually doesn't fire proper key events, but + // occasionally does, usually surrounded by a bunch of complicated + // composition changes. When an enter or backspace key event is + // seen, hold off on handling DOM events for a bit, and then + // dispatch it. + if (browser.android && browser.chrome && !event.synthetic && + (event.keyCode == 13 || event.keyCode == 8)) { + view.observer.delayAndroidKey(event.key, event.keyCode); + return true; + } + // Prevent the default behavior of Enter on iOS makes the + // virtual keyboard get stuck in the wrong (lowercase) + // state. So we let it go through, and then, in + // applyDOMChange, notify key handlers of it and reset to + // the state they produce. + let pending; + if (browser.ios && (pending = PendingKeys.find(key => key.keyCode == event.keyCode)) && + !(event.ctrlKey || event.altKey || event.metaKey) && !event.synthetic) { + this.pendingIOSKey = pending; + setTimeout(() => this.flushIOSKey(view), 250); + return true; + } + return false; + } + flushIOSKey(view) { + let key = this.pendingIOSKey; + if (!key) + return false; + this.pendingIOSKey = undefined; + return dispatchKey(view.contentDOM, key.key, key.keyCode); + } + ignoreDuringComposition(event) { + if (!/^key/.test(event.type)) + return false; + if (this.composing > 0) + return true; + // See https://www.stum.de/2016/06/24/handling-ime-events-in-javascript/. + // On some input method editors (IMEs), the Enter key is used to + // confirm character selection. On Safari, when Enter is pressed, + // compositionend and keydown events are sometimes emitted in the + // wrong order. The key event should still be ignored, even when + // it happens after the compositionend event. + if (browser.safari && Date.now() - this.compositionEndedAt < 100) { + this.compositionEndedAt = 0; + return true; + } + return false; + } + mustFlushObserver(event) { + return (event.type == "keydown" && event.keyCode != 229) || + event.type == "compositionend" && !browser.ios; + } + startMouseSelection(mouseSelection) { + if (this.mouseSelection) + this.mouseSelection.destroy(); + this.mouseSelection = mouseSelection; + } + update(update) { + if (this.mouseSelection) + this.mouseSelection.update(update); + if (update.transactions.length) + this.lastKeyCode = this.lastSelectionTime = 0; + } + destroy() { + if (this.mouseSelection) + this.mouseSelection.destroy(); + } +} +const PendingKeys = [ + { key: "Backspace", keyCode: 8, inputType: "deleteContentBackward" }, + { key: "Enter", keyCode: 13, inputType: "insertParagraph" }, + { key: "Delete", keyCode: 46, inputType: "deleteContentForward" } +]; +// Key codes for modifier keys +const modifierCodes = [16, 17, 18, 20, 91, 92, 224, 225]; +class MouseSelection { + constructor(view, startEvent, style, mustSelect) { + this.view = view; + this.style = style; + this.mustSelect = mustSelect; + this.lastEvent = startEvent; + let doc = view.contentDOM.ownerDocument; + doc.addEventListener("mousemove", this.move = this.move.bind(this)); + doc.addEventListener("mouseup", this.up = this.up.bind(this)); + this.extend = startEvent.shiftKey; + this.multiple = view.state.facet(state.EditorState.allowMultipleSelections) && addsSelectionRange(view, startEvent); + this.dragMove = dragMovesSelection(view, startEvent); + this.dragging = isInPrimarySelection(view, startEvent) && getClickType(startEvent) == 1 ? null : false; + // When clicking outside of the selection, immediately apply the + // effect of starting the selection + if (this.dragging === false) { + startEvent.preventDefault(); + this.select(startEvent); + } + } + move(event) { + if (event.buttons == 0) + return this.destroy(); + if (this.dragging !== false) + return; + this.select(this.lastEvent = event); + } + up(event) { + if (this.dragging == null) + this.select(this.lastEvent); + if (!this.dragging) + event.preventDefault(); + this.destroy(); + } + destroy() { + let doc = this.view.contentDOM.ownerDocument; + doc.removeEventListener("mousemove", this.move); + doc.removeEventListener("mouseup", this.up); + this.view.inputState.mouseSelection = null; + } + select(event) { + let selection = this.style.get(event, this.extend, this.multiple); + if (this.mustSelect || !selection.eq(this.view.state.selection) || + selection.main.assoc != this.view.state.selection.main.assoc) + this.view.dispatch({ + selection, + userEvent: "select.pointer", + scrollIntoView: true + }); + this.mustSelect = false; + } + update(update) { + if (update.docChanged && this.dragging) + this.dragging = this.dragging.map(update.changes); + if (this.style.update(update)) + setTimeout(() => this.select(this.lastEvent), 20); + } +} +function addsSelectionRange(view, event) { + let facet = view.state.facet(clickAddsSelectionRange); + return facet.length ? facet[0](event) : browser.mac ? event.metaKey : event.ctrlKey; +} +function dragMovesSelection(view, event) { + let facet = view.state.facet(dragMovesSelection$1); + return facet.length ? facet[0](event) : browser.mac ? !event.altKey : !event.ctrlKey; +} +function isInPrimarySelection(view, event) { + let { main } = view.state.selection; + if (main.empty) + return false; + // On boundary clicks, check whether the coordinates are inside the + // selection's client rectangles + let sel = getSelection(view.root); + if (sel.rangeCount == 0) + return true; + let rects = sel.getRangeAt(0).getClientRects(); + for (let i = 0; i < rects.length; i++) { + let rect = rects[i]; + if (rect.left <= event.clientX && rect.right >= event.clientX && + rect.top <= event.clientY && rect.bottom >= event.clientY) + return true; + } + return false; +} +function eventBelongsToEditor(view, event) { + if (!event.bubbles) + return true; + if (event.defaultPrevented) + return false; + for (let node = event.target, cView; node != view.contentDOM; node = node.parentNode) + if (!node || node.nodeType == 11 || ((cView = ContentView.get(node)) && cView.ignoreEvent(event))) + return false; + return true; +} +const handlers = Object.create(null); +// This is very crude, but unfortunately both these browsers _pretend_ +// that they have a clipboard API—all the objects and methods are +// there, they just don't work, and they are hard to test. +const brokenClipboardAPI = (browser.ie && browser.ie_version < 15) || + (browser.ios && browser.webkit_version < 604); +function capturePaste(view) { + let parent = view.dom.parentNode; + if (!parent) + return; + let target = parent.appendChild(document.createElement("textarea")); + target.style.cssText = "position: fixed; left: -10000px; top: 10px"; + target.focus(); + setTimeout(() => { + view.focus(); + target.remove(); + doPaste(view, target.value); + }, 50); +} +function doPaste(view, input) { + let { state: state$1 } = view, changes, i = 1, text = state$1.toText(input); + let byLine = text.lines == state$1.selection.ranges.length; + let linewise = lastLinewiseCopy != null && state$1.selection.ranges.every(r => r.empty) && lastLinewiseCopy == text.toString(); + if (linewise) { + let lastLine = -1; + changes = state$1.changeByRange(range => { + let line = state$1.doc.lineAt(range.from); + if (line.from == lastLine) + return { range }; + lastLine = line.from; + let insert = state$1.toText((byLine ? text.line(i++).text : input) + state$1.lineBreak); + return { changes: { from: line.from, insert }, + range: state.EditorSelection.cursor(range.from + insert.length) }; + }); + } + else if (byLine) { + changes = state$1.changeByRange(range => { + let line = text.line(i++); + return { changes: { from: range.from, to: range.to, insert: line.text }, + range: state.EditorSelection.cursor(range.from + line.length) }; + }); + } + else { + changes = state$1.replaceSelection(text); + } + view.dispatch(changes, { + userEvent: "input.paste", + scrollIntoView: true + }); +} +handlers.keydown = (view, event) => { + view.inputState.setSelectionOrigin("select"); + if (event.keyCode == 27) + view.inputState.lastEscPress = Date.now(); + else if (modifierCodes.indexOf(event.keyCode) < 0) + view.inputState.lastEscPress = 0; +}; +let lastTouch = 0; +handlers.touchstart = (view, e) => { + lastTouch = Date.now(); + view.inputState.setSelectionOrigin("select.pointer"); +}; +handlers.touchmove = view => { + view.inputState.setSelectionOrigin("select.pointer"); +}; +handlers.mousedown = (view, event) => { + view.observer.flush(); + if (lastTouch > Date.now() - 2000 && getClickType(event) == 1) + return; // Ignore touch interaction + let style = null; + for (let makeStyle of view.state.facet(mouseSelectionStyle)) { + style = makeStyle(view, event); + if (style) + break; + } + if (!style && event.button == 0) + style = basicMouseSelection(view, event); + if (style) { + let mustFocus = view.root.activeElement != view.contentDOM; + if (mustFocus) + view.observer.ignore(() => focusPreventScroll(view.contentDOM)); + view.inputState.startMouseSelection(new MouseSelection(view, event, style, mustFocus)); + } +}; +function rangeForClick(view, pos, bias, type) { + if (type == 1) { // Single click + return state.EditorSelection.cursor(pos, bias); + } + else if (type == 2) { // Double click + return groupAt(view.state, pos, bias); + } + else { // Triple click + let visual = LineView.find(view.docView, pos), line = view.state.doc.lineAt(visual ? visual.posAtEnd : pos); + let from = visual ? visual.posAtStart : line.from, to = visual ? visual.posAtEnd : line.to; + if (to < view.state.doc.length && to == line.to) + to++; + return state.EditorSelection.range(from, to); + } +} +let insideY = (y, rect) => y >= rect.top && y <= rect.bottom; +let inside = (x, y, rect) => insideY(y, rect) && x >= rect.left && x <= rect.right; +// Try to determine, for the given coordinates, associated with the +// given position, whether they are related to the element before or +// the element after the position. +function findPositionSide(view, pos, x, y) { + let line = LineView.find(view.docView, pos); + if (!line) + return 1; + let off = pos - line.posAtStart; + // Line boundaries point into the line + if (off == 0) + return 1; + if (off == line.length) + return -1; + // Positions on top of an element point at that element + let before = line.coordsAt(off, -1); + if (before && inside(x, y, before)) + return -1; + let after = line.coordsAt(off, 1); + if (after && inside(x, y, after)) + return 1; + // This is probably a line wrap point. Pick before if the point is + // beside it. + return before && insideY(y, before) ? -1 : 1; +} +function queryPos(view, event) { + let pos = view.posAtCoords({ x: event.clientX, y: event.clientY }, false); + return { pos, bias: findPositionSide(view, pos, event.clientX, event.clientY) }; +} +const BadMouseDetail = browser.ie && browser.ie_version <= 11; +let lastMouseDown = null, lastMouseDownCount = 0, lastMouseDownTime = 0; +function getClickType(event) { + if (!BadMouseDetail) + return event.detail; + let last = lastMouseDown, lastTime = lastMouseDownTime; + lastMouseDown = event; + lastMouseDownTime = Date.now(); + return lastMouseDownCount = !last || (lastTime > Date.now() - 400 && Math.abs(last.clientX - event.clientX) < 2 && + Math.abs(last.clientY - event.clientY) < 2) ? (lastMouseDownCount + 1) % 3 : 1; +} +function basicMouseSelection(view, event) { + let start = queryPos(view, event), type = getClickType(event); + let startSel = view.state.selection; + let last = start, lastEvent = event; + return { + update(update) { + if (update.docChanged) { + if (start) + start.pos = update.changes.mapPos(start.pos); + startSel = startSel.map(update.changes); + lastEvent = null; + } + }, + get(event, extend, multiple) { + let cur; + if (lastEvent && event.clientX == lastEvent.clientX && event.clientY == lastEvent.clientY) + cur = last; + else { + cur = last = queryPos(view, event); + lastEvent = event; + } + if (!cur || !start) + return startSel; + let range = rangeForClick(view, cur.pos, cur.bias, type); + if (start.pos != cur.pos && !extend) { + let startRange = rangeForClick(view, start.pos, start.bias, type); + let from = Math.min(startRange.from, range.from), to = Math.max(startRange.to, range.to); + range = from < range.from ? state.EditorSelection.range(from, to) : state.EditorSelection.range(to, from); + } + if (extend) + return startSel.replaceRange(startSel.main.extend(range.from, range.to)); + else if (multiple) + return startSel.addRange(range); + else + return state.EditorSelection.create([range]); + } + }; +} +handlers.dragstart = (view, event) => { + let { selection: { main } } = view.state; + let { mouseSelection } = view.inputState; + if (mouseSelection) + mouseSelection.dragging = main; + if (event.dataTransfer) { + event.dataTransfer.setData("Text", view.state.sliceDoc(main.from, main.to)); + event.dataTransfer.effectAllowed = "copyMove"; + } +}; +function dropText(view, event, text, direct) { + if (!text) + return; + let dropPos = view.posAtCoords({ x: event.clientX, y: event.clientY }, false); + event.preventDefault(); + let { mouseSelection } = view.inputState; + let del = direct && mouseSelection && mouseSelection.dragging && mouseSelection.dragMove ? + { from: mouseSelection.dragging.from, to: mouseSelection.dragging.to } : null; + let ins = { from: dropPos, insert: text }; + let changes = view.state.changes(del ? [del, ins] : ins); + view.focus(); + view.dispatch({ + changes, + selection: { anchor: changes.mapPos(dropPos, -1), head: changes.mapPos(dropPos, 1) }, + userEvent: del ? "move.drop" : "input.drop" + }); +} +handlers.drop = (view, event) => { + if (!event.dataTransfer) + return; + if (view.state.readOnly) + return event.preventDefault(); + let files = event.dataTransfer.files; + if (files && files.length) { // For a file drop, read the file's text. + event.preventDefault(); + let text = Array(files.length), read = 0; + let finishFile = () => { + if (++read == files.length) + dropText(view, event, text.filter(s => s != null).join(view.state.lineBreak), false); + }; + for (let i = 0; i < files.length; i++) { + let reader = new FileReader; + reader.onerror = finishFile; + reader.onload = () => { + if (!/[\x00-\x08\x0e-\x1f]{2}/.test(reader.result)) + text[i] = reader.result; + finishFile(); + }; + reader.readAsText(files[i]); + } + } + else { + dropText(view, event, event.dataTransfer.getData("Text"), true); + } +}; +handlers.paste = (view, event) => { + if (view.state.readOnly) + return event.preventDefault(); + view.observer.flush(); + let data = brokenClipboardAPI ? null : event.clipboardData; + if (data) { + doPaste(view, data.getData("text/plain")); + event.preventDefault(); + } + else { + capturePaste(view); + } +}; +function captureCopy(view, text) { + // The extra wrapper is somehow necessary on IE/Edge to prevent the + // content from being mangled when it is put onto the clipboard + let parent = view.dom.parentNode; + if (!parent) + return; + let target = parent.appendChild(document.createElement("textarea")); + target.style.cssText = "position: fixed; left: -10000px; top: 10px"; + target.value = text; + target.focus(); + target.selectionEnd = text.length; + target.selectionStart = 0; + setTimeout(() => { + target.remove(); + view.focus(); + }, 50); +} +function copiedRange(state) { + let content = [], ranges = [], linewise = false; + for (let range of state.selection.ranges) + if (!range.empty) { + content.push(state.sliceDoc(range.from, range.to)); + ranges.push(range); + } + if (!content.length) { + // Nothing selected, do a line-wise copy + let upto = -1; + for (let { from } of state.selection.ranges) { + let line = state.doc.lineAt(from); + if (line.number > upto) { + content.push(line.text); + ranges.push({ from: line.from, to: Math.min(state.doc.length, line.to + 1) }); + } + upto = line.number; + } + linewise = true; + } + return { text: content.join(state.lineBreak), ranges, linewise }; +} +let lastLinewiseCopy = null; +handlers.copy = handlers.cut = (view, event) => { + let { text, ranges, linewise } = copiedRange(view.state); + if (!text && !linewise) + return; + lastLinewiseCopy = linewise ? text : null; + let data = brokenClipboardAPI ? null : event.clipboardData; + if (data) { + event.preventDefault(); + data.clearData(); + data.setData("text/plain", text); + } + else { + captureCopy(view, text); + } + if (event.type == "cut" && !view.state.readOnly) + view.dispatch({ + changes: ranges, + scrollIntoView: true, + userEvent: "delete.cut" + }); +}; +function updateForFocusChange(view) { + setTimeout(() => { + if (view.hasFocus != view.inputState.notifiedFocused) + view.update([]); + }, 10); +} +handlers.focus = updateForFocusChange; +handlers.blur = view => { + view.observer.clearSelectionRange(); + updateForFocusChange(view); +}; +function forceClearComposition(view, rapid) { + if (view.docView.compositionDeco.size) { + view.inputState.rapidCompositionStart = rapid; + try { + view.update([]); + } + finally { + view.inputState.rapidCompositionStart = false; + } + } +} +handlers.compositionstart = handlers.compositionupdate = view => { + if (view.inputState.compositionFirstChange == null) + view.inputState.compositionFirstChange = true; + if (view.inputState.composing < 0) { + // FIXME possibly set a timeout to clear it again on Android + view.inputState.composing = 0; + if (view.docView.compositionDeco.size) { + view.observer.flush(); + forceClearComposition(view, true); + } + } +}; +handlers.compositionend = view => { + view.inputState.composing = -1; + view.inputState.compositionEndedAt = Date.now(); + view.inputState.compositionFirstChange = null; + setTimeout(() => { + if (view.inputState.composing < 0) + forceClearComposition(view, false); + }, 50); +}; +handlers.contextmenu = view => { + view.inputState.lastContextMenu = Date.now(); +}; +handlers.beforeinput = (view, event) => { + var _a; + // Because Chrome Android doesn't fire useful key events, use + // beforeinput to detect backspace (and possibly enter and delete, + // but those usually don't even seem to fire beforeinput events at + // the moment) and fake a key event for it. + // + // (preventDefault on beforeinput, though supported in the spec, + // seems to do nothing at all on Chrome). + let pending; + if (browser.chrome && browser.android && (pending = PendingKeys.find(key => key.inputType == event.inputType))) { + view.observer.delayAndroidKey(pending.key, pending.keyCode); + if (pending.key == "Backspace" || pending.key == "Delete") { + let startViewHeight = ((_a = window.visualViewport) === null || _a === void 0 ? void 0 : _a.height) || 0; + setTimeout(() => { + var _a; + // Backspacing near uneditable nodes on Chrome Android sometimes + // closes the virtual keyboard. This tries to crudely detect + // that and refocus to get it back. + if ((((_a = window.visualViewport) === null || _a === void 0 ? void 0 : _a.height) || 0) > startViewHeight + 10 && view.hasFocus) { + view.contentDOM.blur(); + view.focus(); + } + }, 100); + } + } +}; + +const wrappingWhiteSpace = ["pre-wrap", "normal", "pre-line", "break-spaces"]; +class HeightOracle { + constructor() { + this.doc = state.Text.empty; + this.lineWrapping = false; + this.heightSamples = {}; + this.lineHeight = 14; + this.charWidth = 7; + this.lineLength = 30; + // Used to track, during updateHeight, if any actual heights changed + this.heightChanged = false; + } + heightForGap(from, to) { + let lines = this.doc.lineAt(to).number - this.doc.lineAt(from).number + 1; + if (this.lineWrapping) + lines += Math.ceil(((to - from) - (lines * this.lineLength * 0.5)) / this.lineLength); + return this.lineHeight * lines; + } + heightForLine(length) { + if (!this.lineWrapping) + return this.lineHeight; + let lines = 1 + Math.max(0, Math.ceil((length - this.lineLength) / (this.lineLength - 5))); + return lines * this.lineHeight; + } + setDoc(doc) { this.doc = doc; return this; } + mustRefreshForWrapping(whiteSpace) { + return (wrappingWhiteSpace.indexOf(whiteSpace) > -1) != this.lineWrapping; + } + mustRefreshForHeights(lineHeights) { + let newHeight = false; + for (let i = 0; i < lineHeights.length; i++) { + let h = lineHeights[i]; + if (h < 0) { + i++; + } + else if (!this.heightSamples[Math.floor(h * 10)]) { // Round to .1 pixels + newHeight = true; + this.heightSamples[Math.floor(h * 10)] = true; + } + } + return newHeight; + } + refresh(whiteSpace, lineHeight, charWidth, lineLength, knownHeights) { + let lineWrapping = wrappingWhiteSpace.indexOf(whiteSpace) > -1; + let changed = Math.round(lineHeight) != Math.round(this.lineHeight) || this.lineWrapping != lineWrapping; + this.lineWrapping = lineWrapping; + this.lineHeight = lineHeight; + this.charWidth = charWidth; + this.lineLength = lineLength; + if (changed) { + this.heightSamples = {}; + for (let i = 0; i < knownHeights.length; i++) { + let h = knownHeights[i]; + if (h < 0) + i++; + else + this.heightSamples[Math.floor(h * 10)] = true; + } + } + return changed; + } +} +// This object is used by `updateHeight` to make DOM measurements +// arrive at the right nides. The `heights` array is a sequence of +// block heights, starting from position `from`. +class MeasuredHeights { + constructor(from, heights) { + this.from = from; + this.heights = heights; + this.index = 0; + } + get more() { return this.index < this.heights.length; } +} +/** +Record used to represent information about a block-level element +in the editor view. +*/ +class BlockInfo { + /** + @internal + */ + constructor( + /** + The start of the element in the document. + */ + from, + /** + The length of the element. + */ + length, + /** + The top position of the element (relative to the top of the + document). + */ + top, + /** + Its height. + */ + height, + /** + The type of element this is. When querying lines, this may be + an array of all the blocks that make up the line. + */ + type) { + this.from = from; + this.length = length; + this.top = top; + this.height = height; + this.type = type; + } + /** + The end of the element as a document position. + */ + get to() { return this.from + this.length; } + /** + The bottom position of the element. + */ + get bottom() { return this.top + this.height; } + /** + @internal + */ + join(other) { + let detail = (Array.isArray(this.type) ? this.type : [this]) + .concat(Array.isArray(other.type) ? other.type : [other]); + return new BlockInfo(this.from, this.length + other.length, this.top, this.height + other.height, detail); + } +} +var QueryType; +(function (QueryType) { + QueryType[QueryType["ByPos"] = 0] = "ByPos"; + QueryType[QueryType["ByHeight"] = 1] = "ByHeight"; + QueryType[QueryType["ByPosNoHeight"] = 2] = "ByPosNoHeight"; +})(QueryType || (QueryType = {})); +const Epsilon = 1e-3; +class HeightMap { + constructor(length, // The number of characters covered + height, // Height of this part of the document + flags = 2 /* Outdated */) { + this.length = length; + this.height = height; + this.flags = flags; + } + get outdated() { return (this.flags & 2 /* Outdated */) > 0; } + set outdated(value) { this.flags = (value ? 2 /* Outdated */ : 0) | (this.flags & ~2 /* Outdated */); } + setHeight(oracle, height) { + if (this.height != height) { + if (Math.abs(this.height - height) > Epsilon) + oracle.heightChanged = true; + this.height = height; + } + } + // Base case is to replace a leaf node, which simply builds a tree + // from the new nodes and returns that (HeightMapBranch and + // HeightMapGap override this to actually use from/to) + replace(_from, _to, nodes) { + return HeightMap.of(nodes); + } + // Again, these are base cases, and are overridden for branch and gap nodes. + decomposeLeft(_to, result) { result.push(this); } + decomposeRight(_from, result) { result.push(this); } + applyChanges(decorations, oldDoc, oracle, changes) { + let me = this; + for (let i = changes.length - 1; i >= 0; i--) { + let { fromA, toA, fromB, toB } = changes[i]; + let start = me.lineAt(fromA, QueryType.ByPosNoHeight, oldDoc, 0, 0); + let end = start.to >= toA ? start : me.lineAt(toA, QueryType.ByPosNoHeight, oldDoc, 0, 0); + toB += end.to - toA; + toA = end.to; + while (i > 0 && start.from <= changes[i - 1].toA) { + fromA = changes[i - 1].fromA; + fromB = changes[i - 1].fromB; + i--; + if (fromA < start.from) + start = me.lineAt(fromA, QueryType.ByPosNoHeight, oldDoc, 0, 0); + } + fromB += start.from - fromA; + fromA = start.from; + let nodes = NodeBuilder.build(oracle, decorations, fromB, toB); + me = me.replace(fromA, toA, nodes); + } + return me.updateHeight(oracle, 0); + } + static empty() { return new HeightMapText(0, 0); } + // nodes uses null values to indicate the position of line breaks. + // There are never line breaks at the start or end of the array, or + // two line breaks next to each other, and the array isn't allowed + // to be empty (same restrictions as return value from the builder). + static of(nodes) { + if (nodes.length == 1) + return nodes[0]; + let i = 0, j = nodes.length, before = 0, after = 0; + for (;;) { + if (i == j) { + if (before > after * 2) { + let split = nodes[i - 1]; + if (split.break) + nodes.splice(--i, 1, split.left, null, split.right); + else + nodes.splice(--i, 1, split.left, split.right); + j += 1 + split.break; + before -= split.size; + } + else if (after > before * 2) { + let split = nodes[j]; + if (split.break) + nodes.splice(j, 1, split.left, null, split.right); + else + nodes.splice(j, 1, split.left, split.right); + j += 2 + split.break; + after -= split.size; + } + else { + break; + } + } + else if (before < after) { + let next = nodes[i++]; + if (next) + before += next.size; + } + else { + let next = nodes[--j]; + if (next) + after += next.size; + } + } + let brk = 0; + if (nodes[i - 1] == null) { + brk = 1; + i--; + } + else if (nodes[i] == null) { + brk = 1; + j++; + } + return new HeightMapBranch(HeightMap.of(nodes.slice(0, i)), brk, HeightMap.of(nodes.slice(j))); + } +} +HeightMap.prototype.size = 1; +class HeightMapBlock extends HeightMap { + constructor(length, height, type) { + super(length, height); + this.type = type; + } + blockAt(_height, _doc, top, offset) { + return new BlockInfo(offset, this.length, top, this.height, this.type); + } + lineAt(_value, _type, doc, top, offset) { + return this.blockAt(0, doc, top, offset); + } + forEachLine(from, to, doc, top, offset, f) { + if (from <= offset + this.length && to >= offset) + f(this.blockAt(0, doc, top, offset)); + } + updateHeight(oracle, offset = 0, _force = false, measured) { + if (measured && measured.from <= offset && measured.more) + this.setHeight(oracle, measured.heights[measured.index++]); + this.outdated = false; + return this; + } + toString() { return `block(${this.length})`; } +} +class HeightMapText extends HeightMapBlock { + constructor(length, height) { + super(length, height, exports.BlockType.Text); + this.collapsed = 0; // Amount of collapsed content in the line + this.widgetHeight = 0; // Maximum inline widget height + } + replace(_from, _to, nodes) { + let node = nodes[0]; + if (nodes.length == 1 && (node instanceof HeightMapText || node instanceof HeightMapGap && (node.flags & 4 /* SingleLine */)) && + Math.abs(this.length - node.length) < 10) { + if (node instanceof HeightMapGap) + node = new HeightMapText(node.length, this.height); + else + node.height = this.height; + if (!this.outdated) + node.outdated = false; + return node; + } + else { + return HeightMap.of(nodes); + } + } + updateHeight(oracle, offset = 0, force = false, measured) { + if (measured && measured.from <= offset && measured.more) + this.setHeight(oracle, measured.heights[measured.index++]); + else if (force || this.outdated) + this.setHeight(oracle, Math.max(this.widgetHeight, oracle.heightForLine(this.length - this.collapsed))); + this.outdated = false; + return this; + } + toString() { + return `line(${this.length}${this.collapsed ? -this.collapsed : ""}${this.widgetHeight ? ":" + this.widgetHeight : ""})`; + } +} +class HeightMapGap extends HeightMap { + constructor(length) { super(length, 0); } + lines(doc, offset) { + let firstLine = doc.lineAt(offset).number, lastLine = doc.lineAt(offset + this.length).number; + return { firstLine, lastLine, lineHeight: this.height / (lastLine - firstLine + 1) }; + } + blockAt(height, doc, top, offset) { + let { firstLine, lastLine, lineHeight } = this.lines(doc, offset); + let line = Math.max(0, Math.min(lastLine - firstLine, Math.floor((height - top) / lineHeight))); + let { from, length } = doc.line(firstLine + line); + return new BlockInfo(from, length, top + lineHeight * line, lineHeight, exports.BlockType.Text); + } + lineAt(value, type, doc, top, offset) { + if (type == QueryType.ByHeight) + return this.blockAt(value, doc, top, offset); + if (type == QueryType.ByPosNoHeight) { + let { from, to } = doc.lineAt(value); + return new BlockInfo(from, to - from, 0, 0, exports.BlockType.Text); + } + let { firstLine, lineHeight } = this.lines(doc, offset); + let { from, length, number } = doc.lineAt(value); + return new BlockInfo(from, length, top + lineHeight * (number - firstLine), lineHeight, exports.BlockType.Text); + } + forEachLine(from, to, doc, top, offset, f) { + let { firstLine, lineHeight } = this.lines(doc, offset); + for (let pos = Math.max(from, offset), end = Math.min(offset + this.length, to); pos <= end;) { + let line = doc.lineAt(pos); + if (pos == from) + top += lineHeight * (line.number - firstLine); + f(new BlockInfo(line.from, line.length, top, lineHeight, exports.BlockType.Text)); + top += lineHeight; + pos = line.to + 1; + } + } + replace(from, to, nodes) { + let after = this.length - to; + if (after > 0) { + let last = nodes[nodes.length - 1]; + if (last instanceof HeightMapGap) + nodes[nodes.length - 1] = new HeightMapGap(last.length + after); + else + nodes.push(null, new HeightMapGap(after - 1)); + } + if (from > 0) { + let first = nodes[0]; + if (first instanceof HeightMapGap) + nodes[0] = new HeightMapGap(from + first.length); + else + nodes.unshift(new HeightMapGap(from - 1), null); + } + return HeightMap.of(nodes); + } + decomposeLeft(to, result) { + result.push(new HeightMapGap(to - 1), null); + } + decomposeRight(from, result) { + result.push(null, new HeightMapGap(this.length - from - 1)); + } + updateHeight(oracle, offset = 0, force = false, measured) { + let end = offset + this.length; + if (measured && measured.from <= offset + this.length && measured.more) { + // Fill in part of this gap with measured lines. We know there + // can't be widgets or collapsed ranges in those lines, because + // they would already have been added to the heightmap (gaps + // only contain plain text). + let nodes = [], pos = Math.max(offset, measured.from), singleHeight = -1; + let wasChanged = oracle.heightChanged; + if (measured.from > offset) + nodes.push(new HeightMapGap(measured.from - offset - 1).updateHeight(oracle, offset)); + while (pos <= end && measured.more) { + let len = oracle.doc.lineAt(pos).length; + if (nodes.length) + nodes.push(null); + let height = measured.heights[measured.index++]; + if (singleHeight == -1) + singleHeight = height; + else if (Math.abs(height - singleHeight) >= Epsilon) + singleHeight = -2; + let line = new HeightMapText(len, height); + line.outdated = false; + nodes.push(line); + pos += len + 1; + } + if (pos <= end) + nodes.push(null, new HeightMapGap(end - pos).updateHeight(oracle, pos)); + let result = HeightMap.of(nodes); + oracle.heightChanged = wasChanged || singleHeight < 0 || Math.abs(result.height - this.height) >= Epsilon || + Math.abs(singleHeight - this.lines(oracle.doc, offset).lineHeight) >= Epsilon; + return result; + } + else if (force || this.outdated) { + this.setHeight(oracle, oracle.heightForGap(offset, offset + this.length)); + this.outdated = false; + } + return this; + } + toString() { return `gap(${this.length})`; } +} +class HeightMapBranch extends HeightMap { + constructor(left, brk, right) { + super(left.length + brk + right.length, left.height + right.height, brk | (left.outdated || right.outdated ? 2 /* Outdated */ : 0)); + this.left = left; + this.right = right; + this.size = left.size + right.size; + } + get break() { return this.flags & 1 /* Break */; } + blockAt(height, doc, top, offset) { + let mid = top + this.left.height; + return height < mid ? this.left.blockAt(height, doc, top, offset) + : this.right.blockAt(height, doc, mid, offset + this.left.length + this.break); + } + lineAt(value, type, doc, top, offset) { + let rightTop = top + this.left.height, rightOffset = offset + this.left.length + this.break; + let left = type == QueryType.ByHeight ? value < rightTop : value < rightOffset; + let base = left ? this.left.lineAt(value, type, doc, top, offset) + : this.right.lineAt(value, type, doc, rightTop, rightOffset); + if (this.break || (left ? base.to < rightOffset : base.from > rightOffset)) + return base; + let subQuery = type == QueryType.ByPosNoHeight ? QueryType.ByPosNoHeight : QueryType.ByPos; + if (left) + return base.join(this.right.lineAt(rightOffset, subQuery, doc, rightTop, rightOffset)); + else + return this.left.lineAt(rightOffset, subQuery, doc, top, offset).join(base); + } + forEachLine(from, to, doc, top, offset, f) { + let rightTop = top + this.left.height, rightOffset = offset + this.left.length + this.break; + if (this.break) { + if (from < rightOffset) + this.left.forEachLine(from, to, doc, top, offset, f); + if (to >= rightOffset) + this.right.forEachLine(from, to, doc, rightTop, rightOffset, f); + } + else { + let mid = this.lineAt(rightOffset, QueryType.ByPos, doc, top, offset); + if (from < mid.from) + this.left.forEachLine(from, mid.from - 1, doc, top, offset, f); + if (mid.to >= from && mid.from <= to) + f(mid); + if (to > mid.to) + this.right.forEachLine(mid.to + 1, to, doc, rightTop, rightOffset, f); + } + } + replace(from, to, nodes) { + let rightStart = this.left.length + this.break; + if (to < rightStart) + return this.balanced(this.left.replace(from, to, nodes), this.right); + if (from > this.left.length) + return this.balanced(this.left, this.right.replace(from - rightStart, to - rightStart, nodes)); + let result = []; + if (from > 0) + this.decomposeLeft(from, result); + let left = result.length; + for (let node of nodes) + result.push(node); + if (from > 0) + mergeGaps(result, left - 1); + if (to < this.length) { + let right = result.length; + this.decomposeRight(to, result); + mergeGaps(result, right); + } + return HeightMap.of(result); + } + decomposeLeft(to, result) { + let left = this.left.length; + if (to <= left) + return this.left.decomposeLeft(to, result); + result.push(this.left); + if (this.break) { + left++; + if (to >= left) + result.push(null); + } + if (to > left) + this.right.decomposeLeft(to - left, result); + } + decomposeRight(from, result) { + let left = this.left.length, right = left + this.break; + if (from >= right) + return this.right.decomposeRight(from - right, result); + if (from < left) + this.left.decomposeRight(from, result); + if (this.break && from < right) + result.push(null); + result.push(this.right); + } + balanced(left, right) { + if (left.size > 2 * right.size || right.size > 2 * left.size) + return HeightMap.of(this.break ? [left, null, right] : [left, right]); + this.left = left; + this.right = right; + this.height = left.height + right.height; + this.outdated = left.outdated || right.outdated; + this.size = left.size + right.size; + this.length = left.length + this.break + right.length; + return this; + } + updateHeight(oracle, offset = 0, force = false, measured) { + let { left, right } = this, rightStart = offset + left.length + this.break, rebalance = null; + if (measured && measured.from <= offset + left.length && measured.more) + rebalance = left = left.updateHeight(oracle, offset, force, measured); + else + left.updateHeight(oracle, offset, force); + if (measured && measured.from <= rightStart + right.length && measured.more) + rebalance = right = right.updateHeight(oracle, rightStart, force, measured); + else + right.updateHeight(oracle, rightStart, force); + if (rebalance) + return this.balanced(left, right); + this.height = this.left.height + this.right.height; + this.outdated = false; + return this; + } + toString() { return this.left + (this.break ? " " : "-") + this.right; } +} +function mergeGaps(nodes, around) { + let before, after; + if (nodes[around] == null && + (before = nodes[around - 1]) instanceof HeightMapGap && + (after = nodes[around + 1]) instanceof HeightMapGap) + nodes.splice(around - 1, 3, new HeightMapGap(before.length + 1 + after.length)); +} +const relevantWidgetHeight = 5; +class NodeBuilder { + constructor(pos, oracle) { + this.pos = pos; + this.oracle = oracle; + this.nodes = []; + this.lineStart = -1; + this.lineEnd = -1; + this.covering = null; + this.writtenTo = pos; + } + get isCovered() { + return this.covering && this.nodes[this.nodes.length - 1] == this.covering; + } + span(_from, to) { + if (this.lineStart > -1) { + let end = Math.min(to, this.lineEnd), last = this.nodes[this.nodes.length - 1]; + if (last instanceof HeightMapText) + last.length += end - this.pos; + else if (end > this.pos || !this.isCovered) + this.nodes.push(new HeightMapText(end - this.pos, -1)); + this.writtenTo = end; + if (to > end) { + this.nodes.push(null); + this.writtenTo++; + this.lineStart = -1; + } + } + this.pos = to; + } + point(from, to, deco) { + if (from < to || deco.heightRelevant) { + let height = deco.widget ? deco.widget.estimatedHeight : 0; + if (height < 0) + height = this.oracle.lineHeight; + let len = to - from; + if (deco.block) { + this.addBlock(new HeightMapBlock(len, height, deco.type)); + } + else if (len || height >= relevantWidgetHeight) { + this.addLineDeco(height, len); + } + } + else if (to > from) { + this.span(from, to); + } + if (this.lineEnd > -1 && this.lineEnd < this.pos) + this.lineEnd = this.oracle.doc.lineAt(this.pos).to; + } + enterLine() { + if (this.lineStart > -1) + return; + let { from, to } = this.oracle.doc.lineAt(this.pos); + this.lineStart = from; + this.lineEnd = to; + if (this.writtenTo < from) { + if (this.writtenTo < from - 1 || this.nodes[this.nodes.length - 1] == null) + this.nodes.push(this.blankContent(this.writtenTo, from - 1)); + this.nodes.push(null); + } + if (this.pos > from) + this.nodes.push(new HeightMapText(this.pos - from, -1)); + this.writtenTo = this.pos; + } + blankContent(from, to) { + let gap = new HeightMapGap(to - from); + if (this.oracle.doc.lineAt(from).to == to) + gap.flags |= 4 /* SingleLine */; + return gap; + } + ensureLine() { + this.enterLine(); + let last = this.nodes.length ? this.nodes[this.nodes.length - 1] : null; + if (last instanceof HeightMapText) + return last; + let line = new HeightMapText(0, -1); + this.nodes.push(line); + return line; + } + addBlock(block) { + this.enterLine(); + if (block.type == exports.BlockType.WidgetAfter && !this.isCovered) + this.ensureLine(); + this.nodes.push(block); + this.writtenTo = this.pos = this.pos + block.length; + if (block.type != exports.BlockType.WidgetBefore) + this.covering = block; + } + addLineDeco(height, length) { + let line = this.ensureLine(); + line.length += length; + line.collapsed += length; + line.widgetHeight = Math.max(line.widgetHeight, height); + this.writtenTo = this.pos = this.pos + length; + } + finish(from) { + let last = this.nodes.length == 0 ? null : this.nodes[this.nodes.length - 1]; + if (this.lineStart > -1 && !(last instanceof HeightMapText) && !this.isCovered) + this.nodes.push(new HeightMapText(0, -1)); + else if (this.writtenTo < this.pos || last == null) + this.nodes.push(this.blankContent(this.writtenTo, this.pos)); + let pos = from; + for (let node of this.nodes) { + if (node instanceof HeightMapText) + node.updateHeight(this.oracle, pos); + pos += node ? node.length : 1; + } + return this.nodes; + } + // Always called with a region that on both sides either stretches + // to a line break or the end of the document. + // The returned array uses null to indicate line breaks, but never + // starts or ends in a line break, or has multiple line breaks next + // to each other. + static build(oracle, decorations, from, to) { + let builder = new NodeBuilder(from, oracle); + state.RangeSet.spans(decorations, from, to, builder, 0); + return builder.finish(from); + } +} +function heightRelevantDecoChanges(a, b, diff) { + let comp = new DecorationComparator; + state.RangeSet.compare(a, b, diff, comp, 0); + return comp.changes; +} +class DecorationComparator { + constructor() { + this.changes = []; + } + compareRange() { } + comparePoint(from, to, a, b) { + if (from < to || a && a.heightRelevant || b && b.heightRelevant) + addRange(from, to, this.changes, 5); + } +} + +function visiblePixelRange(dom, paddingTop) { + let rect = dom.getBoundingClientRect(); + let left = Math.max(0, rect.left), right = Math.min(innerWidth, rect.right); + let top = Math.max(0, rect.top), bottom = Math.min(innerHeight, rect.bottom); + let body = dom.ownerDocument.body; + for (let parent = dom.parentNode; parent && parent != body;) { + if (parent.nodeType == 1) { + let elt = parent; + let style = window.getComputedStyle(elt); + if ((elt.scrollHeight > elt.clientHeight || elt.scrollWidth > elt.clientWidth) && + style.overflow != "visible") { + let parentRect = elt.getBoundingClientRect(); + left = Math.max(left, parentRect.left); + right = Math.min(right, parentRect.right); + top = Math.max(top, parentRect.top); + bottom = Math.min(bottom, parentRect.bottom); + } + parent = style.position == "absolute" || style.position == "fixed" ? elt.offsetParent : elt.parentNode; + } + else if (parent.nodeType == 11) { // Shadow root + parent = parent.host; + } + else { + break; + } + } + return { left: left - rect.left, right: Math.max(left, right) - rect.left, + top: top - (rect.top + paddingTop), bottom: Math.max(top, bottom) - (rect.top + paddingTop) }; +} +function fullPixelRange(dom, paddingTop) { + let rect = dom.getBoundingClientRect(); + return { left: 0, right: rect.right - rect.left, + top: paddingTop, bottom: rect.bottom - (rect.top + paddingTop) }; +} +// Line gaps are placeholder widgets used to hide pieces of overlong +// lines within the viewport, as a kludge to keep the editor +// responsive when a ridiculously long line is loaded into it. +class LineGap { + constructor(from, to, size) { + this.from = from; + this.to = to; + this.size = size; + } + static same(a, b) { + if (a.length != b.length) + return false; + for (let i = 0; i < a.length; i++) { + let gA = a[i], gB = b[i]; + if (gA.from != gB.from || gA.to != gB.to || gA.size != gB.size) + return false; + } + return true; + } + draw(wrapping) { + return Decoration.replace({ widget: new LineGapWidget(this.size, wrapping) }).range(this.from, this.to); + } +} +class LineGapWidget extends WidgetType { + constructor(size, vertical) { + super(); + this.size = size; + this.vertical = vertical; + } + eq(other) { return other.size == this.size && other.vertical == this.vertical; } + toDOM() { + let elt = document.createElement("div"); + if (this.vertical) { + elt.style.height = this.size + "px"; + } + else { + elt.style.width = this.size + "px"; + elt.style.height = "2px"; + elt.style.display = "inline-block"; + } + return elt; + } + get estimatedHeight() { return this.vertical ? this.size : -1; } +} +class ViewState { + constructor(state$1) { + this.state = state$1; + // These are contentDOM-local coordinates + this.pixelViewport = { left: 0, right: window.innerWidth, top: 0, bottom: 0 }; + this.inView = true; + this.paddingTop = 0; + this.paddingBottom = 0; + this.contentDOMWidth = 0; + this.contentDOMHeight = 0; + this.editorHeight = 0; + this.editorWidth = 0; + this.heightOracle = new HeightOracle; + // See VP.MaxDOMHeight + this.scaler = IdScaler; + this.scrollTarget = null; + // Briefly set to true when printing, to disable viewport limiting + this.printing = false; + // Flag set when editor content was redrawn, so that the next + // measure stage knows it must read DOM layout + this.mustMeasureContent = true; + this.defaultTextDirection = exports.Direction.RTL; + this.visibleRanges = []; + // Cursor 'assoc' is only significant when the cursor is on a line + // wrap point, where it must stick to the character that it is + // associated with. Since browsers don't provide a reasonable + // interface to set or query this, when a selection is set that + // might cause this to be significant, this flag is set. The next + // measure phase will check whether the cursor is on a line-wrapping + // boundary and, if so, reset it to make sure it is positioned in + // the right place. + this.mustEnforceCursorAssoc = false; + this.stateDeco = state$1.facet(decorations).filter(d => typeof d != "function"); + this.heightMap = HeightMap.empty().applyChanges(this.stateDeco, state.Text.empty, this.heightOracle.setDoc(state$1.doc), [new ChangedRange(0, 0, 0, state$1.doc.length)]); + this.viewport = this.getViewport(0, null); + this.updateViewportLines(); + this.updateForViewport(); + this.lineGaps = this.ensureLineGaps([]); + this.lineGapDeco = Decoration.set(this.lineGaps.map(gap => gap.draw(false))); + this.computeVisibleRanges(); + } + updateForViewport() { + let viewports = [this.viewport], { main } = this.state.selection; + for (let i = 0; i <= 1; i++) { + let pos = i ? main.head : main.anchor; + if (!viewports.some(({ from, to }) => pos >= from && pos <= to)) { + let { from, to } = this.lineBlockAt(pos); + viewports.push(new Viewport(from, to)); + } + } + this.viewports = viewports.sort((a, b) => a.from - b.from); + this.scaler = this.heightMap.height <= 7000000 /* MaxDOMHeight */ ? IdScaler : + new BigScaler(this.heightOracle.doc, this.heightMap, this.viewports); + } + updateViewportLines() { + this.viewportLines = []; + this.heightMap.forEachLine(this.viewport.from, this.viewport.to, this.state.doc, 0, 0, block => { + this.viewportLines.push(this.scaler.scale == 1 ? block : scaleBlock(block, this.scaler)); + }); + } + update(update, scrollTarget = null) { + this.state = update.state; + let prevDeco = this.stateDeco; + this.stateDeco = this.state.facet(decorations).filter(d => typeof d != "function"); + let contentChanges = update.changedRanges; + let heightChanges = ChangedRange.extendWithRanges(contentChanges, heightRelevantDecoChanges(prevDeco, this.stateDeco, update ? update.changes : state.ChangeSet.empty(this.state.doc.length))); + let prevHeight = this.heightMap.height; + this.heightMap = this.heightMap.applyChanges(this.stateDeco, update.startState.doc, this.heightOracle.setDoc(this.state.doc), heightChanges); + if (this.heightMap.height != prevHeight) + update.flags |= 2 /* Height */; + let viewport = heightChanges.length ? this.mapViewport(this.viewport, update.changes) : this.viewport; + if (scrollTarget && (scrollTarget.range.head < viewport.from || scrollTarget.range.head > viewport.to) || + !this.viewportIsAppropriate(viewport)) + viewport = this.getViewport(0, scrollTarget); + let updateLines = !update.changes.empty || (update.flags & 2 /* Height */) || + viewport.from != this.viewport.from || viewport.to != this.viewport.to; + this.viewport = viewport; + this.updateForViewport(); + if (updateLines) + this.updateViewportLines(); + if (this.lineGaps.length || this.viewport.to - this.viewport.from > 4000 /* DoubleMargin */) + this.updateLineGaps(this.ensureLineGaps(this.mapLineGaps(this.lineGaps, update.changes))); + update.flags |= this.computeVisibleRanges(); + if (scrollTarget) + this.scrollTarget = scrollTarget; + if (!this.mustEnforceCursorAssoc && update.selectionSet && update.view.lineWrapping && + update.state.selection.main.empty && update.state.selection.main.assoc) + this.mustEnforceCursorAssoc = true; + } + measure(view) { + let dom = view.contentDOM, style = window.getComputedStyle(dom); + let oracle = this.heightOracle; + let whiteSpace = style.whiteSpace; + this.defaultTextDirection = style.direction == "rtl" ? exports.Direction.RTL : exports.Direction.LTR; + let refresh = this.heightOracle.mustRefreshForWrapping(whiteSpace); + let measureContent = refresh || this.mustMeasureContent || this.contentDOMHeight != dom.clientHeight; + this.contentDOMHeight = dom.clientHeight; + this.mustMeasureContent = false; + let result = 0, bias = 0; + // Vertical padding + let paddingTop = parseInt(style.paddingTop) || 0, paddingBottom = parseInt(style.paddingBottom) || 0; + if (this.paddingTop != paddingTop || this.paddingBottom != paddingBottom) { + this.paddingTop = paddingTop; + this.paddingBottom = paddingBottom; + result |= 8 /* Geometry */ | 2 /* Height */; + } + if (this.editorWidth != view.scrollDOM.clientWidth) { + if (oracle.lineWrapping) + measureContent = true; + this.editorWidth = view.scrollDOM.clientWidth; + result |= 8 /* Geometry */; + } + // Pixel viewport + let pixelViewport = (this.printing ? fullPixelRange : visiblePixelRange)(dom, this.paddingTop); + let dTop = pixelViewport.top - this.pixelViewport.top, dBottom = pixelViewport.bottom - this.pixelViewport.bottom; + this.pixelViewport = pixelViewport; + let inView = this.pixelViewport.bottom > this.pixelViewport.top && this.pixelViewport.right > this.pixelViewport.left; + if (inView != this.inView) { + this.inView = inView; + if (inView) + measureContent = true; + } + if (!this.inView) + return 0; + let contentWidth = dom.clientWidth; + if (this.contentDOMWidth != contentWidth || this.editorHeight != view.scrollDOM.clientHeight) { + this.contentDOMWidth = contentWidth; + this.editorHeight = view.scrollDOM.clientHeight; + result |= 8 /* Geometry */; + } + if (measureContent) { + let lineHeights = view.docView.measureVisibleLineHeights(this.viewport); + if (oracle.mustRefreshForHeights(lineHeights)) + refresh = true; + if (refresh || oracle.lineWrapping && Math.abs(contentWidth - this.contentDOMWidth) > oracle.charWidth) { + let { lineHeight, charWidth } = view.docView.measureTextSize(); + refresh = oracle.refresh(whiteSpace, lineHeight, charWidth, contentWidth / charWidth, lineHeights); + if (refresh) { + view.docView.minWidth = 0; + result |= 8 /* Geometry */; + } + } + if (dTop > 0 && dBottom > 0) + bias = Math.max(dTop, dBottom); + else if (dTop < 0 && dBottom < 0) + bias = Math.min(dTop, dBottom); + oracle.heightChanged = false; + for (let vp of this.viewports) { + let heights = vp.from == this.viewport.from ? lineHeights : view.docView.measureVisibleLineHeights(vp); + this.heightMap = this.heightMap.updateHeight(oracle, 0, refresh, new MeasuredHeights(vp.from, heights)); + } + if (oracle.heightChanged) + result |= 2 /* Height */; + } + let viewportChange = !this.viewportIsAppropriate(this.viewport, bias) || + this.scrollTarget && (this.scrollTarget.range.head < this.viewport.from || this.scrollTarget.range.head > this.viewport.to); + if (viewportChange) + this.viewport = this.getViewport(bias, this.scrollTarget); + this.updateForViewport(); + if ((result & 2 /* Height */) || viewportChange) + this.updateViewportLines(); + if (this.lineGaps.length || this.viewport.to - this.viewport.from > 4000 /* DoubleMargin */) + this.updateLineGaps(this.ensureLineGaps(refresh ? [] : this.lineGaps)); + result |= this.computeVisibleRanges(); + if (this.mustEnforceCursorAssoc) { + this.mustEnforceCursorAssoc = false; + // This is done in the read stage, because moving the selection + // to a line end is going to trigger a layout anyway, so it + // can't be a pure write. It should be rare that it does any + // writing. + view.docView.enforceCursorAssoc(); + } + return result; + } + get visibleTop() { return this.scaler.fromDOM(this.pixelViewport.top); } + get visibleBottom() { return this.scaler.fromDOM(this.pixelViewport.bottom); } + getViewport(bias, scrollTarget) { + // This will divide VP.Margin between the top and the + // bottom, depending on the bias (the change in viewport position + // since the last update). It'll hold a number between 0 and 1 + let marginTop = 0.5 - Math.max(-0.5, Math.min(0.5, bias / 1000 /* Margin */ / 2)); + let map = this.heightMap, doc = this.state.doc, { visibleTop, visibleBottom } = this; + let viewport = new Viewport(map.lineAt(visibleTop - marginTop * 1000 /* Margin */, QueryType.ByHeight, doc, 0, 0).from, map.lineAt(visibleBottom + (1 - marginTop) * 1000 /* Margin */, QueryType.ByHeight, doc, 0, 0).to); + // If scrollTarget is given, make sure the viewport includes that position + if (scrollTarget) { + let { head } = scrollTarget.range; + if (head < viewport.from || head > viewport.to) { + let viewHeight = Math.min(this.editorHeight, this.pixelViewport.bottom - this.pixelViewport.top); + let block = map.lineAt(head, QueryType.ByPos, doc, 0, 0), topPos; + if (scrollTarget.y == "center") + topPos = (block.top + block.bottom) / 2 - viewHeight / 2; + else if (scrollTarget.y == "start" || scrollTarget.y == "nearest" && head < viewport.from) + topPos = block.top; + else + topPos = block.bottom - viewHeight; + viewport = new Viewport(map.lineAt(topPos - 1000 /* Margin */ / 2, QueryType.ByHeight, doc, 0, 0).from, map.lineAt(topPos + viewHeight + 1000 /* Margin */ / 2, QueryType.ByHeight, doc, 0, 0).to); + } + } + return viewport; + } + mapViewport(viewport, changes) { + let from = changes.mapPos(viewport.from, -1), to = changes.mapPos(viewport.to, 1); + return new Viewport(this.heightMap.lineAt(from, QueryType.ByPos, this.state.doc, 0, 0).from, this.heightMap.lineAt(to, QueryType.ByPos, this.state.doc, 0, 0).to); + } + // Checks if a given viewport covers the visible part of the + // document and not too much beyond that. + viewportIsAppropriate({ from, to }, bias = 0) { + if (!this.inView) + return true; + let { top } = this.heightMap.lineAt(from, QueryType.ByPos, this.state.doc, 0, 0); + let { bottom } = this.heightMap.lineAt(to, QueryType.ByPos, this.state.doc, 0, 0); + let { visibleTop, visibleBottom } = this; + return (from == 0 || top <= visibleTop - Math.max(10 /* MinCoverMargin */, Math.min(-bias, 250 /* MaxCoverMargin */))) && + (to == this.state.doc.length || + bottom >= visibleBottom + Math.max(10 /* MinCoverMargin */, Math.min(bias, 250 /* MaxCoverMargin */))) && + (top > visibleTop - 2 * 1000 /* Margin */ && bottom < visibleBottom + 2 * 1000 /* Margin */); + } + mapLineGaps(gaps, changes) { + if (!gaps.length || changes.empty) + return gaps; + let mapped = []; + for (let gap of gaps) + if (!changes.touchesRange(gap.from, gap.to)) + mapped.push(new LineGap(changes.mapPos(gap.from), changes.mapPos(gap.to), gap.size)); + return mapped; + } + // Computes positions in the viewport where the start or end of a + // line should be hidden, trying to reuse existing line gaps when + // appropriate to avoid unneccesary redraws. + // Uses crude character-counting for the positioning and sizing, + // since actual DOM coordinates aren't always available and + // predictable. Relies on generous margins (see LG.Margin) to hide + // the artifacts this might produce from the user. + ensureLineGaps(current) { + let gaps = []; + // This won't work at all in predominantly right-to-left text. + if (this.defaultTextDirection != exports.Direction.LTR) + return gaps; + for (let line of this.viewportLines) { + if (line.length < 4000 /* DoubleMargin */) + continue; + let structure = lineStructure(line.from, line.to, this.stateDeco); + if (structure.total < 4000 /* DoubleMargin */) + continue; + let viewFrom, viewTo; + if (this.heightOracle.lineWrapping) { + let marginHeight = (2000 /* Margin */ / this.heightOracle.lineLength) * this.heightOracle.lineHeight; + viewFrom = findPosition(structure, (this.visibleTop - line.top - marginHeight) / line.height); + viewTo = findPosition(structure, (this.visibleBottom - line.top + marginHeight) / line.height); + } + else { + let totalWidth = structure.total * this.heightOracle.charWidth; + let marginWidth = 2000 /* Margin */ * this.heightOracle.charWidth; + viewFrom = findPosition(structure, (this.pixelViewport.left - marginWidth) / totalWidth); + viewTo = findPosition(structure, (this.pixelViewport.right + marginWidth) / totalWidth); + } + let outside = []; + if (viewFrom > line.from) + outside.push({ from: line.from, to: viewFrom }); + if (viewTo < line.to) + outside.push({ from: viewTo, to: line.to }); + let sel = this.state.selection.main; + // Make sure the gaps don't cover a selection end + if (sel.from >= line.from && sel.from <= line.to) + cutRange(outside, sel.from - 10 /* SelectionMargin */, sel.from + 10 /* SelectionMargin */); + if (!sel.empty && sel.to >= line.from && sel.to <= line.to) + cutRange(outside, sel.to - 10 /* SelectionMargin */, sel.to + 10 /* SelectionMargin */); + for (let { from, to } of outside) + if (to - from > 1000 /* HalfMargin */) { + gaps.push(find(current, gap => gap.from >= line.from && gap.to <= line.to && + Math.abs(gap.from - from) < 1000 /* HalfMargin */ && Math.abs(gap.to - to) < 1000 /* HalfMargin */) || + new LineGap(from, to, this.gapSize(line, from, to, structure))); + } + } + return gaps; + } + gapSize(line, from, to, structure) { + let fraction = findFraction(structure, to) - findFraction(structure, from); + if (this.heightOracle.lineWrapping) { + return line.height * fraction; + } + else { + return structure.total * this.heightOracle.charWidth * fraction; + } + } + updateLineGaps(gaps) { + if (!LineGap.same(gaps, this.lineGaps)) { + this.lineGaps = gaps; + this.lineGapDeco = Decoration.set(gaps.map(gap => gap.draw(this.heightOracle.lineWrapping))); + } + } + computeVisibleRanges() { + let deco = this.stateDeco; + if (this.lineGaps.length) + deco = deco.concat(this.lineGapDeco); + let ranges = []; + state.RangeSet.spans(deco, this.viewport.from, this.viewport.to, { + span(from, to) { ranges.push({ from, to }); }, + point() { } + }, 20); + let changed = ranges.length != this.visibleRanges.length || + this.visibleRanges.some((r, i) => r.from != ranges[i].from || r.to != ranges[i].to); + this.visibleRanges = ranges; + return changed ? 4 /* Viewport */ : 0; + } + lineBlockAt(pos) { + return (pos >= this.viewport.from && pos <= this.viewport.to && this.viewportLines.find(b => b.from <= pos && b.to >= pos)) || + scaleBlock(this.heightMap.lineAt(pos, QueryType.ByPos, this.state.doc, 0, 0), this.scaler); + } + lineBlockAtHeight(height) { + return scaleBlock(this.heightMap.lineAt(this.scaler.fromDOM(height), QueryType.ByHeight, this.state.doc, 0, 0), this.scaler); + } + elementAtHeight(height) { + return scaleBlock(this.heightMap.blockAt(this.scaler.fromDOM(height), this.state.doc, 0, 0), this.scaler); + } + get docHeight() { + return this.scaler.toDOM(this.heightMap.height); + } + get contentHeight() { + return this.docHeight + this.paddingTop + this.paddingBottom; + } +} +class Viewport { + constructor(from, to) { + this.from = from; + this.to = to; + } +} +function lineStructure(from, to, stateDeco) { + let ranges = [], pos = from, total = 0; + state.RangeSet.spans(stateDeco, from, to, { + span() { }, + point(from, to) { + if (from > pos) { + ranges.push({ from: pos, to: from }); + total += from - pos; + } + pos = to; + } + }, 20); // We're only interested in collapsed ranges of a significant size + if (pos < to) { + ranges.push({ from: pos, to }); + total += to - pos; + } + return { total, ranges }; +} +function findPosition({ total, ranges }, ratio) { + if (ratio <= 0) + return ranges[0].from; + if (ratio >= 1) + return ranges[ranges.length - 1].to; + let dist = Math.floor(total * ratio); + for (let i = 0;; i++) { + let { from, to } = ranges[i], size = to - from; + if (dist <= size) + return from + dist; + dist -= size; + } +} +function findFraction(structure, pos) { + let counted = 0; + for (let { from, to } of structure.ranges) { + if (pos <= to) { + counted += pos - from; + break; + } + counted += to - from; + } + return counted / structure.total; +} +function cutRange(ranges, from, to) { + for (let i = 0; i < ranges.length; i++) { + let r = ranges[i]; + if (r.from < to && r.to > from) { + let pieces = []; + if (r.from < from) + pieces.push({ from: r.from, to: from }); + if (r.to > to) + pieces.push({ from: to, to: r.to }); + ranges.splice(i, 1, ...pieces); + i += pieces.length - 1; + } + } +} +function find(array, f) { + for (let val of array) + if (f(val)) + return val; + return undefined; +} +// Don't scale when the document height is within the range of what +// the DOM can handle. +const IdScaler = { + toDOM(n) { return n; }, + fromDOM(n) { return n; }, + scale: 1 +}; +// When the height is too big (> VP.MaxDOMHeight), scale down the +// regions outside the viewports so that the total height is +// VP.MaxDOMHeight. +class BigScaler { + constructor(doc, heightMap, viewports) { + let vpHeight = 0, base = 0, domBase = 0; + this.viewports = viewports.map(({ from, to }) => { + let top = heightMap.lineAt(from, QueryType.ByPos, doc, 0, 0).top; + let bottom = heightMap.lineAt(to, QueryType.ByPos, doc, 0, 0).bottom; + vpHeight += bottom - top; + return { from, to, top, bottom, domTop: 0, domBottom: 0 }; + }); + this.scale = (7000000 /* MaxDOMHeight */ - vpHeight) / (heightMap.height - vpHeight); + for (let obj of this.viewports) { + obj.domTop = domBase + (obj.top - base) * this.scale; + domBase = obj.domBottom = obj.domTop + (obj.bottom - obj.top); + base = obj.bottom; + } + } + toDOM(n) { + for (let i = 0, base = 0, domBase = 0;; i++) { + let vp = i < this.viewports.length ? this.viewports[i] : null; + if (!vp || n < vp.top) + return domBase + (n - base) * this.scale; + if (n <= vp.bottom) + return vp.domTop + (n - vp.top); + base = vp.bottom; + domBase = vp.domBottom; + } + } + fromDOM(n) { + for (let i = 0, base = 0, domBase = 0;; i++) { + let vp = i < this.viewports.length ? this.viewports[i] : null; + if (!vp || n < vp.domTop) + return base + (n - domBase) / this.scale; + if (n <= vp.domBottom) + return vp.top + (n - vp.domTop); + base = vp.bottom; + domBase = vp.domBottom; + } + } +} +function scaleBlock(block, scaler) { + if (scaler.scale == 1) + return block; + let bTop = scaler.toDOM(block.top), bBottom = scaler.toDOM(block.bottom); + return new BlockInfo(block.from, block.length, bTop, bBottom - bTop, Array.isArray(block.type) ? block.type.map(b => scaleBlock(b, scaler)) : block.type); +} + +const theme = state.Facet.define({ combine: strs => strs.join(" ") }); +const darkTheme = state.Facet.define({ combine: values => values.indexOf(true) > -1 }); +const baseThemeID = styleMod.StyleModule.newName(), baseLightID = styleMod.StyleModule.newName(), baseDarkID = styleMod.StyleModule.newName(); +const lightDarkIDs = { "&light": "." + baseLightID, "&dark": "." + baseDarkID }; +function buildTheme(main, spec, scopes) { + return new styleMod.StyleModule(spec, { + finish(sel) { + return /&/.test(sel) ? sel.replace(/&\w*/, m => { + if (m == "&") + return main; + if (!scopes || !scopes[m]) + throw new RangeError(`Unsupported selector: ${m}`); + return scopes[m]; + }) : main + " " + sel; + } + }); +} +const baseTheme$1 = buildTheme("." + baseThemeID, { + "&.cm-editor": { + position: "relative !important", + boxSizing: "border-box", + "&.cm-focused": { + // Provide a simple default outline to make sure a focused + // editor is visually distinct. Can't leave the default behavior + // because that will apply to the content element, which is + // inside the scrollable container and doesn't include the + // gutters. We also can't use an 'auto' outline, since those + // are, for some reason, drawn behind the element content, which + // will cause things like the active line background to cover + // the outline (#297). + outline: "1px dotted #212121" + }, + display: "flex !important", + flexDirection: "column" + }, + ".cm-scroller": { + display: "flex !important", + alignItems: "flex-start !important", + fontFamily: "monospace", + lineHeight: 1.4, + height: "100%", + overflowX: "auto", + position: "relative", + zIndex: 0 + }, + ".cm-content": { + margin: 0, + flexGrow: 2, + minHeight: "100%", + display: "block", + whiteSpace: "pre", + wordWrap: "normal", + boxSizing: "border-box", + padding: "4px 0", + outline: "none", + "&[contenteditable=true]": { + WebkitUserModify: "read-write-plaintext-only", + } + }, + ".cm-lineWrapping": { + whiteSpace_fallback: "pre-wrap", + whiteSpace: "break-spaces", + wordBreak: "break-word", + overflowWrap: "anywhere" + }, + "&light .cm-content": { caretColor: "black" }, + "&dark .cm-content": { caretColor: "white" }, + ".cm-line": { + display: "block", + padding: "0 2px 0 4px" + }, + ".cm-selectionLayer": { + zIndex: -1, + contain: "size style" + }, + ".cm-selectionBackground": { + position: "absolute", + }, + "&light .cm-selectionBackground": { + background: "#d9d9d9" + }, + "&dark .cm-selectionBackground": { + background: "#222" + }, + "&light.cm-focused .cm-selectionBackground": { + background: "#d7d4f0" + }, + "&dark.cm-focused .cm-selectionBackground": { + background: "#233" + }, + ".cm-cursorLayer": { + zIndex: 100, + contain: "size style", + pointerEvents: "none" + }, + "&.cm-focused .cm-cursorLayer": { + animation: "steps(1) cm-blink 1.2s infinite" + }, + // Two animations defined so that we can switch between them to + // restart the animation without forcing another style + // recomputation. + "@keyframes cm-blink": { "0%": {}, "50%": { visibility: "hidden" }, "100%": {} }, + "@keyframes cm-blink2": { "0%": {}, "50%": { visibility: "hidden" }, "100%": {} }, + ".cm-cursor, .cm-dropCursor": { + position: "absolute", + borderLeft: "1.2px solid black", + marginLeft: "-0.6px", + pointerEvents: "none", + }, + ".cm-cursor": { + display: "none" + }, + "&dark .cm-cursor": { + borderLeftColor: "#444" + }, + "&.cm-focused .cm-cursor": { + display: "block" + }, + "&light .cm-activeLine": { backgroundColor: "#f3f9ff" }, + "&dark .cm-activeLine": { backgroundColor: "#223039" }, + "&light .cm-specialChar": { color: "red" }, + "&dark .cm-specialChar": { color: "#f78" }, + ".cm-gutters": { + display: "flex", + height: "100%", + boxSizing: "border-box", + left: 0, + zIndex: 200 + }, + "&light .cm-gutters": { + backgroundColor: "#f5f5f5", + color: "#6c6c6c", + borderRight: "1px solid #ddd" + }, + "&dark .cm-gutters": { + backgroundColor: "#333338", + color: "#ccc" + }, + ".cm-gutter": { + display: "flex !important", + flexDirection: "column", + flexShrink: 0, + boxSizing: "border-box", + minHeight: "100%", + overflow: "hidden" + }, + ".cm-gutterElement": { + boxSizing: "border-box" + }, + ".cm-lineNumbers .cm-gutterElement": { + padding: "0 3px 0 5px", + minWidth: "20px", + textAlign: "right", + whiteSpace: "nowrap" + }, + "&light .cm-activeLineGutter": { + backgroundColor: "#e2f2ff" + }, + "&dark .cm-activeLineGutter": { + backgroundColor: "#222227" + }, + ".cm-panels": { + boxSizing: "border-box", + position: "sticky", + left: 0, + right: 0 + }, + "&light .cm-panels": { + backgroundColor: "#f5f5f5", + color: "black" + }, + "&light .cm-panels-top": { + borderBottom: "1px solid #ddd" + }, + "&light .cm-panels-bottom": { + borderTop: "1px solid #ddd" + }, + "&dark .cm-panels": { + backgroundColor: "#333338", + color: "white" + }, + ".cm-tab": { + display: "inline-block", + overflow: "hidden", + verticalAlign: "bottom" + }, + ".cm-widgetBuffer": { + verticalAlign: "text-top", + height: "1em", + display: "inline" + }, + ".cm-placeholder": { + color: "#888", + display: "inline-block", + verticalAlign: "top", + }, + ".cm-button": { + verticalAlign: "middle", + color: "inherit", + fontSize: "70%", + padding: ".2em 1em", + borderRadius: "1px" + }, + "&light .cm-button": { + backgroundImage: "linear-gradient(#eff1f5, #d9d9df)", + border: "1px solid #888", + "&:active": { + backgroundImage: "linear-gradient(#b4b4b4, #d0d3d6)" + } + }, + "&dark .cm-button": { + backgroundImage: "linear-gradient(#393939, #111)", + border: "1px solid #888", + "&:active": { + backgroundImage: "linear-gradient(#111, #333)" + } + }, + ".cm-textfield": { + verticalAlign: "middle", + color: "inherit", + fontSize: "70%", + border: "1px solid silver", + padding: ".2em .5em" + }, + "&light .cm-textfield": { + backgroundColor: "white" + }, + "&dark .cm-textfield": { + border: "1px solid #555", + backgroundColor: "inherit" + } +}, lightDarkIDs); + +const observeOptions = { + childList: true, + characterData: true, + subtree: true, + attributes: true, + characterDataOldValue: true +}; +// IE11 has very broken mutation observers, so we also listen to +// DOMCharacterDataModified there +const useCharData = browser.ie && browser.ie_version <= 11; +class DOMObserver { + constructor(view, onChange, onScrollChanged) { + this.view = view; + this.onChange = onChange; + this.onScrollChanged = onScrollChanged; + this.active = false; + // The known selection. Kept in our own object, as opposed to just + // directly accessing the selection because: + // - Safari doesn't report the right selection in shadow DOM + // - Reading from the selection forces a DOM layout + // - This way, we can ignore selectionchange events if we have + // already seen the 'new' selection + this.selectionRange = new DOMSelectionState; + // Set when a selection change is detected, cleared on flush + this.selectionChanged = false; + this.delayedFlush = -1; + this.resizeTimeout = -1; + this.queue = []; + this.delayedAndroidKey = null; + this.scrollTargets = []; + this.intersection = null; + this.resize = null; + this.intersecting = false; + this.gapIntersection = null; + this.gaps = []; + // Timeout for scheduling check of the parents that need scroll handlers + this.parentCheck = -1; + this.dom = view.contentDOM; + this.observer = new MutationObserver(mutations => { + for (let mut of mutations) + this.queue.push(mut); + // IE11 will sometimes (on typing over a selection or + // backspacing out a single character text node) call the + // observer callback before actually updating the DOM. + // + // Unrelatedly, iOS Safari will, when ending a composition, + // sometimes first clear it, deliver the mutations, and then + // reinsert the finished text. CodeMirror's handling of the + // deletion will prevent the reinsertion from happening, + // breaking composition. + if ((browser.ie && browser.ie_version <= 11 || browser.ios && view.composing) && + mutations.some(m => m.type == "childList" && m.removedNodes.length || + m.type == "characterData" && m.oldValue.length > m.target.nodeValue.length)) + this.flushSoon(); + else + this.flush(); + }); + if (useCharData) + this.onCharData = (event) => { + this.queue.push({ target: event.target, + type: "characterData", + oldValue: event.prevValue }); + this.flushSoon(); + }; + this.onSelectionChange = this.onSelectionChange.bind(this); + window.addEventListener("resize", this.onResize = this.onResize.bind(this)); + if (typeof ResizeObserver == "function") { + this.resize = new ResizeObserver(() => { + if (this.view.docView.lastUpdate < Date.now() - 75) + this.onResize(); + }); + this.resize.observe(view.scrollDOM); + } + window.addEventListener("beforeprint", this.onPrint = this.onPrint.bind(this)); + this.start(); + window.addEventListener("scroll", this.onScroll = this.onScroll.bind(this)); + if (typeof IntersectionObserver == "function") { + this.intersection = new IntersectionObserver(entries => { + if (this.parentCheck < 0) + this.parentCheck = setTimeout(this.listenForScroll.bind(this), 1000); + if (entries.length > 0 && (entries[entries.length - 1].intersectionRatio > 0) != this.intersecting) { + this.intersecting = !this.intersecting; + if (this.intersecting != this.view.inView) + this.onScrollChanged(document.createEvent("Event")); + } + }, {}); + this.intersection.observe(this.dom); + this.gapIntersection = new IntersectionObserver(entries => { + if (entries.length > 0 && entries[entries.length - 1].intersectionRatio > 0) + this.onScrollChanged(document.createEvent("Event")); + }, {}); + } + this.listenForScroll(); + this.readSelectionRange(); + this.dom.ownerDocument.addEventListener("selectionchange", this.onSelectionChange); + } + onScroll(e) { + if (this.intersecting) + this.flush(false); + this.onScrollChanged(e); + } + onResize() { + if (this.resizeTimeout < 0) + this.resizeTimeout = setTimeout(() => { + this.resizeTimeout = -1; + this.view.requestMeasure(); + }, 50); + } + onPrint() { + this.view.viewState.printing = true; + this.view.measure(); + setTimeout(() => { + this.view.viewState.printing = false; + this.view.requestMeasure(); + }, 500); + } + updateGaps(gaps) { + if (this.gapIntersection && (gaps.length != this.gaps.length || this.gaps.some((g, i) => g != gaps[i]))) { + this.gapIntersection.disconnect(); + for (let gap of gaps) + this.gapIntersection.observe(gap); + this.gaps = gaps; + } + } + onSelectionChange(event) { + if (!this.readSelectionRange() || this.delayedAndroidKey) + return; + let { view } = this, sel = this.selectionRange; + if (view.state.facet(editable) ? view.root.activeElement != this.dom : !hasSelection(view.dom, sel)) + return; + let context = sel.anchorNode && view.docView.nearest(sel.anchorNode); + if (context && context.ignoreEvent(event)) + return; + // Deletions on IE11 fire their events in the wrong order, giving + // us a selection change event before the DOM changes are + // reported. + // Chrome Android has a similar issue when backspacing out a + // selection (#645). + if ((browser.ie && browser.ie_version <= 11 || browser.android && browser.chrome) && !view.state.selection.main.empty && + // (Selection.isCollapsed isn't reliable on IE) + sel.focusNode && isEquivalentPosition(sel.focusNode, sel.focusOffset, sel.anchorNode, sel.anchorOffset)) + this.flushSoon(); + else + this.flush(false); + } + readSelectionRange() { + let { root } = this.view, domSel = getSelection(root); + // The Selection object is broken in shadow roots in Safari. See + // https://github.com/codemirror/codemirror.next/issues/414 + let range = browser.safari && root.nodeType == 11 && deepActiveElement() == this.view.contentDOM && + safariSelectionRangeHack(this.view) || domSel; + if (this.selectionRange.eq(range)) + return false; + this.selectionRange.setRange(range); + return this.selectionChanged = true; + } + setSelectionRange(anchor, head) { + this.selectionRange.set(anchor.node, anchor.offset, head.node, head.offset); + this.selectionChanged = false; + } + clearSelectionRange() { + this.selectionRange.set(null, 0, null, 0); + } + listenForScroll() { + this.parentCheck = -1; + let i = 0, changed = null; + for (let dom = this.dom; dom;) { + if (dom.nodeType == 1) { + if (!changed && i < this.scrollTargets.length && this.scrollTargets[i] == dom) + i++; + else if (!changed) + changed = this.scrollTargets.slice(0, i); + if (changed) + changed.push(dom); + dom = dom.assignedSlot || dom.parentNode; + } + else if (dom.nodeType == 11) { // Shadow root + dom = dom.host; + } + else { + break; + } + } + if (i < this.scrollTargets.length && !changed) + changed = this.scrollTargets.slice(0, i); + if (changed) { + for (let dom of this.scrollTargets) + dom.removeEventListener("scroll", this.onScroll); + for (let dom of this.scrollTargets = changed) + dom.addEventListener("scroll", this.onScroll); + } + } + ignore(f) { + if (!this.active) + return f(); + try { + this.stop(); + return f(); + } + finally { + this.start(); + this.clear(); + } + } + start() { + if (this.active) + return; + this.observer.observe(this.dom, observeOptions); + if (useCharData) + this.dom.addEventListener("DOMCharacterDataModified", this.onCharData); + this.active = true; + } + stop() { + if (!this.active) + return; + this.active = false; + this.observer.disconnect(); + if (useCharData) + this.dom.removeEventListener("DOMCharacterDataModified", this.onCharData); + } + // Throw away any pending changes + clear() { + this.processRecords(); + this.queue.length = 0; + this.selectionChanged = false; + } + // Chrome Android, especially in combination with GBoard, not only + // doesn't reliably fire regular key events, but also often + // surrounds the effect of enter or backspace with a bunch of + // composition events that, when interrupted, cause text duplication + // or other kinds of corruption. This hack makes the editor back off + // from handling DOM changes for a moment when such a key is + // detected (via beforeinput or keydown), and then tries to flush + // them or, if that has no effect, dispatches the given key. + delayAndroidKey(key, keyCode) { + if (!this.delayedAndroidKey) + requestAnimationFrame(() => { + let key = this.delayedAndroidKey; + this.delayedAndroidKey = null; + this.delayedFlush = -1; + if (!this.flush()) + dispatchKey(this.view.contentDOM, key.key, key.keyCode); + }); + // Since backspace beforeinput is sometimes signalled spuriously, + // Enter always takes precedence. + if (!this.delayedAndroidKey || key == "Enter") + this.delayedAndroidKey = { key, keyCode }; + } + flushSoon() { + if (this.delayedFlush < 0) + this.delayedFlush = window.setTimeout(() => { this.delayedFlush = -1; this.flush(); }, 20); + } + forceFlush() { + if (this.delayedFlush >= 0) { + window.clearTimeout(this.delayedFlush); + this.delayedFlush = -1; + this.flush(); + } + } + processRecords() { + let records = this.queue; + for (let mut of this.observer.takeRecords()) + records.push(mut); + if (records.length) + this.queue = []; + let from = -1, to = -1, typeOver = false; + for (let record of records) { + let range = this.readMutation(record); + if (!range) + continue; + if (range.typeOver) + typeOver = true; + if (from == -1) { + ({ from, to } = range); + } + else { + from = Math.min(range.from, from); + to = Math.max(range.to, to); + } + } + return { from, to, typeOver }; + } + // Apply pending changes, if any + flush(readSelection = true) { + // Completely hold off flushing when pending keys are set—the code + // managing those will make sure processRecords is called and the + // view is resynchronized after + if (this.delayedFlush >= 0 || this.delayedAndroidKey) + return; + if (readSelection) + this.readSelectionRange(); + let { from, to, typeOver } = this.processRecords(); + let newSel = this.selectionChanged && hasSelection(this.dom, this.selectionRange); + if (from < 0 && !newSel) + return; + this.selectionChanged = false; + let startState = this.view.state; + let handled = this.onChange(from, to, typeOver); + // The view wasn't updated + if (this.view.state == startState) + this.view.update([]); + return handled; + } + readMutation(rec) { + let cView = this.view.docView.nearest(rec.target); + if (!cView || cView.ignoreMutation(rec)) + return null; + cView.markDirty(rec.type == "attributes"); + if (rec.type == "attributes") + cView.dirty |= 4 /* Attrs */; + if (rec.type == "childList") { + let childBefore = findChild(cView, rec.previousSibling || rec.target.previousSibling, -1); + let childAfter = findChild(cView, rec.nextSibling || rec.target.nextSibling, 1); + return { from: childBefore ? cView.posAfter(childBefore) : cView.posAtStart, + to: childAfter ? cView.posBefore(childAfter) : cView.posAtEnd, typeOver: false }; + } + else if (rec.type == "characterData") { + return { from: cView.posAtStart, to: cView.posAtEnd, typeOver: rec.target.nodeValue == rec.oldValue }; + } + else { + return null; + } + } + destroy() { + var _a, _b, _c; + this.stop(); + (_a = this.intersection) === null || _a === void 0 ? void 0 : _a.disconnect(); + (_b = this.gapIntersection) === null || _b === void 0 ? void 0 : _b.disconnect(); + (_c = this.resize) === null || _c === void 0 ? void 0 : _c.disconnect(); + for (let dom of this.scrollTargets) + dom.removeEventListener("scroll", this.onScroll); + window.removeEventListener("scroll", this.onScroll); + window.removeEventListener("resize", this.onResize); + window.removeEventListener("beforeprint", this.onPrint); + this.dom.ownerDocument.removeEventListener("selectionchange", this.onSelectionChange); + clearTimeout(this.parentCheck); + clearTimeout(this.resizeTimeout); + } +} +function findChild(cView, dom, dir) { + while (dom) { + let curView = ContentView.get(dom); + if (curView && curView.parent == cView) + return curView; + let parent = dom.parentNode; + dom = parent != cView.dom ? parent : dir > 0 ? dom.nextSibling : dom.previousSibling; + } + return null; +} +// Used to work around a Safari Selection/shadow DOM bug (#414) +function safariSelectionRangeHack(view) { + let found = null; + // Because Safari (at least in 2018-2021) doesn't provide regular + // access to the selection inside a shadowroot, we have to perform a + // ridiculous hack to get at it—using `execCommand` to trigger a + // `beforeInput` event so that we can read the target range from the + // event. + function read(event) { + event.preventDefault(); + event.stopImmediatePropagation(); + found = event.getTargetRanges()[0]; + } + view.contentDOM.addEventListener("beforeinput", read, true); + document.execCommand("indent"); + view.contentDOM.removeEventListener("beforeinput", read, true); + if (!found) + return null; + let anchorNode = found.startContainer, anchorOffset = found.startOffset; + let focusNode = found.endContainer, focusOffset = found.endOffset; + let curAnchor = view.docView.domAtPos(view.state.selection.main.anchor); + // Since such a range doesn't distinguish between anchor and head, + // use a heuristic that flips it around if its end matches the + // current anchor. + if (isEquivalentPosition(curAnchor.node, curAnchor.offset, focusNode, focusOffset)) + [anchorNode, anchorOffset, focusNode, focusOffset] = [focusNode, focusOffset, anchorNode, anchorOffset]; + return { anchorNode, anchorOffset, focusNode, focusOffset }; +} + +function applyDOMChange(view, start, end, typeOver) { + let change, newSel; + let sel = view.state.selection.main; + if (start > -1) { + let bounds = view.docView.domBoundsAround(start, end, 0); + if (!bounds || view.state.readOnly) + return false; + let { from, to } = bounds; + let selPoints = view.docView.impreciseHead || view.docView.impreciseAnchor ? [] : selectionPoints(view); + let reader = new DOMReader(selPoints, view.state); + reader.readRange(bounds.startDOM, bounds.endDOM); + let preferredPos = sel.from, preferredSide = null; + // Prefer anchoring to end when Backspace is pressed (or, on + // Android, when something was deleted) + if (view.inputState.lastKeyCode === 8 && view.inputState.lastKeyTime > Date.now() - 100 || + browser.android && reader.text.length < to - from) { + preferredPos = sel.to; + preferredSide = "end"; + } + let diff = findDiff(view.state.doc.sliceString(from, to, LineBreakPlaceholder), reader.text, preferredPos - from, preferredSide); + if (diff) { + // Chrome inserts two newlines when pressing shift-enter at the + // end of a line. This drops one of those. + if (browser.chrome && view.inputState.lastKeyCode == 13 && + diff.toB == diff.from + 2 && reader.text.slice(diff.from, diff.toB) == LineBreakPlaceholder + LineBreakPlaceholder) + diff.toB--; + change = { from: from + diff.from, to: from + diff.toA, + insert: state.Text.of(reader.text.slice(diff.from, diff.toB).split(LineBreakPlaceholder)) }; + } + newSel = selectionFromPoints(selPoints, from); + } + else if (view.hasFocus || !view.state.facet(editable)) { + let domSel = view.observer.selectionRange; + let { impreciseHead: iHead, impreciseAnchor: iAnchor } = view.docView; + let head = iHead && iHead.node == domSel.focusNode && iHead.offset == domSel.focusOffset || + !contains(view.contentDOM, domSel.focusNode) + ? view.state.selection.main.head + : view.docView.posFromDOM(domSel.focusNode, domSel.focusOffset); + let anchor = iAnchor && iAnchor.node == domSel.anchorNode && iAnchor.offset == domSel.anchorOffset || + !contains(view.contentDOM, domSel.anchorNode) + ? view.state.selection.main.anchor + : view.docView.posFromDOM(domSel.anchorNode, domSel.anchorOffset); + if (head != sel.head || anchor != sel.anchor) + newSel = state.EditorSelection.single(anchor, head); + } + if (!change && !newSel) + return false; + // Heuristic to notice typing over a selected character + if (!change && typeOver && !sel.empty && newSel && newSel.main.empty) + change = { from: sel.from, to: sel.to, insert: view.state.doc.slice(sel.from, sel.to) }; + // If the change is inside the selection and covers most of it, + // assume it is a selection replace (with identical characters at + // the start/end not included in the diff) + else if (change && change.from >= sel.from && change.to <= sel.to && + (change.from != sel.from || change.to != sel.to) && + (sel.to - sel.from) - (change.to - change.from) <= 4) + change = { + from: sel.from, to: sel.to, + insert: view.state.doc.slice(sel.from, change.from).append(change.insert).append(view.state.doc.slice(change.to, sel.to)) + }; + // Detect insert-period-on-double-space Mac behavior, and transform + // it into a regular space insert. + else if ((browser.mac || browser.android) && change && change.from == change.to && change.from == sel.head - 1 && + change.insert.toString() == ".") + change = { from: sel.from, to: sel.to, insert: state.Text.of([" "]) }; + if (change) { + let startState = view.state; + if (browser.ios && view.inputState.flushIOSKey(view)) + return true; + // Android browsers don't fire reasonable key events for enter, + // backspace, or delete. So this detects changes that look like + // they're caused by those keys, and reinterprets them as key + // events. (Some of these keys are also handled by beforeinput + // events and the pendingAndroidKey mechanism, but that's not + // reliable in all situations.) + if (browser.android && + ((change.from == sel.from && change.to == sel.to && + change.insert.length == 1 && change.insert.lines == 2 && + dispatchKey(view.contentDOM, "Enter", 13)) || + (change.from == sel.from - 1 && change.to == sel.to && change.insert.length == 0 && + dispatchKey(view.contentDOM, "Backspace", 8)) || + (change.from == sel.from && change.to == sel.to + 1 && change.insert.length == 0 && + dispatchKey(view.contentDOM, "Delete", 46)))) + return true; + let text = change.insert.toString(); + if (view.state.facet(inputHandler).some(h => h(view, change.from, change.to, text))) + return true; + if (view.inputState.composing >= 0) + view.inputState.composing++; + let tr; + if (change.from >= sel.from && change.to <= sel.to && change.to - change.from >= (sel.to - sel.from) / 3 && + (!newSel || newSel.main.empty && newSel.main.from == change.from + change.insert.length) && + view.inputState.composing < 0) { + let before = sel.from < change.from ? startState.sliceDoc(sel.from, change.from) : ""; + let after = sel.to > change.to ? startState.sliceDoc(change.to, sel.to) : ""; + tr = startState.replaceSelection(view.state.toText(before + change.insert.sliceString(0, undefined, view.state.lineBreak) + after)); + } + else { + let changes = startState.changes(change); + let mainSel = newSel && !startState.selection.main.eq(newSel.main) && newSel.main.to <= changes.newLength + ? newSel.main : undefined; + // Try to apply a composition change to all cursors + if (startState.selection.ranges.length > 1 && view.inputState.composing >= 0 && + change.to <= sel.to && change.to >= sel.to - 10) { + let replaced = view.state.sliceDoc(change.from, change.to); + let compositionRange = compositionSurroundingNode(view) || view.state.doc.lineAt(sel.head); + let offset = sel.to - change.to, size = sel.to - sel.from; + tr = startState.changeByRange(range => { + if (range.from == sel.from && range.to == sel.to) + return { changes, range: mainSel || range.map(changes) }; + let to = range.to - offset, from = to - replaced.length; + if (range.to - range.from != size || view.state.sliceDoc(from, to) != replaced || + // Unfortunately, there's no way to make multiple + // changes in the same node work without aborting + // composition, so cursors in the composition range are + // ignored. + compositionRange && range.to >= compositionRange.from && range.from <= compositionRange.to) + return { range }; + let rangeChanges = startState.changes({ from, to, insert: change.insert }), selOff = range.to - sel.to; + return { + changes: rangeChanges, + range: !mainSel ? range.map(rangeChanges) : + state.EditorSelection.range(Math.max(0, mainSel.anchor + selOff), Math.max(0, mainSel.head + selOff)) + }; + }); + } + else { + tr = { + changes, + selection: mainSel && startState.selection.replaceRange(mainSel) + }; + } + } + let userEvent = "input.type"; + if (view.composing) { + userEvent += ".compose"; + if (view.inputState.compositionFirstChange) { + userEvent += ".start"; + view.inputState.compositionFirstChange = false; + } + } + view.dispatch(tr, { scrollIntoView: true, userEvent }); + return true; + } + else if (newSel && !newSel.main.eq(sel)) { + let scrollIntoView = false, userEvent = "select"; + if (view.inputState.lastSelectionTime > Date.now() - 50) { + if (view.inputState.lastSelectionOrigin == "select") + scrollIntoView = true; + userEvent = view.inputState.lastSelectionOrigin; + } + view.dispatch({ selection: newSel, scrollIntoView, userEvent }); + return true; + } + else { + return false; + } +} +function findDiff(a, b, preferredPos, preferredSide) { + let minLen = Math.min(a.length, b.length); + let from = 0; + while (from < minLen && a.charCodeAt(from) == b.charCodeAt(from)) + from++; + if (from == minLen && a.length == b.length) + return null; + let toA = a.length, toB = b.length; + while (toA > 0 && toB > 0 && a.charCodeAt(toA - 1) == b.charCodeAt(toB - 1)) { + toA--; + toB--; + } + if (preferredSide == "end") { + let adjust = Math.max(0, from - Math.min(toA, toB)); + preferredPos -= toA + adjust - from; + } + if (toA < from && a.length < b.length) { + let move = preferredPos <= from && preferredPos >= toA ? from - preferredPos : 0; + from -= move; + toB = from + (toB - toA); + toA = from; + } + else if (toB < from) { + let move = preferredPos <= from && preferredPos >= toB ? from - preferredPos : 0; + from -= move; + toA = from + (toA - toB); + toB = from; + } + return { from, toA, toB }; +} +function selectionPoints(view) { + let result = []; + if (view.root.activeElement != view.contentDOM) + return result; + let { anchorNode, anchorOffset, focusNode, focusOffset } = view.observer.selectionRange; + if (anchorNode) { + result.push(new DOMPoint(anchorNode, anchorOffset)); + if (focusNode != anchorNode || focusOffset != anchorOffset) + result.push(new DOMPoint(focusNode, focusOffset)); + } + return result; +} +function selectionFromPoints(points, base) { + if (points.length == 0) + return null; + let anchor = points[0].pos, head = points.length == 2 ? points[1].pos : anchor; + return anchor > -1 && head > -1 ? state.EditorSelection.single(anchor + base, head + base) : null; +} + +// The editor's update state machine looks something like this: +// +// Idle → Updating ⇆ Idle (unchecked) → Measuring → Idle +// ↑ ↓ +// Updating (measure) +// +// The difference between 'Idle' and 'Idle (unchecked)' lies in +// whether a layout check has been scheduled. A regular update through +// the `update` method updates the DOM in a write-only fashion, and +// relies on a check (scheduled with `requestAnimationFrame`) to make +// sure everything is where it should be and the viewport covers the +// visible code. That check continues to measure and then optionally +// update until it reaches a coherent state. +/** +An editor view represents the editor's user interface. It holds +the editable DOM surface, and possibly other elements such as the +line number gutter. It handles events and dispatches state +transactions for editing actions. +*/ +class EditorView { + /** + Construct a new view. You'll want to either provide a `parent` + option, or put `view.dom` into your document after creating a + view, so that the user can see the editor. + */ + constructor(config = {}) { + this.plugins = []; + this.pluginMap = new Map; + this.editorAttrs = {}; + this.contentAttrs = {}; + this.bidiCache = []; + this.destroyed = false; + /** + @internal + */ + this.updateState = 2 /* Updating */; + /** + @internal + */ + this.measureScheduled = -1; + /** + @internal + */ + this.measureRequests = []; + this.contentDOM = document.createElement("div"); + this.scrollDOM = document.createElement("div"); + this.scrollDOM.tabIndex = -1; + this.scrollDOM.className = "cm-scroller"; + this.scrollDOM.appendChild(this.contentDOM); + this.announceDOM = document.createElement("div"); + this.announceDOM.style.cssText = "position: absolute; top: -10000px"; + this.announceDOM.setAttribute("aria-live", "polite"); + this.dom = document.createElement("div"); + this.dom.appendChild(this.announceDOM); + this.dom.appendChild(this.scrollDOM); + this._dispatch = config.dispatch || ((tr) => this.update([tr])); + this.dispatch = this.dispatch.bind(this); + this.root = (config.root || getRoot(config.parent) || document); + this.viewState = new ViewState(config.state || state.EditorState.create(config)); + this.plugins = this.state.facet(viewPlugin).map(spec => new PluginInstance(spec)); + for (let plugin of this.plugins) + plugin.update(this); + this.observer = new DOMObserver(this, (from, to, typeOver) => { + return applyDOMChange(this, from, to, typeOver); + }, event => { + this.inputState.runScrollHandlers(this, event); + if (this.observer.intersecting) + this.measure(); + }); + this.inputState = new InputState(this); + this.inputState.ensureHandlers(this, this.plugins); + this.docView = new DocView(this); + this.mountStyles(); + this.updateAttrs(); + this.updateState = 0 /* Idle */; + this.requestMeasure(); + if (config.parent) + config.parent.appendChild(this.dom); + } + /** + The current editor state. + */ + get state() { return this.viewState.state; } + /** + To be able to display large documents without consuming too much + memory or overloading the browser, CodeMirror only draws the + code that is visible (plus a margin around it) to the DOM. This + property tells you the extent of the current drawn viewport, in + document positions. + */ + get viewport() { return this.viewState.viewport; } + /** + When there are, for example, large collapsed ranges in the + viewport, its size can be a lot bigger than the actual visible + content. Thus, if you are doing something like styling the + content in the viewport, it is preferable to only do so for + these ranges, which are the subset of the viewport that is + actually drawn. + */ + get visibleRanges() { return this.viewState.visibleRanges; } + /** + Returns false when the editor is entirely scrolled out of view + or otherwise hidden. + */ + get inView() { return this.viewState.inView; } + /** + Indicates whether the user is currently composing text via + [IME](https://en.wikipedia.org/wiki/Input_method), and at least + one change has been made in the current composition. + */ + get composing() { return this.inputState.composing > 0; } + /** + Indicates whether the user is currently in composing state. Note + that on some platforms, like Android, this will be the case a + lot, since just putting the cursor on a word starts a + composition there. + */ + get compositionStarted() { return this.inputState.composing >= 0; } + dispatch(...input) { + this._dispatch(input.length == 1 && input[0] instanceof state.Transaction ? input[0] + : this.state.update(...input)); + } + /** + Update the view for the given array of transactions. This will + update the visible document and selection to match the state + produced by the transactions, and notify view plugins of the + change. You should usually call + [`dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch) instead, which uses this + as a primitive. + */ + update(transactions) { + if (this.updateState != 0 /* Idle */) + throw new Error("Calls to EditorView.update are not allowed while an update is in progress"); + let redrawn = false, attrsChanged = false, update; + let state$1 = this.state; + for (let tr of transactions) { + if (tr.startState != state$1) + throw new RangeError("Trying to update state with a transaction that doesn't start from the previous state."); + state$1 = tr.state; + } + if (this.destroyed) { + this.viewState.state = state$1; + return; + } + this.observer.clear(); + // When the phrases change, redraw the editor + if (state$1.facet(state.EditorState.phrases) != this.state.facet(state.EditorState.phrases)) + return this.setState(state$1); + update = ViewUpdate.create(this, state$1, transactions); + let scrollTarget = this.viewState.scrollTarget; + try { + this.updateState = 2 /* Updating */; + for (let tr of transactions) { + if (scrollTarget) + scrollTarget = scrollTarget.map(tr.changes); + if (tr.scrollIntoView) { + let { main } = tr.state.selection; + scrollTarget = new ScrollTarget(main.empty ? main : state.EditorSelection.cursor(main.head, main.head > main.anchor ? -1 : 1)); + } + for (let e of tr.effects) + if (e.is(scrollIntoView)) + scrollTarget = e.value; + } + this.viewState.update(update, scrollTarget); + this.bidiCache = CachedOrder.update(this.bidiCache, update.changes); + if (!update.empty) { + this.updatePlugins(update); + this.inputState.update(update); + } + redrawn = this.docView.update(update); + if (this.state.facet(styleModule) != this.styleModules) + this.mountStyles(); + attrsChanged = this.updateAttrs(); + this.showAnnouncements(transactions); + this.docView.updateSelection(redrawn, transactions.some(tr => tr.isUserEvent("select.pointer"))); + } + finally { + this.updateState = 0 /* Idle */; + } + if (update.startState.facet(theme) != update.state.facet(theme)) + this.viewState.mustMeasureContent = true; + if (redrawn || attrsChanged || scrollTarget || this.viewState.mustEnforceCursorAssoc || this.viewState.mustMeasureContent) + this.requestMeasure(); + if (!update.empty) + for (let listener of this.state.facet(updateListener)) + listener(update); + } + /** + Reset the view to the given state. (This will cause the entire + document to be redrawn and all view plugins to be reinitialized, + so you should probably only use it when the new state isn't + derived from the old state. Otherwise, use + [`dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch) instead.) + */ + setState(newState) { + if (this.updateState != 0 /* Idle */) + throw new Error("Calls to EditorView.setState are not allowed while an update is in progress"); + if (this.destroyed) { + this.viewState.state = newState; + return; + } + this.updateState = 2 /* Updating */; + let hadFocus = this.hasFocus; + try { + for (let plugin of this.plugins) + plugin.destroy(this); + this.viewState = new ViewState(newState); + this.plugins = newState.facet(viewPlugin).map(spec => new PluginInstance(spec)); + this.pluginMap.clear(); + for (let plugin of this.plugins) + plugin.update(this); + this.docView = new DocView(this); + this.inputState.ensureHandlers(this, this.plugins); + this.mountStyles(); + this.updateAttrs(); + this.bidiCache = []; + } + finally { + this.updateState = 0 /* Idle */; + } + if (hadFocus) + this.focus(); + this.requestMeasure(); + } + updatePlugins(update) { + let prevSpecs = update.startState.facet(viewPlugin), specs = update.state.facet(viewPlugin); + if (prevSpecs != specs) { + let newPlugins = []; + for (let spec of specs) { + let found = prevSpecs.indexOf(spec); + if (found < 0) { + newPlugins.push(new PluginInstance(spec)); + } + else { + let plugin = this.plugins[found]; + plugin.mustUpdate = update; + newPlugins.push(plugin); + } + } + for (let plugin of this.plugins) + if (plugin.mustUpdate != update) + plugin.destroy(this); + this.plugins = newPlugins; + this.pluginMap.clear(); + this.inputState.ensureHandlers(this, this.plugins); + } + else { + for (let p of this.plugins) + p.mustUpdate = update; + } + for (let i = 0; i < this.plugins.length; i++) + this.plugins[i].update(this); + } + /** + @internal + */ + measure(flush = true) { + if (this.destroyed) + return; + if (this.measureScheduled > -1) + cancelAnimationFrame(this.measureScheduled); + this.measureScheduled = 0; // Prevent requestMeasure calls from scheduling another animation frame + if (flush) + this.observer.flush(); + let updated = null; + try { + for (let i = 0;; i++) { + this.updateState = 1 /* Measuring */; + let oldViewport = this.viewport; + let changed = this.viewState.measure(this); + if (!changed && !this.measureRequests.length && this.viewState.scrollTarget == null) + break; + if (i > 5) { + console.warn(this.measureRequests.length + ? "Measure loop restarted more than 5 times" + : "Viewport failed to stabilize"); + break; + } + let measuring = []; + // Only run measure requests in this cycle when the viewport didn't change + if (!(changed & 4 /* Viewport */)) + [this.measureRequests, measuring] = [measuring, this.measureRequests]; + let measured = measuring.map(m => { + try { + return m.read(this); + } + catch (e) { + logException(this.state, e); + return BadMeasure; + } + }); + let update = ViewUpdate.create(this, this.state, []), redrawn = false, scrolled = false; + update.flags |= changed; + if (!updated) + updated = update; + else + updated.flags |= changed; + this.updateState = 2 /* Updating */; + if (!update.empty) { + this.updatePlugins(update); + this.inputState.update(update); + this.updateAttrs(); + redrawn = this.docView.update(update); + } + for (let i = 0; i < measuring.length; i++) + if (measured[i] != BadMeasure) { + try { + let m = measuring[i]; + if (m.write) + m.write(measured[i], this); + } + catch (e) { + logException(this.state, e); + } + } + if (this.viewState.scrollTarget) { + this.docView.scrollIntoView(this.viewState.scrollTarget); + this.viewState.scrollTarget = null; + scrolled = true; + } + if (redrawn) + this.docView.updateSelection(true); + if (this.viewport.from == oldViewport.from && this.viewport.to == oldViewport.to && + !scrolled && this.measureRequests.length == 0) + break; + } + } + finally { + this.updateState = 0 /* Idle */; + this.measureScheduled = -1; + } + if (updated && !updated.empty) + for (let listener of this.state.facet(updateListener)) + listener(updated); + } + /** + Get the CSS classes for the currently active editor themes. + */ + get themeClasses() { + return baseThemeID + " " + + (this.state.facet(darkTheme) ? baseDarkID : baseLightID) + " " + + this.state.facet(theme); + } + updateAttrs() { + let editorAttrs = attrsFromFacet(this, editorAttributes, { + class: "cm-editor" + (this.hasFocus ? " cm-focused " : " ") + this.themeClasses + }); + let contentAttrs = { + spellcheck: "false", + autocorrect: "off", + autocapitalize: "off", + translate: "no", + contenteditable: !this.state.facet(editable) ? "false" : "true", + class: "cm-content", + style: `${browser.tabSize}: ${this.state.tabSize}`, + role: "textbox", + "aria-multiline": "true" + }; + if (this.state.readOnly) + contentAttrs["aria-readonly"] = "true"; + attrsFromFacet(this, contentAttributes, contentAttrs); + let changed = this.observer.ignore(() => { + let changedContent = updateAttrs(this.contentDOM, this.contentAttrs, contentAttrs); + let changedEditor = updateAttrs(this.dom, this.editorAttrs, editorAttrs); + return changedContent || changedEditor; + }); + this.editorAttrs = editorAttrs; + this.contentAttrs = contentAttrs; + return changed; + } + showAnnouncements(trs) { + let first = true; + for (let tr of trs) + for (let effect of tr.effects) + if (effect.is(EditorView.announce)) { + if (first) + this.announceDOM.textContent = ""; + first = false; + let div = this.announceDOM.appendChild(document.createElement("div")); + div.textContent = effect.value; + } + } + mountStyles() { + this.styleModules = this.state.facet(styleModule); + styleMod.StyleModule.mount(this.root, this.styleModules.concat(baseTheme$1).reverse()); + } + readMeasured() { + if (this.updateState == 2 /* Updating */) + throw new Error("Reading the editor layout isn't allowed during an update"); + if (this.updateState == 0 /* Idle */ && this.measureScheduled > -1) + this.measure(false); + } + /** + Schedule a layout measurement, optionally providing callbacks to + do custom DOM measuring followed by a DOM write phase. Using + this is preferable reading DOM layout directly from, for + example, an event handler, because it'll make sure measuring and + drawing done by other components is synchronized, avoiding + unnecessary DOM layout computations. + */ + requestMeasure(request) { + if (this.measureScheduled < 0) + this.measureScheduled = requestAnimationFrame(() => this.measure()); + if (request) { + if (request.key != null) + for (let i = 0; i < this.measureRequests.length; i++) { + if (this.measureRequests[i].key === request.key) { + this.measureRequests[i] = request; + return; + } + } + this.measureRequests.push(request); + } + } + /** + Get the value of a specific plugin, if present. Note that + plugins that crash can be dropped from a view, so even when you + know you registered a given plugin, it is recommended to check + the return value of this method. + */ + plugin(plugin) { + let known = this.pluginMap.get(plugin); + if (known === undefined || known && known.spec != plugin) + this.pluginMap.set(plugin, known = this.plugins.find(p => p.spec == plugin) || null); + return known && known.update(this).value; + } + /** + The top position of the document, in screen coordinates. This + may be negative when the editor is scrolled down. Points + directly to the top of the first line, not above the padding. + */ + get documentTop() { + return this.contentDOM.getBoundingClientRect().top + this.viewState.paddingTop; + } + /** + Reports the padding above and below the document. + */ + get documentPadding() { + return { top: this.viewState.paddingTop, bottom: this.viewState.paddingBottom }; + } + /** + Find the text line or block widget at the given vertical + position (which is interpreted as relative to the [top of the + document](https://codemirror.net/6/docs/ref/#view.EditorView.documentTop) + */ + elementAtHeight(height) { + this.readMeasured(); + return this.viewState.elementAtHeight(height); + } + /** + Find the line block (see + [`lineBlockAt`](https://codemirror.net/6/docs/ref/#view.EditorView.lineBlockAt) at the given + height. + */ + lineBlockAtHeight(height) { + this.readMeasured(); + return this.viewState.lineBlockAtHeight(height); + } + /** + Get the extent and vertical position of all [line + blocks](https://codemirror.net/6/docs/ref/#view.EditorView.lineBlockAt) in the viewport. Positions + are relative to the [top of the + document](https://codemirror.net/6/docs/ref/#view.EditorView.documentTop); + */ + get viewportLineBlocks() { + return this.viewState.viewportLines; + } + /** + Find the line block around the given document position. A line + block is a range delimited on both sides by either a + non-[hidden](https://codemirror.net/6/docs/ref/#view.Decoration^replace) line breaks, or the + start/end of the document. It will usually just hold a line of + text, but may be broken into multiple textblocks by block + widgets. + */ + lineBlockAt(pos) { + return this.viewState.lineBlockAt(pos); + } + /** + The editor's total content height. + */ + get contentHeight() { + return this.viewState.contentHeight; + } + /** + Move a cursor position by [grapheme + cluster](https://codemirror.net/6/docs/ref/#state.findClusterBreak). `forward` determines whether + the motion is away from the line start, or towards it. In + bidirectional text, the line is traversed in visual order, using + the editor's [text direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection). + When the start position was the last one on the line, the + returned position will be across the line break. If there is no + further line, the original position is returned. + + By default, this method moves over a single cluster. The + optional `by` argument can be used to move across more. It will + be called with the first cluster as argument, and should return + a predicate that determines, for each subsequent cluster, + whether it should also be moved over. + */ + moveByChar(start, forward, by) { + return skipAtoms(this, start, moveByChar(this, start, forward, by)); + } + /** + Move a cursor position across the next group of either + [letters](https://codemirror.net/6/docs/ref/#state.EditorState.charCategorizer) or non-letter + non-whitespace characters. + */ + moveByGroup(start, forward) { + return skipAtoms(this, start, moveByChar(this, start, forward, initial => byGroup(this, start.head, initial))); + } + /** + Move to the next line boundary in the given direction. If + `includeWrap` is true, line wrapping is on, and there is a + further wrap point on the current line, the wrap point will be + returned. Otherwise this function will return the start or end + of the line. + */ + moveToLineBoundary(start, forward, includeWrap = true) { + return moveToLineBoundary(this, start, forward, includeWrap); + } + /** + Move a cursor position vertically. When `distance` isn't given, + it defaults to moving to the next line (including wrapped + lines). Otherwise, `distance` should provide a positive distance + in pixels. + + When `start` has a + [`goalColumn`](https://codemirror.net/6/docs/ref/#state.SelectionRange.goalColumn), the vertical + motion will use that as a target horizontal position. Otherwise, + the cursor's own horizontal position is used. The returned + cursor will have its goal column set to whichever column was + used. + */ + moveVertically(start, forward, distance) { + return skipAtoms(this, start, moveVertically(this, start, forward, distance)); + } + /** + Find the DOM parent node and offset (child offset if `node` is + an element, character offset when it is a text node) at the + given document position. + + Note that for positions that aren't currently in + `visibleRanges`, the resulting DOM position isn't necessarily + meaningful (it may just point before or after a placeholder + element). + */ + domAtPos(pos) { + return this.docView.domAtPos(pos); + } + /** + Find the document position at the given DOM node. Can be useful + for associating positions with DOM events. Will raise an error + when `node` isn't part of the editor content. + */ + posAtDOM(node, offset = 0) { + return this.docView.posFromDOM(node, offset); + } + posAtCoords(coords, precise = true) { + this.readMeasured(); + return posAtCoords(this, coords, precise); + } + /** + Get the screen coordinates at the given document position. + `side` determines whether the coordinates are based on the + element before (-1) or after (1) the position (if no element is + available on the given side, the method will transparently use + another strategy to get reasonable coordinates). + */ + coordsAtPos(pos, side = 1) { + this.readMeasured(); + let rect = this.docView.coordsAt(pos, side); + if (!rect || rect.left == rect.right) + return rect; + let line = this.state.doc.lineAt(pos), order = this.bidiSpans(line); + let span = order[BidiSpan.find(order, pos - line.from, -1, side)]; + return flattenRect(rect, (span.dir == exports.Direction.LTR) == (side > 0)); + } + /** + The default width of a character in the editor. May not + accurately reflect the width of all characters (given variable + width fonts or styling of invididual ranges). + */ + get defaultCharacterWidth() { return this.viewState.heightOracle.charWidth; } + /** + The default height of a line in the editor. May not be accurate + for all lines. + */ + get defaultLineHeight() { return this.viewState.heightOracle.lineHeight; } + /** + The text direction + ([`direction`](https://developer.mozilla.org/en-US/docs/Web/CSS/direction) + CSS property) of the editor's content element. + */ + get textDirection() { return this.viewState.defaultTextDirection; } + /** + Find the text direction of the block at the given position, as + assigned by CSS. If + [`perLineTextDirection`](https://codemirror.net/6/docs/ref/#view.EditorView^perLineTextDirection) + isn't enabled, or the given position is outside of the viewport, + this will always return the same as + [`textDirection`](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection). Note that + this may trigger a DOM layout. + */ + textDirectionAt(pos) { + let perLine = this.state.facet(perLineTextDirection); + if (!perLine || pos < this.viewport.from || pos > this.viewport.to) + return this.textDirection; + this.readMeasured(); + return this.docView.textDirectionAt(pos); + } + /** + Whether this editor [wraps lines](https://codemirror.net/6/docs/ref/#view.EditorView.lineWrapping) + (as determined by the + [`white-space`](https://developer.mozilla.org/en-US/docs/Web/CSS/white-space) + CSS property of its content element). + */ + get lineWrapping() { return this.viewState.heightOracle.lineWrapping; } + /** + Returns the bidirectional text structure of the given line + (which should be in the current document) as an array of span + objects. The order of these spans matches the [text + direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection)—if that is + left-to-right, the leftmost spans come first, otherwise the + rightmost spans come first. + */ + bidiSpans(line) { + if (line.length > MaxBidiLine) + return trivialOrder(line.length); + let dir = this.textDirectionAt(line.from); + for (let entry of this.bidiCache) + if (entry.from == line.from && entry.dir == dir) + return entry.order; + let order = computeOrder(line.text, dir); + this.bidiCache.push(new CachedOrder(line.from, line.to, dir, order)); + return order; + } + /** + Check whether the editor has focus. + */ + get hasFocus() { + var _a; + // Safari return false for hasFocus when the context menu is open + // or closing, which leads us to ignore selection changes from the + // context menu because it looks like the editor isn't focused. + // This kludges around that. + return (document.hasFocus() || browser.safari && ((_a = this.inputState) === null || _a === void 0 ? void 0 : _a.lastContextMenu) > Date.now() - 3e4) && + this.root.activeElement == this.contentDOM; + } + /** + Put focus on the editor. + */ + focus() { + this.observer.ignore(() => { + focusPreventScroll(this.contentDOM); + this.docView.updateSelection(); + }); + } + /** + Clean up this editor view, removing its element from the + document, unregistering event handlers, and notifying + plugins. The view instance can no longer be used after + calling this. + */ + destroy() { + for (let plugin of this.plugins) + plugin.destroy(this); + this.plugins = []; + this.inputState.destroy(); + this.dom.remove(); + this.observer.destroy(); + if (this.measureScheduled > -1) + cancelAnimationFrame(this.measureScheduled); + this.destroyed = true; + } + /** + Returns an effect that can be + [added](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) to a transaction to + cause it to scroll the given position or range into view. + */ + static scrollIntoView(pos, options = {}) { + return scrollIntoView.of(new ScrollTarget(typeof pos == "number" ? state.EditorSelection.cursor(pos) : pos, options.y, options.x, options.yMargin, options.xMargin)); + } + /** + Returns an extension that can be used to add DOM event handlers. + The value should be an object mapping event names to handler + functions. For any given event, such functions are ordered by + extension precedence, and the first handler to return true will + be assumed to have handled that event, and no other handlers or + built-in behavior will be activated for it. These are registered + on the [content element](https://codemirror.net/6/docs/ref/#view.EditorView.contentDOM), except + for `scroll` handlers, which will be called any time the + editor's [scroll element](https://codemirror.net/6/docs/ref/#view.EditorView.scrollDOM) or one of + its parent nodes is scrolled. + */ + static domEventHandlers(handlers) { + return ViewPlugin.define(() => ({}), { eventHandlers: handlers }); + } + /** + Create a theme extension. The first argument can be a + [`style-mod`](https://github.com/marijnh/style-mod#documentation) + style spec providing the styles for the theme. These will be + prefixed with a generated class for the style. + + Because the selectors will be prefixed with a scope class, rule + that directly match the editor's [wrapper + element](https://codemirror.net/6/docs/ref/#view.EditorView.dom)—to which the scope class will be + added—need to be explicitly differentiated by adding an `&` to + the selector for that element—for example + `&.cm-focused`. + + When `dark` is set to true, the theme will be marked as dark, + which will cause the `&dark` rules from [base + themes](https://codemirror.net/6/docs/ref/#view.EditorView^baseTheme) to be used (as opposed to + `&light` when a light theme is active). + */ + static theme(spec, options) { + let prefix = styleMod.StyleModule.newName(); + let result = [theme.of(prefix), styleModule.of(buildTheme(`.${prefix}`, spec))]; + if (options && options.dark) + result.push(darkTheme.of(true)); + return result; + } + /** + Create an extension that adds styles to the base theme. Like + with [`theme`](https://codemirror.net/6/docs/ref/#view.EditorView^theme), use `&` to indicate the + place of the editor wrapper element when directly targeting + that. You can also use `&dark` or `&light` instead to only + target editors with a dark or light theme. + */ + static baseTheme(spec) { + return state.Prec.lowest(styleModule.of(buildTheme("." + baseThemeID, spec, lightDarkIDs))); + } + /** + Retrieve an editor view instance from the view's DOM + representation. + */ + static findFromDOM(dom) { + var _a; + let content = dom.querySelector(".cm-content"); + let cView = content && ContentView.get(content) || ContentView.get(dom); + return ((_a = cView === null || cView === void 0 ? void 0 : cView.rootView) === null || _a === void 0 ? void 0 : _a.view) || null; + } +} +/** +Facet to add a [style +module](https://github.com/marijnh/style-mod#documentation) to +an editor view. The view will ensure that the module is +mounted in its [document +root](https://codemirror.net/6/docs/ref/#view.EditorView.constructor^config.root). +*/ +EditorView.styleModule = styleModule; +/** +An input handler can override the way changes to the editable +DOM content are handled. Handlers are passed the document +positions between which the change was found, and the new +content. When one returns true, no further input handlers are +called and the default behavior is prevented. +*/ +EditorView.inputHandler = inputHandler; +/** +By default, the editor assumes all its content has the same +[text direction](https://codemirror.net/6/docs/ref/#view.Direction). Configure this with a `true` +value to make it read the text direction of every (rendered) +line separately. +*/ +EditorView.perLineTextDirection = perLineTextDirection; +/** +Allows you to provide a function that should be called when the +library catches an exception from an extension (mostly from view +plugins, but may be used by other extensions to route exceptions +from user-code-provided callbacks). This is mostly useful for +debugging and logging. See [`logException`](https://codemirror.net/6/docs/ref/#view.logException). +*/ +EditorView.exceptionSink = exceptionSink; +/** +A facet that can be used to register a function to be called +every time the view updates. +*/ +EditorView.updateListener = updateListener; +/** +Facet that controls whether the editor content DOM is editable. +When its highest-precedence value is `false`, the element will +not have its `contenteditable` attribute set. (Note that this +doesn't affect API calls that change the editor content, even +when those are bound to keys or buttons. See the +[`readOnly`](https://codemirror.net/6/docs/ref/#state.EditorState.readOnly) facet for that.) +*/ +EditorView.editable = editable; +/** +Allows you to influence the way mouse selection happens. The +functions in this facet will be called for a `mousedown` event +on the editor, and can return an object that overrides the way a +selection is computed from that mouse click or drag. +*/ +EditorView.mouseSelectionStyle = mouseSelectionStyle; +/** +Facet used to configure whether a given selection drag event +should move or copy the selection. The given predicate will be +called with the `mousedown` event, and can return `true` when +the drag should move the content. +*/ +EditorView.dragMovesSelection = dragMovesSelection$1; +/** +Facet used to configure whether a given selecting click adds a +new range to the existing selection or replaces it entirely. The +default behavior is to check `event.metaKey` on macOS, and +`event.ctrlKey` elsewhere. +*/ +EditorView.clickAddsSelectionRange = clickAddsSelectionRange; +/** +A facet that determines which [decorations](https://codemirror.net/6/docs/ref/#view.Decoration) +are shown in the view. Decorations can be provided in two +ways—directly, or via a function that takes an editor view. + +Only decoration sets provided directly are allowed to influence +the editor's vertical layout structure. The ones provided as +functions are called _after_ the new viewport has been computed, +and thus **must not** introduce block widgets or replacing +decorations that cover line breaks. +*/ +EditorView.decorations = decorations; +/** +Used to provide ranges that should be treated as atoms as far as +cursor motion is concerned. This causes methods like +[`moveByChar`](https://codemirror.net/6/docs/ref/#view.EditorView.moveByChar) and +[`moveVertically`](https://codemirror.net/6/docs/ref/#view.EditorView.moveVertically) (and the +commands built on top of them) to skip across such regions when +a selection endpoint would enter them. This does _not_ prevent +direct programmatic [selection +updates](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection) from moving into such +regions. +*/ +EditorView.atomicRanges = atomicRanges; +/** +Facet that allows extensions to provide additional scroll +margins (space around the sides of the scrolling element that +should be considered invisible). This can be useful when the +plugin introduces elements that cover part of that element (for +example a horizontally fixed gutter). +*/ +EditorView.scrollMargins = scrollMargins; +/** +This facet records whether a dark theme is active. The extension +returned by [`theme`](https://codemirror.net/6/docs/ref/#view.EditorView^theme) automatically +includes an instance of this when the `dark` option is set to +true. +*/ +EditorView.darkTheme = darkTheme; +/** +Facet that provides additional DOM attributes for the editor's +editable DOM element. +*/ +EditorView.contentAttributes = contentAttributes; +/** +Facet that provides DOM attributes for the editor's outer +element. +*/ +EditorView.editorAttributes = editorAttributes; +/** +An extension that enables line wrapping in the editor (by +setting CSS `white-space` to `pre-wrap` in the content). +*/ +EditorView.lineWrapping = EditorView.contentAttributes.of({ "class": "cm-lineWrapping" }); +/** +State effect used to include screen reader announcements in a +transaction. These will be added to the DOM in a visually hidden +element with `aria-live="polite"` set, and should be used to +describe effects that are visually obvious but may not be +noticed by screen reader users (such as moving to the next +search match). +*/ +EditorView.announce = state.StateEffect.define(); +// Maximum line length for which we compute accurate bidi info +const MaxBidiLine = 4096; +const BadMeasure = {}; +class CachedOrder { + constructor(from, to, dir, order) { + this.from = from; + this.to = to; + this.dir = dir; + this.order = order; + } + static update(cache, changes) { + if (changes.empty) + return cache; + let result = [], lastDir = cache.length ? cache[cache.length - 1].dir : exports.Direction.LTR; + for (let i = Math.max(0, cache.length - 10); i < cache.length; i++) { + let entry = cache[i]; + if (entry.dir == lastDir && !changes.touchesRange(entry.from, entry.to)) + result.push(new CachedOrder(changes.mapPos(entry.from, 1), changes.mapPos(entry.to, -1), entry.dir, entry.order)); + } + return result; + } +} +function attrsFromFacet(view, facet, base) { + for (let sources = view.state.facet(facet), i = sources.length - 1; i >= 0; i--) { + let source = sources[i], value = typeof source == "function" ? source(view) : source; + if (value) + combineAttrs(value, base); + } + return base; +} + +const currentPlatform = browser.mac ? "mac" : browser.windows ? "win" : browser.linux ? "linux" : "key"; +function normalizeKeyName(name, platform) { + const parts = name.split(/-(?!$)/); + let result = parts[parts.length - 1]; + if (result == "Space") + result = " "; + let alt, ctrl, shift, meta; + for (let i = 0; i < parts.length - 1; ++i) { + const mod = parts[i]; + if (/^(cmd|meta|m)$/i.test(mod)) + meta = true; + else if (/^a(lt)?$/i.test(mod)) + alt = true; + else if (/^(c|ctrl|control)$/i.test(mod)) + ctrl = true; + else if (/^s(hift)?$/i.test(mod)) + shift = true; + else if (/^mod$/i.test(mod)) { + if (platform == "mac") + meta = true; + else + ctrl = true; + } + else + throw new Error("Unrecognized modifier name: " + mod); + } + if (alt) + result = "Alt-" + result; + if (ctrl) + result = "Ctrl-" + result; + if (meta) + result = "Meta-" + result; + if (shift) + result = "Shift-" + result; + return result; +} +function modifiers(name, event, shift) { + if (event.altKey) + name = "Alt-" + name; + if (event.ctrlKey) + name = "Ctrl-" + name; + if (event.metaKey) + name = "Meta-" + name; + if (shift !== false && event.shiftKey) + name = "Shift-" + name; + return name; +} +const handleKeyEvents = EditorView.domEventHandlers({ + keydown(event, view) { + return runHandlers(getKeymap(view.state), event, view, "editor"); + } +}); +/** +Facet used for registering keymaps. + +You can add multiple keymaps to an editor. Their priorities +determine their precedence (the ones specified early or with high +priority get checked first). When a handler has returned `true` +for a given key, no further handlers are called. +*/ +const keymap = state.Facet.define({ enables: handleKeyEvents }); +const Keymaps = new WeakMap(); +// This is hidden behind an indirection, rather than directly computed +// by the facet, to keep internal types out of the facet's type. +function getKeymap(state) { + let bindings = state.facet(keymap); + let map = Keymaps.get(bindings); + if (!map) + Keymaps.set(bindings, map = buildKeymap(bindings.reduce((a, b) => a.concat(b), []))); + return map; +} +/** +Run the key handlers registered for a given scope. The event +object should be a `"keydown"` event. Returns true if any of the +handlers handled it. +*/ +function runScopeHandlers(view, event, scope) { + return runHandlers(getKeymap(view.state), event, view, scope); +} +let storedPrefix = null; +const PrefixTimeout = 4000; +function buildKeymap(bindings, platform = currentPlatform) { + let bound = Object.create(null); + let isPrefix = Object.create(null); + let checkPrefix = (name, is) => { + let current = isPrefix[name]; + if (current == null) + isPrefix[name] = is; + else if (current != is) + throw new Error("Key binding " + name + " is used both as a regular binding and as a multi-stroke prefix"); + }; + let add = (scope, key, command, preventDefault) => { + let scopeObj = bound[scope] || (bound[scope] = Object.create(null)); + let parts = key.split(/ (?!$)/).map(k => normalizeKeyName(k, platform)); + for (let i = 1; i < parts.length; i++) { + let prefix = parts.slice(0, i).join(" "); + checkPrefix(prefix, true); + if (!scopeObj[prefix]) + scopeObj[prefix] = { + preventDefault: true, + commands: [(view) => { + let ourObj = storedPrefix = { view, prefix, scope }; + setTimeout(() => { if (storedPrefix == ourObj) + storedPrefix = null; }, PrefixTimeout); + return true; + }] + }; + } + let full = parts.join(" "); + checkPrefix(full, false); + let binding = scopeObj[full] || (scopeObj[full] = { preventDefault: false, commands: [] }); + binding.commands.push(command); + if (preventDefault) + binding.preventDefault = true; + }; + for (let b of bindings) { + let name = b[platform] || b.key; + if (!name) + continue; + for (let scope of b.scope ? b.scope.split(" ") : ["editor"]) { + add(scope, name, b.run, b.preventDefault); + if (b.shift) + add(scope, "Shift-" + name, b.shift, b.preventDefault); + } + } + return bound; +} +function runHandlers(map, event, view, scope) { + let name = w3cKeyname.keyName(event), isChar = name.length == 1 && name != " "; + let prefix = "", fallthrough = false; + if (storedPrefix && storedPrefix.view == view && storedPrefix.scope == scope) { + prefix = storedPrefix.prefix + " "; + if (fallthrough = modifierCodes.indexOf(event.keyCode) < 0) + storedPrefix = null; + } + let runFor = (binding) => { + if (binding) { + for (let cmd of binding.commands) + if (cmd(view)) + return true; + if (binding.preventDefault) + fallthrough = true; + } + return false; + }; + let scopeObj = map[scope], baseName; + if (scopeObj) { + if (runFor(scopeObj[prefix + modifiers(name, event, !isChar)])) + return true; + if (isChar && (event.shiftKey || event.altKey || event.metaKey) && + (baseName = w3cKeyname.base[event.keyCode]) && baseName != name) { + if (runFor(scopeObj[prefix + modifiers(baseName, event, true)])) + return true; + } + else if (isChar && event.shiftKey) { + if (runFor(scopeObj[prefix + modifiers(name, event, true)])) + return true; + } + } + return fallthrough; +} + +const CanHidePrimary = !browser.ios; // FIXME test IE +const selectionConfig = state.Facet.define({ + combine(configs) { + return state.combineConfig(configs, { + cursorBlinkRate: 1200, + drawRangeCursor: true + }, { + cursorBlinkRate: (a, b) => Math.min(a, b), + drawRangeCursor: (a, b) => a || b + }); + } +}); +/** +Returns an extension that hides the browser's native selection and +cursor, replacing the selection with a background behind the text +(with the `cm-selectionBackground` class), and the +cursors with elements overlaid over the code (using +`cm-cursor-primary` and `cm-cursor-secondary`). + +This allows the editor to display secondary selection ranges, and +tends to produce a type of selection more in line with that users +expect in a text editor (the native selection styling will often +leave gaps between lines and won't fill the horizontal space after +a line when the selection continues past it). + +It does have a performance cost, in that it requires an extra DOM +layout cycle for many updates (the selection is drawn based on DOM +layout information that's only available after laying out the +content). +*/ +function drawSelection(config = {}) { + return [ + selectionConfig.of(config), + drawSelectionPlugin, + hideNativeSelection + ]; +} +class Piece { + constructor(left, top, width, height, className) { + this.left = left; + this.top = top; + this.width = width; + this.height = height; + this.className = className; + } + draw() { + let elt = document.createElement("div"); + elt.className = this.className; + this.adjust(elt); + return elt; + } + adjust(elt) { + elt.style.left = this.left + "px"; + elt.style.top = this.top + "px"; + if (this.width >= 0) + elt.style.width = this.width + "px"; + elt.style.height = this.height + "px"; + } + eq(p) { + return this.left == p.left && this.top == p.top && this.width == p.width && this.height == p.height && + this.className == p.className; + } +} +const drawSelectionPlugin = ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.rangePieces = []; + this.cursors = []; + this.measureReq = { read: this.readPos.bind(this), write: this.drawSel.bind(this) }; + this.selectionLayer = view.scrollDOM.appendChild(document.createElement("div")); + this.selectionLayer.className = "cm-selectionLayer"; + this.selectionLayer.setAttribute("aria-hidden", "true"); + this.cursorLayer = view.scrollDOM.appendChild(document.createElement("div")); + this.cursorLayer.className = "cm-cursorLayer"; + this.cursorLayer.setAttribute("aria-hidden", "true"); + view.requestMeasure(this.measureReq); + this.setBlinkRate(); + } + setBlinkRate() { + this.cursorLayer.style.animationDuration = this.view.state.facet(selectionConfig).cursorBlinkRate + "ms"; + } + update(update) { + let confChanged = update.startState.facet(selectionConfig) != update.state.facet(selectionConfig); + if (confChanged || update.selectionSet || update.geometryChanged || update.viewportChanged) + this.view.requestMeasure(this.measureReq); + if (update.transactions.some(tr => tr.scrollIntoView)) + this.cursorLayer.style.animationName = this.cursorLayer.style.animationName == "cm-blink" ? "cm-blink2" : "cm-blink"; + if (confChanged) + this.setBlinkRate(); + } + readPos() { + let { state } = this.view, conf = state.facet(selectionConfig); + let rangePieces = state.selection.ranges.map(r => r.empty ? [] : measureRange(this.view, r)).reduce((a, b) => a.concat(b)); + let cursors = []; + for (let r of state.selection.ranges) { + let prim = r == state.selection.main; + if (r.empty ? !prim || CanHidePrimary : conf.drawRangeCursor) { + let piece = measureCursor(this.view, r, prim); + if (piece) + cursors.push(piece); + } + } + return { rangePieces, cursors }; + } + drawSel({ rangePieces, cursors }) { + if (rangePieces.length != this.rangePieces.length || rangePieces.some((p, i) => !p.eq(this.rangePieces[i]))) { + this.selectionLayer.textContent = ""; + for (let p of rangePieces) + this.selectionLayer.appendChild(p.draw()); + this.rangePieces = rangePieces; + } + if (cursors.length != this.cursors.length || cursors.some((c, i) => !c.eq(this.cursors[i]))) { + let oldCursors = this.cursorLayer.children; + if (oldCursors.length !== cursors.length) { + this.cursorLayer.textContent = ""; + for (const c of cursors) + this.cursorLayer.appendChild(c.draw()); + } + else { + cursors.forEach((c, idx) => c.adjust(oldCursors[idx])); + } + this.cursors = cursors; + } + } + destroy() { + this.selectionLayer.remove(); + this.cursorLayer.remove(); + } +}); +const themeSpec = { + ".cm-line": { + "& ::selection": { backgroundColor: "transparent !important" }, + "&::selection": { backgroundColor: "transparent !important" } + } +}; +if (CanHidePrimary) + themeSpec[".cm-line"].caretColor = "transparent !important"; +const hideNativeSelection = state.Prec.highest(EditorView.theme(themeSpec)); +function getBase(view) { + let rect = view.scrollDOM.getBoundingClientRect(); + let left = view.textDirection == exports.Direction.LTR ? rect.left : rect.right - view.scrollDOM.clientWidth; + return { left: left - view.scrollDOM.scrollLeft, top: rect.top - view.scrollDOM.scrollTop }; +} +function wrappedLine(view, pos, inside) { + let range = state.EditorSelection.cursor(pos); + return { from: Math.max(inside.from, view.moveToLineBoundary(range, false, true).from), + to: Math.min(inside.to, view.moveToLineBoundary(range, true, true).from), + type: exports.BlockType.Text }; +} +function blockAt(view, pos) { + let line = view.lineBlockAt(pos); + if (Array.isArray(line.type)) + for (let l of line.type) { + if (l.to > pos || l.to == pos && (l.to == line.to || l.type == exports.BlockType.Text)) + return l; + } + return line; +} +function measureRange(view, range) { + if (range.to <= view.viewport.from || range.from >= view.viewport.to) + return []; + let from = Math.max(range.from, view.viewport.from), to = Math.min(range.to, view.viewport.to); + let ltr = view.textDirection == exports.Direction.LTR; + let content = view.contentDOM, contentRect = content.getBoundingClientRect(), base = getBase(view); + let lineStyle = window.getComputedStyle(content.firstChild); + let leftSide = contentRect.left + parseInt(lineStyle.paddingLeft) + Math.min(0, parseInt(lineStyle.textIndent)); + let rightSide = contentRect.right - parseInt(lineStyle.paddingRight); + let startBlock = blockAt(view, from), endBlock = blockAt(view, to); + let visualStart = startBlock.type == exports.BlockType.Text ? startBlock : null; + let visualEnd = endBlock.type == exports.BlockType.Text ? endBlock : null; + if (view.lineWrapping) { + if (visualStart) + visualStart = wrappedLine(view, from, visualStart); + if (visualEnd) + visualEnd = wrappedLine(view, to, visualEnd); + } + if (visualStart && visualEnd && visualStart.from == visualEnd.from) { + return pieces(drawForLine(range.from, range.to, visualStart)); + } + else { + let top = visualStart ? drawForLine(range.from, null, visualStart) : drawForWidget(startBlock, false); + let bottom = visualEnd ? drawForLine(null, range.to, visualEnd) : drawForWidget(endBlock, true); + let between = []; + if ((visualStart || startBlock).to < (visualEnd || endBlock).from - 1) + between.push(piece(leftSide, top.bottom, rightSide, bottom.top)); + else if (top.bottom < bottom.top && view.elementAtHeight((top.bottom + bottom.top) / 2).type == exports.BlockType.Text) + top.bottom = bottom.top = (top.bottom + bottom.top) / 2; + return pieces(top).concat(between).concat(pieces(bottom)); + } + function piece(left, top, right, bottom) { + return new Piece(left - base.left, top - base.top - 0.01 /* Epsilon */, right - left, bottom - top + 0.01 /* Epsilon */, "cm-selectionBackground"); + } + function pieces({ top, bottom, horizontal }) { + let pieces = []; + for (let i = 0; i < horizontal.length; i += 2) + pieces.push(piece(horizontal[i], top, horizontal[i + 1], bottom)); + return pieces; + } + // Gets passed from/to in line-local positions + function drawForLine(from, to, line) { + let top = 1e9, bottom = -1e9, horizontal = []; + function addSpan(from, fromOpen, to, toOpen, dir) { + // Passing 2/-2 is a kludge to force the view to return + // coordinates on the proper side of block widgets, since + // normalizing the side there, though appropriate for most + // coordsAtPos queries, would break selection drawing. + let fromCoords = view.coordsAtPos(from, (from == line.to ? -2 : 2)); + let toCoords = view.coordsAtPos(to, (to == line.from ? 2 : -2)); + top = Math.min(fromCoords.top, toCoords.top, top); + bottom = Math.max(fromCoords.bottom, toCoords.bottom, bottom); + if (dir == exports.Direction.LTR) + horizontal.push(ltr && fromOpen ? leftSide : fromCoords.left, ltr && toOpen ? rightSide : toCoords.right); + else + horizontal.push(!ltr && toOpen ? leftSide : toCoords.left, !ltr && fromOpen ? rightSide : fromCoords.right); + } + let start = from !== null && from !== void 0 ? from : line.from, end = to !== null && to !== void 0 ? to : line.to; + // Split the range by visible range and document line + for (let r of view.visibleRanges) + if (r.to > start && r.from < end) { + for (let pos = Math.max(r.from, start), endPos = Math.min(r.to, end);;) { + let docLine = view.state.doc.lineAt(pos); + for (let span of view.bidiSpans(docLine)) { + let spanFrom = span.from + docLine.from, spanTo = span.to + docLine.from; + if (spanFrom >= endPos) + break; + if (spanTo > pos) + addSpan(Math.max(spanFrom, pos), from == null && spanFrom <= start, Math.min(spanTo, endPos), to == null && spanTo >= end, span.dir); + } + pos = docLine.to + 1; + if (pos >= endPos) + break; + } + } + if (horizontal.length == 0) + addSpan(start, from == null, end, to == null, view.textDirection); + return { top, bottom, horizontal }; + } + function drawForWidget(block, top) { + let y = contentRect.top + (top ? block.top : block.bottom); + return { top: y, bottom: y, horizontal: [] }; + } +} +function measureCursor(view, cursor, primary) { + let pos = view.coordsAtPos(cursor.head, cursor.assoc || 1); + if (!pos) + return null; + let base = getBase(view); + return new Piece(pos.left - base.left, pos.top - base.top, -1, pos.bottom - pos.top, primary ? "cm-cursor cm-cursor-primary" : "cm-cursor cm-cursor-secondary"); +} + +const setDropCursorPos = state.StateEffect.define({ + map(pos, mapping) { return pos == null ? null : mapping.mapPos(pos); } +}); +const dropCursorPos = state.StateField.define({ + create() { return null; }, + update(pos, tr) { + if (pos != null) + pos = tr.changes.mapPos(pos); + return tr.effects.reduce((pos, e) => e.is(setDropCursorPos) ? e.value : pos, pos); + } +}); +const drawDropCursor = ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.cursor = null; + this.measureReq = { read: this.readPos.bind(this), write: this.drawCursor.bind(this) }; + } + update(update) { + var _a; + let cursorPos = update.state.field(dropCursorPos); + if (cursorPos == null) { + if (this.cursor != null) { + (_a = this.cursor) === null || _a === void 0 ? void 0 : _a.remove(); + this.cursor = null; + } + } + else { + if (!this.cursor) { + this.cursor = this.view.scrollDOM.appendChild(document.createElement("div")); + this.cursor.className = "cm-dropCursor"; + } + if (update.startState.field(dropCursorPos) != cursorPos || update.docChanged || update.geometryChanged) + this.view.requestMeasure(this.measureReq); + } + } + readPos() { + let pos = this.view.state.field(dropCursorPos); + let rect = pos != null && this.view.coordsAtPos(pos); + if (!rect) + return null; + let outer = this.view.scrollDOM.getBoundingClientRect(); + return { + left: rect.left - outer.left + this.view.scrollDOM.scrollLeft, + top: rect.top - outer.top + this.view.scrollDOM.scrollTop, + height: rect.bottom - rect.top + }; + } + drawCursor(pos) { + if (this.cursor) { + if (pos) { + this.cursor.style.left = pos.left + "px"; + this.cursor.style.top = pos.top + "px"; + this.cursor.style.height = pos.height + "px"; + } + else { + this.cursor.style.left = "-100000px"; + } + } + } + destroy() { + if (this.cursor) + this.cursor.remove(); + } + setDropPos(pos) { + if (this.view.state.field(dropCursorPos) != pos) + this.view.dispatch({ effects: setDropCursorPos.of(pos) }); + } +}, { + eventHandlers: { + dragover(event) { + this.setDropPos(this.view.posAtCoords({ x: event.clientX, y: event.clientY })); + }, + dragleave(event) { + if (event.target == this.view.contentDOM || !this.view.contentDOM.contains(event.relatedTarget)) + this.setDropPos(null); + }, + dragend() { + this.setDropPos(null); + }, + drop() { + this.setDropPos(null); + } + } +}); +/** +Draws a cursor at the current drop position when something is +dragged over the editor. +*/ +function dropCursor() { + return [dropCursorPos, drawDropCursor]; +} + +function iterMatches(doc, re, from, to, f) { + re.lastIndex = 0; + for (let cursor = doc.iterRange(from, to), pos = from, m; !cursor.next().done; pos += cursor.value.length) { + if (!cursor.lineBreak) + while (m = re.exec(cursor.value)) + f(pos + m.index, pos + m.index + m[0].length, m); + } +} +function matchRanges(view, maxLength) { + let visible = view.visibleRanges; + if (visible.length == 1 && visible[0].from == view.viewport.from && + visible[0].to == view.viewport.to) + return visible; + let result = []; + for (let { from, to } of visible) { + from = Math.max(view.state.doc.lineAt(from).from, from - maxLength); + to = Math.min(view.state.doc.lineAt(to).to, to + maxLength); + if (result.length && result[result.length - 1].to >= from) + result[result.length - 1].to = to; + else + result.push({ from, to }); + } + return result; +} +/** +Helper class used to make it easier to maintain decorations on +visible code that matches a given regular expression. To be used +in a [view plugin](https://codemirror.net/6/docs/ref/#view.ViewPlugin). Instances of this object +represent a matching configuration. +*/ +class MatchDecorator { + /** + Create a decorator. + */ + constructor(config) { + let { regexp, decoration, boundary, maxLength = 1000 } = config; + if (!regexp.global) + throw new RangeError("The regular expression given to MatchDecorator should have its 'g' flag set"); + this.regexp = regexp; + this.getDeco = typeof decoration == "function" ? decoration : () => decoration; + this.boundary = boundary; + this.maxLength = maxLength; + } + /** + Compute the full set of decorations for matches in the given + view's viewport. You'll want to call this when initializing your + plugin. + */ + createDeco(view) { + let build = new state.RangeSetBuilder(); + for (let { from, to } of matchRanges(view, this.maxLength)) + iterMatches(view.state.doc, this.regexp, from, to, (a, b, m) => build.add(a, b, this.getDeco(m, view, a))); + return build.finish(); + } + /** + Update a set of decorations for a view update. `deco` _must_ be + the set of decorations produced by _this_ `MatchDecorator` for + the view state before the update. + */ + updateDeco(update, deco) { + let changeFrom = 1e9, changeTo = -1; + if (update.docChanged) + update.changes.iterChanges((_f, _t, from, to) => { + if (to > update.view.viewport.from && from < update.view.viewport.to) { + changeFrom = Math.min(from, changeFrom); + changeTo = Math.max(to, changeTo); + } + }); + if (update.viewportChanged || changeTo - changeFrom > 1000) + return this.createDeco(update.view); + if (changeTo > -1) + return this.updateRange(update.view, deco.map(update.changes), changeFrom, changeTo); + return deco; + } + updateRange(view, deco, updateFrom, updateTo) { + for (let r of view.visibleRanges) { + let from = Math.max(r.from, updateFrom), to = Math.min(r.to, updateTo); + if (to > from) { + let fromLine = view.state.doc.lineAt(from), toLine = fromLine.to < to ? view.state.doc.lineAt(to) : fromLine; + let start = Math.max(r.from, fromLine.from), end = Math.min(r.to, toLine.to); + if (this.boundary) { + for (; from > fromLine.from; from--) + if (this.boundary.test(fromLine.text[from - 1 - fromLine.from])) { + start = from; + break; + } + for (; to < toLine.to; to++) + if (this.boundary.test(toLine.text[to - toLine.from])) { + end = to; + break; + } + } + let ranges = [], m; + if (fromLine == toLine) { + this.regexp.lastIndex = start - fromLine.from; + while ((m = this.regexp.exec(fromLine.text)) && m.index < end - fromLine.from) { + let pos = m.index + fromLine.from; + ranges.push(this.getDeco(m, view, pos).range(pos, pos + m[0].length)); + } + } + else { + iterMatches(view.state.doc, this.regexp, start, end, (from, to, m) => ranges.push(this.getDeco(m, view, from).range(from, to))); + } + deco = deco.update({ filterFrom: start, filterTo: end, filter: (from, to) => from < start || to > end, add: ranges }); + } + } + return deco; + } +} + +const UnicodeRegexpSupport = /x/.unicode != null ? "gu" : "g"; +const Specials = new RegExp("[\u0000-\u0008\u000a-\u001f\u007f-\u009f\u00ad\u061c\u200b\u200e\u200f\u2028\u2029\u202d\u202e\ufeff\ufff9-\ufffc]", UnicodeRegexpSupport); +const Names = { + 0: "null", + 7: "bell", + 8: "backspace", + 10: "newline", + 11: "vertical tab", + 13: "carriage return", + 27: "escape", + 8203: "zero width space", + 8204: "zero width non-joiner", + 8205: "zero width joiner", + 8206: "left-to-right mark", + 8207: "right-to-left mark", + 8232: "line separator", + 8237: "left-to-right override", + 8238: "right-to-left override", + 8233: "paragraph separator", + 65279: "zero width no-break space", + 65532: "object replacement" +}; +let _supportsTabSize = null; +function supportsTabSize() { + var _a; + if (_supportsTabSize == null && typeof document != "undefined" && document.body) { + let styles = document.body.style; + _supportsTabSize = ((_a = styles.tabSize) !== null && _a !== void 0 ? _a : styles.MozTabSize) != null; + } + return _supportsTabSize || false; +} +const specialCharConfig = state.Facet.define({ + combine(configs) { + let config = state.combineConfig(configs, { + render: null, + specialChars: Specials, + addSpecialChars: null + }); + if (config.replaceTabs = !supportsTabSize()) + config.specialChars = new RegExp("\t|" + config.specialChars.source, UnicodeRegexpSupport); + if (config.addSpecialChars) + config.specialChars = new RegExp(config.specialChars.source + "|" + config.addSpecialChars.source, UnicodeRegexpSupport); + return config; + } +}); +/** +Returns an extension that installs highlighting of special +characters. +*/ +function highlightSpecialChars( +/** +Configuration options. +*/ +config = {}) { + return [specialCharConfig.of(config), specialCharPlugin()]; +} +let _plugin = null; +function specialCharPlugin() { + return _plugin || (_plugin = ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.decorations = Decoration.none; + this.decorationCache = Object.create(null); + this.decorator = this.makeDecorator(view.state.facet(specialCharConfig)); + this.decorations = this.decorator.createDeco(view); + } + makeDecorator(conf) { + return new MatchDecorator({ + regexp: conf.specialChars, + decoration: (m, view, pos) => { + let { doc } = view.state; + let code = state.codePointAt(m[0], 0); + if (code == 9) { + let line = doc.lineAt(pos); + let size = view.state.tabSize, col = state.countColumn(line.text, size, pos - line.from); + return Decoration.replace({ widget: new TabWidget((size - (col % size)) * this.view.defaultCharacterWidth) }); + } + return this.decorationCache[code] || + (this.decorationCache[code] = Decoration.replace({ widget: new SpecialCharWidget(conf, code) })); + }, + boundary: conf.replaceTabs ? undefined : /[^]/ + }); + } + update(update) { + let conf = update.state.facet(specialCharConfig); + if (update.startState.facet(specialCharConfig) != conf) { + this.decorator = this.makeDecorator(conf); + this.decorations = this.decorator.createDeco(update.view); + } + else { + this.decorations = this.decorator.updateDeco(update, this.decorations); + } + } + }, { + decorations: v => v.decorations + })); +} +const DefaultPlaceholder = "\u2022"; +// Assigns placeholder characters from the Control Pictures block to +// ASCII control characters +function placeholder$1(code) { + if (code >= 32) + return DefaultPlaceholder; + if (code == 10) + return "\u2424"; + return String.fromCharCode(9216 + code); +} +class SpecialCharWidget extends WidgetType { + constructor(options, code) { + super(); + this.options = options; + this.code = code; + } + eq(other) { return other.code == this.code; } + toDOM(view) { + let ph = placeholder$1(this.code); + let desc = view.state.phrase("Control character") + " " + (Names[this.code] || "0x" + this.code.toString(16)); + let custom = this.options.render && this.options.render(this.code, desc, ph); + if (custom) + return custom; + let span = document.createElement("span"); + span.textContent = ph; + span.title = desc; + span.setAttribute("aria-label", desc); + span.className = "cm-specialChar"; + return span; + } + ignoreEvent() { return false; } +} +class TabWidget extends WidgetType { + constructor(width) { + super(); + this.width = width; + } + eq(other) { return other.width == this.width; } + toDOM() { + let span = document.createElement("span"); + span.textContent = "\t"; + span.className = "cm-tab"; + span.style.width = this.width + "px"; + return span; + } + ignoreEvent() { return false; } +} + +const plugin = ViewPlugin.fromClass(class { + constructor() { + this.height = 1000; + this.attrs = { style: "padding-bottom: 1000px" }; + } + update(update) { + let height = update.view.viewState.editorHeight - update.view.defaultLineHeight; + if (height != this.height) { + this.height = height; + this.attrs = { style: `padding-bottom: ${height}px` }; + } + } +}); +/** +Returns an extension that makes sure the content has a bottom +margin equivalent to the height of the editor, minus one line +height, so that every line in the document can be scrolled to the +top of the editor. + +This is only meaningful when the editor is scrollable, and should +not be enabled in editors that take the size of their content. +*/ +function scrollPastEnd() { + return [plugin, contentAttributes.of(view => { var _a; return ((_a = view.plugin(plugin)) === null || _a === void 0 ? void 0 : _a.attrs) || null; })]; +} + +/** +Mark lines that have a cursor on them with the `"cm-activeLine"` +DOM class. +*/ +function highlightActiveLine() { + return activeLineHighlighter; +} +const lineDeco = Decoration.line({ class: "cm-activeLine" }); +const activeLineHighlighter = ViewPlugin.fromClass(class { + constructor(view) { + this.decorations = this.getDeco(view); + } + update(update) { + if (update.docChanged || update.selectionSet) + this.decorations = this.getDeco(update.view); + } + getDeco(view) { + let lastLineStart = -1, deco = []; + for (let r of view.state.selection.ranges) { + if (!r.empty) + return Decoration.none; + let line = view.lineBlockAt(r.head); + if (line.from > lastLineStart) { + deco.push(lineDeco.range(line.from)); + lastLineStart = line.from; + } + } + return Decoration.set(deco); + } +}, { + decorations: v => v.decorations +}); + +class Placeholder extends WidgetType { + constructor(content) { + super(); + this.content = content; + } + toDOM() { + let wrap = document.createElement("span"); + wrap.className = "cm-placeholder"; + wrap.style.pointerEvents = "none"; + wrap.appendChild(typeof this.content == "string" ? document.createTextNode(this.content) : this.content); + if (typeof this.content == "string") + wrap.setAttribute("aria-label", "placeholder " + this.content); + else + wrap.setAttribute("aria-hidden", "true"); + return wrap; + } + ignoreEvent() { return false; } +} +/** +Extension that enables a placeholder—a piece of example content +to show when the editor is empty. +*/ +function placeholder(content) { + return ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.placeholder = Decoration.set([Decoration.widget({ widget: new Placeholder(content), side: 1 }).range(0)]); + } + get decorations() { return this.view.state.doc.length ? Decoration.none : this.placeholder; } + }, { decorations: v => v.decorations }); +} + +// Don't compute precise column positions for line offsets above this +// (since it could get expensive). Assume offset==column for them. +const MaxOff = 2000; +function rectangleFor(state$1, a, b) { + let startLine = Math.min(a.line, b.line), endLine = Math.max(a.line, b.line); + let ranges = []; + if (a.off > MaxOff || b.off > MaxOff || a.col < 0 || b.col < 0) { + let startOff = Math.min(a.off, b.off), endOff = Math.max(a.off, b.off); + for (let i = startLine; i <= endLine; i++) { + let line = state$1.doc.line(i); + if (line.length <= endOff) + ranges.push(state.EditorSelection.range(line.from + startOff, line.to + endOff)); + } + } + else { + let startCol = Math.min(a.col, b.col), endCol = Math.max(a.col, b.col); + for (let i = startLine; i <= endLine; i++) { + let line = state$1.doc.line(i); + let start = state.findColumn(line.text, startCol, state$1.tabSize, true); + if (start > -1) { + let end = state.findColumn(line.text, endCol, state$1.tabSize); + ranges.push(state.EditorSelection.range(line.from + start, line.from + end)); + } + } + } + return ranges; +} +function absoluteColumn(view, x) { + let ref = view.coordsAtPos(view.viewport.from); + return ref ? Math.round(Math.abs((ref.left - x) / view.defaultCharacterWidth)) : -1; +} +function getPos(view, event) { + let offset = view.posAtCoords({ x: event.clientX, y: event.clientY }, false); + let line = view.state.doc.lineAt(offset), off = offset - line.from; + let col = off > MaxOff ? -1 + : off == line.length ? absoluteColumn(view, event.clientX) + : state.countColumn(line.text, view.state.tabSize, offset - line.from); + return { line: line.number, col, off }; +} +function rectangleSelectionStyle(view, event) { + let start = getPos(view, event), startSel = view.state.selection; + if (!start) + return null; + return { + update(update) { + if (update.docChanged) { + let newStart = update.changes.mapPos(update.startState.doc.line(start.line).from); + let newLine = update.state.doc.lineAt(newStart); + start = { line: newLine.number, col: start.col, off: Math.min(start.off, newLine.length) }; + startSel = startSel.map(update.changes); + } + }, + get(event, _extend, multiple) { + let cur = getPos(view, event); + if (!cur) + return startSel; + let ranges = rectangleFor(view.state, start, cur); + if (!ranges.length) + return startSel; + if (multiple) + return state.EditorSelection.create(ranges.concat(startSel.ranges)); + else + return state.EditorSelection.create(ranges); + } + }; +} +/** +Create an extension that enables rectangular selections. By +default, it will react to left mouse drag with the Alt key held +down. When such a selection occurs, the text within the rectangle +that was dragged over will be selected, as one selection +[range](https://codemirror.net/6/docs/ref/#state.SelectionRange) per line. +*/ +function rectangularSelection(options) { + let filter = (options === null || options === void 0 ? void 0 : options.eventFilter) || (e => e.altKey && e.button == 0); + return EditorView.mouseSelectionStyle.of((view, event) => filter(event) ? rectangleSelectionStyle(view, event) : null); +} +const keys = { + Alt: [18, e => e.altKey], + Control: [17, e => e.ctrlKey], + Shift: [16, e => e.shiftKey], + Meta: [91, e => e.metaKey] +}; +const showCrosshair = { style: "cursor: crosshair" }; +/** +Returns an extension that turns the pointer cursor into a +crosshair when a given modifier key, defaulting to Alt, is held +down. Can serve as a visual hint that rectangular selection is +going to happen when paired with +[`rectangularSelection`](https://codemirror.net/6/docs/ref/#view.rectangularSelection). +*/ +function crosshairCursor(options = {}) { + let [code, getter] = keys[options.key || "Alt"]; + let plugin = ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.isDown = false; + } + set(isDown) { + if (this.isDown != isDown) { + this.isDown = isDown; + this.view.update([]); + } + } + }, { + eventHandlers: { + keydown(e) { + this.set(e.keyCode == code || getter(e)); + }, + keyup(e) { + if (e.keyCode == code || !getter(e)) + this.set(false); + } + } + }); + return [ + plugin, + EditorView.contentAttributes.of(view => { var _a; return ((_a = view.plugin(plugin)) === null || _a === void 0 ? void 0 : _a.isDown) ? showCrosshair : null; }) + ]; +} + +const Outside = "-10000px"; +class TooltipViewManager { + constructor(view, facet, createTooltipView) { + this.facet = facet; + this.createTooltipView = createTooltipView; + this.input = view.state.facet(facet); + this.tooltips = this.input.filter(t => t); + this.tooltipViews = this.tooltips.map(createTooltipView); + } + update(update) { + let input = update.state.facet(this.facet); + let tooltips = input.filter(x => x); + if (input === this.input) { + for (let t of this.tooltipViews) + if (t.update) + t.update(update); + return false; + } + let tooltipViews = []; + for (let i = 0; i < tooltips.length; i++) { + let tip = tooltips[i], known = -1; + if (!tip) + continue; + for (let i = 0; i < this.tooltips.length; i++) { + let other = this.tooltips[i]; + if (other && other.create == tip.create) + known = i; + } + if (known < 0) { + tooltipViews[i] = this.createTooltipView(tip); + } + else { + let tooltipView = tooltipViews[i] = this.tooltipViews[known]; + if (tooltipView.update) + tooltipView.update(update); + } + } + for (let t of this.tooltipViews) + if (tooltipViews.indexOf(t) < 0) + t.dom.remove(); + this.input = input; + this.tooltips = tooltips; + this.tooltipViews = tooltipViews; + return true; + } +} +/** +Creates an extension that configures tooltip behavior. +*/ +function tooltips(config = {}) { + return tooltipConfig.of(config); +} +function windowSpace() { + return { top: 0, left: 0, bottom: innerHeight, right: innerWidth }; +} +const tooltipConfig = state.Facet.define({ + combine: values => { + var _a, _b, _c; + return ({ + position: browser.ios ? "absolute" : ((_a = values.find(conf => conf.position)) === null || _a === void 0 ? void 0 : _a.position) || "fixed", + parent: ((_b = values.find(conf => conf.parent)) === null || _b === void 0 ? void 0 : _b.parent) || null, + tooltipSpace: ((_c = values.find(conf => conf.tooltipSpace)) === null || _c === void 0 ? void 0 : _c.tooltipSpace) || windowSpace, + }); + } +}); +const tooltipPlugin = ViewPlugin.fromClass(class { + constructor(view) { + var _a; + this.view = view; + this.inView = true; + this.lastTransaction = 0; + this.measureTimeout = -1; + let config = view.state.facet(tooltipConfig); + this.position = config.position; + this.parent = config.parent; + this.classes = view.themeClasses; + this.createContainer(); + this.measureReq = { read: this.readMeasure.bind(this), write: this.writeMeasure.bind(this), key: this }; + this.manager = new TooltipViewManager(view, showTooltip, t => this.createTooltip(t)); + this.intersectionObserver = typeof IntersectionObserver == "function" ? new IntersectionObserver(entries => { + if (Date.now() > this.lastTransaction - 50 && + entries.length > 0 && entries[entries.length - 1].intersectionRatio < 1) + this.measureSoon(); + }, { threshold: [1] }) : null; + this.observeIntersection(); + (_a = view.dom.ownerDocument.defaultView) === null || _a === void 0 ? void 0 : _a.addEventListener("resize", this.measureSoon = this.measureSoon.bind(this)); + this.maybeMeasure(); + } + createContainer() { + if (this.parent) { + this.container = document.createElement("div"); + this.container.style.position = "relative"; + this.container.className = this.view.themeClasses; + this.parent.appendChild(this.container); + } + else { + this.container = this.view.dom; + } + } + observeIntersection() { + if (this.intersectionObserver) { + this.intersectionObserver.disconnect(); + for (let tooltip of this.manager.tooltipViews) + this.intersectionObserver.observe(tooltip.dom); + } + } + measureSoon() { + if (this.measureTimeout < 0) + this.measureTimeout = setTimeout(() => { + this.measureTimeout = -1; + this.maybeMeasure(); + }, 50); + } + update(update) { + if (update.transactions.length) + this.lastTransaction = Date.now(); + let updated = this.manager.update(update); + if (updated) + this.observeIntersection(); + let shouldMeasure = updated || update.geometryChanged; + let newConfig = update.state.facet(tooltipConfig); + if (newConfig.position != this.position) { + this.position = newConfig.position; + for (let t of this.manager.tooltipViews) + t.dom.style.position = this.position; + shouldMeasure = true; + } + if (newConfig.parent != this.parent) { + if (this.parent) + this.container.remove(); + this.parent = newConfig.parent; + this.createContainer(); + for (let t of this.manager.tooltipViews) + this.container.appendChild(t.dom); + shouldMeasure = true; + } + else if (this.parent && this.view.themeClasses != this.classes) { + this.classes = this.container.className = this.view.themeClasses; + } + if (shouldMeasure) + this.maybeMeasure(); + } + createTooltip(tooltip) { + let tooltipView = tooltip.create(this.view); + tooltipView.dom.classList.add("cm-tooltip"); + if (tooltip.arrow && !tooltipView.dom.querySelector(".cm-tooltip > .cm-tooltip-arrow")) { + let arrow = document.createElement("div"); + arrow.className = "cm-tooltip-arrow"; + tooltipView.dom.appendChild(arrow); + } + tooltipView.dom.style.position = this.position; + tooltipView.dom.style.top = Outside; + this.container.appendChild(tooltipView.dom); + if (tooltipView.mount) + tooltipView.mount(this.view); + return tooltipView; + } + destroy() { + var _a, _b; + (_a = this.view.dom.ownerDocument.defaultView) === null || _a === void 0 ? void 0 : _a.removeEventListener("resize", this.measureSoon); + for (let { dom } of this.manager.tooltipViews) + dom.remove(); + (_b = this.intersectionObserver) === null || _b === void 0 ? void 0 : _b.disconnect(); + clearTimeout(this.measureTimeout); + } + readMeasure() { + let editor = this.view.dom.getBoundingClientRect(); + return { + editor, + parent: this.parent ? this.container.getBoundingClientRect() : editor, + pos: this.manager.tooltips.map((t, i) => { + let tv = this.manager.tooltipViews[i]; + return tv.getCoords ? tv.getCoords(t.pos) : this.view.coordsAtPos(t.pos); + }), + size: this.manager.tooltipViews.map(({ dom }) => dom.getBoundingClientRect()), + space: this.view.state.facet(tooltipConfig).tooltipSpace(this.view), + }; + } + writeMeasure(measured) { + let { editor, space } = measured; + let others = []; + for (let i = 0; i < this.manager.tooltips.length; i++) { + let tooltip = this.manager.tooltips[i], tView = this.manager.tooltipViews[i], { dom } = tView; + let pos = measured.pos[i], size = measured.size[i]; + // Hide tooltips that are outside of the editor. + if (!pos || pos.bottom <= Math.max(editor.top, space.top) || + pos.top >= Math.min(editor.bottom, space.bottom) || + pos.right < Math.max(editor.left, space.left) - .1 || + pos.left > Math.min(editor.right, space.right) + .1) { + dom.style.top = Outside; + continue; + } + let arrow = tooltip.arrow ? tView.dom.querySelector(".cm-tooltip-arrow") : null; + let arrowHeight = arrow ? 7 /* Size */ : 0; + let width = size.right - size.left, height = size.bottom - size.top; + let offset = tView.offset || noOffset, ltr = this.view.textDirection == exports.Direction.LTR; + let left = size.width > space.right - space.left ? (ltr ? space.left : space.right - size.width) + : ltr ? Math.min(pos.left - (arrow ? 14 /* Offset */ : 0) + offset.x, space.right - width) + : Math.max(space.left, pos.left - width + (arrow ? 14 /* Offset */ : 0) - offset.x); + let above = !!tooltip.above; + if (!tooltip.strictSide && (above + ? pos.top - (size.bottom - size.top) - offset.y < space.top + : pos.bottom + (size.bottom - size.top) + offset.y > space.bottom) && + above == (space.bottom - pos.bottom > pos.top - space.top)) + above = !above; + let top = above ? pos.top - height - arrowHeight - offset.y : pos.bottom + arrowHeight + offset.y; + let right = left + width; + if (tView.overlap !== true) + for (let r of others) + if (r.left < right && r.right > left && r.top < top + height && r.bottom > top) + top = above ? r.top - height - 2 - arrowHeight : r.bottom + arrowHeight + 2; + if (this.position == "absolute") { + dom.style.top = (top - measured.parent.top) + "px"; + dom.style.left = (left - measured.parent.left) + "px"; + } + else { + dom.style.top = top + "px"; + dom.style.left = left + "px"; + } + if (arrow) + arrow.style.left = `${pos.left + (ltr ? offset.x : -offset.x) - (left + 14 /* Offset */ - 7 /* Size */)}px`; + if (tView.overlap !== true) + others.push({ left, top, right, bottom: top + height }); + dom.classList.toggle("cm-tooltip-above", above); + dom.classList.toggle("cm-tooltip-below", !above); + if (tView.positioned) + tView.positioned(); + } + } + maybeMeasure() { + if (this.manager.tooltips.length) { + if (this.view.inView) + this.view.requestMeasure(this.measureReq); + if (this.inView != this.view.inView) { + this.inView = this.view.inView; + if (!this.inView) + for (let tv of this.manager.tooltipViews) + tv.dom.style.top = Outside; + } + } + } +}, { + eventHandlers: { + scroll() { this.maybeMeasure(); } + } +}); +const baseTheme = EditorView.baseTheme({ + ".cm-tooltip": { + zIndex: 100 + }, + "&light .cm-tooltip": { + border: "1px solid #bbb", + backgroundColor: "#f5f5f5" + }, + "&light .cm-tooltip-section:not(:first-child)": { + borderTop: "1px solid #bbb", + }, + "&dark .cm-tooltip": { + backgroundColor: "#333338", + color: "white" + }, + ".cm-tooltip-arrow": { + height: `${7 /* Size */}px`, + width: `${7 /* Size */ * 2}px`, + position: "absolute", + zIndex: -1, + overflow: "hidden", + "&:before, &:after": { + content: "''", + position: "absolute", + width: 0, + height: 0, + borderLeft: `${7 /* Size */}px solid transparent`, + borderRight: `${7 /* Size */}px solid transparent`, + }, + ".cm-tooltip-above &": { + bottom: `-${7 /* Size */}px`, + "&:before": { + borderTop: `${7 /* Size */}px solid #bbb`, + }, + "&:after": { + borderTop: `${7 /* Size */}px solid #f5f5f5`, + bottom: "1px" + } + }, + ".cm-tooltip-below &": { + top: `-${7 /* Size */}px`, + "&:before": { + borderBottom: `${7 /* Size */}px solid #bbb`, + }, + "&:after": { + borderBottom: `${7 /* Size */}px solid #f5f5f5`, + top: "1px" + } + }, + }, + "&dark .cm-tooltip .cm-tooltip-arrow": { + "&:before": { + borderTopColor: "#333338", + borderBottomColor: "#333338" + }, + "&:after": { + borderTopColor: "transparent", + borderBottomColor: "transparent" + } + } +}); +const noOffset = { x: 0, y: 0 }; +/** +Facet to which an extension can add a value to show a tooltip. +*/ +const showTooltip = state.Facet.define({ + enables: [tooltipPlugin, baseTheme] +}); +const showHoverTooltip = state.Facet.define(); +class HoverTooltipHost { + constructor(view) { + this.view = view; + this.mounted = false; + this.dom = document.createElement("div"); + this.dom.classList.add("cm-tooltip-hover"); + this.manager = new TooltipViewManager(view, showHoverTooltip, t => this.createHostedView(t)); + } + // Needs to be static so that host tooltip instances always match + static create(view) { + return new HoverTooltipHost(view); + } + createHostedView(tooltip) { + let hostedView = tooltip.create(this.view); + hostedView.dom.classList.add("cm-tooltip-section"); + this.dom.appendChild(hostedView.dom); + if (this.mounted && hostedView.mount) + hostedView.mount(this.view); + return hostedView; + } + mount(view) { + for (let hostedView of this.manager.tooltipViews) { + if (hostedView.mount) + hostedView.mount(view); + } + this.mounted = true; + } + positioned() { + for (let hostedView of this.manager.tooltipViews) { + if (hostedView.positioned) + hostedView.positioned(); + } + } + update(update) { + this.manager.update(update); + } +} +const showHoverTooltipHost = showTooltip.compute([showHoverTooltip], state => { + let tooltips = state.facet(showHoverTooltip).filter(t => t); + if (tooltips.length === 0) + return null; + return { + pos: Math.min(...tooltips.map(t => t.pos)), + end: Math.max(...tooltips.filter(t => t.end != null).map(t => t.end)), + create: HoverTooltipHost.create, + above: tooltips[0].above, + arrow: tooltips.some(t => t.arrow), + }; +}); +class HoverPlugin { + constructor(view, source, field, setHover, hoverTime) { + this.view = view; + this.source = source; + this.field = field; + this.setHover = setHover; + this.hoverTime = hoverTime; + this.hoverTimeout = -1; + this.restartTimeout = -1; + this.pending = null; + this.lastMove = { x: 0, y: 0, target: view.dom, time: 0 }; + this.checkHover = this.checkHover.bind(this); + view.dom.addEventListener("mouseleave", this.mouseleave = this.mouseleave.bind(this)); + view.dom.addEventListener("mousemove", this.mousemove = this.mousemove.bind(this)); + } + update() { + if (this.pending) { + this.pending = null; + clearTimeout(this.restartTimeout); + this.restartTimeout = setTimeout(() => this.startHover(), 20); + } + } + get active() { + return this.view.state.field(this.field); + } + checkHover() { + this.hoverTimeout = -1; + if (this.active) + return; + let hovered = Date.now() - this.lastMove.time; + if (hovered < this.hoverTime) + this.hoverTimeout = setTimeout(this.checkHover, this.hoverTime - hovered); + else + this.startHover(); + } + startHover() { + clearTimeout(this.restartTimeout); + let { lastMove } = this; + let pos = this.view.contentDOM.contains(lastMove.target) ? this.view.posAtCoords(lastMove) : null; + if (pos == null) + return; + let posCoords = this.view.coordsAtPos(pos); + if (posCoords == null || lastMove.y < posCoords.top || lastMove.y > posCoords.bottom || + lastMove.x < posCoords.left - this.view.defaultCharacterWidth || + lastMove.x > posCoords.right + this.view.defaultCharacterWidth) + return; + let bidi = this.view.bidiSpans(this.view.state.doc.lineAt(pos)).find(s => s.from <= pos && s.to >= pos); + let rtl = bidi && bidi.dir == exports.Direction.RTL ? -1 : 1; + let open = this.source(this.view, pos, (lastMove.x < posCoords.left ? -rtl : rtl)); + if (open === null || open === void 0 ? void 0 : open.then) { + let pending = this.pending = { pos }; + open.then(result => { + if (this.pending == pending) { + this.pending = null; + if (result) + this.view.dispatch({ effects: this.setHover.of(result) }); + } + }, e => logException(this.view.state, e, "hover tooltip")); + } + else if (open) { + this.view.dispatch({ effects: this.setHover.of(open) }); + } + } + mousemove(event) { + var _a; + this.lastMove = { x: event.clientX, y: event.clientY, target: event.target, time: Date.now() }; + if (this.hoverTimeout < 0) + this.hoverTimeout = setTimeout(this.checkHover, this.hoverTime); + let tooltip = this.active; + if (tooltip && !isInTooltip(this.lastMove.target) || this.pending) { + let { pos } = tooltip || this.pending, end = (_a = tooltip === null || tooltip === void 0 ? void 0 : tooltip.end) !== null && _a !== void 0 ? _a : pos; + if ((pos == end ? this.view.posAtCoords(this.lastMove) != pos + : !isOverRange(this.view, pos, end, event.clientX, event.clientY, 6 /* MaxDist */))) { + this.view.dispatch({ effects: this.setHover.of(null) }); + this.pending = null; + } + } + } + mouseleave() { + clearTimeout(this.hoverTimeout); + this.hoverTimeout = -1; + if (this.active) + this.view.dispatch({ effects: this.setHover.of(null) }); + } + destroy() { + clearTimeout(this.hoverTimeout); + this.view.dom.removeEventListener("mouseleave", this.mouseleave); + this.view.dom.removeEventListener("mousemove", this.mousemove); + } +} +function isInTooltip(elt) { + for (let cur = elt; cur; cur = cur.parentNode) + if (cur.nodeType == 1 && cur.classList.contains("cm-tooltip")) + return true; + return false; +} +function isOverRange(view, from, to, x, y, margin) { + let range = document.createRange(); + let fromDOM = view.domAtPos(from), toDOM = view.domAtPos(to); + range.setEnd(toDOM.node, toDOM.offset); + range.setStart(fromDOM.node, fromDOM.offset); + let rects = range.getClientRects(); + range.detach(); + for (let i = 0; i < rects.length; i++) { + let rect = rects[i]; + let dist = Math.max(rect.top - y, y - rect.bottom, rect.left - x, x - rect.right); + if (dist <= margin) + return true; + } + return false; +} +/** +Set up a hover tooltip, which shows up when the pointer hovers +over ranges of text. The callback is called when the mouse hovers +over the document text. It should, if there is a tooltip +associated with position `pos`, return the tooltip description +(either directly or in a promise). The `side` argument indicates +on which side of the position the pointer is—it will be -1 if the +pointer is before the position, 1 if after the position. + +Note that all hover tooltips are hosted within a single tooltip +container element. This allows multiple tooltips over the same +range to be "merged" together without overlapping. +*/ +function hoverTooltip(source, options = {}) { + let setHover = state.StateEffect.define(); + let hoverState = state.StateField.define({ + create() { return null; }, + update(value, tr) { + if (value && (options.hideOnChange && (tr.docChanged || tr.selection) || + options.hideOn && options.hideOn(tr, value))) + return null; + if (value && tr.docChanged) { + let newPos = tr.changes.mapPos(value.pos, -1, state.MapMode.TrackDel); + if (newPos == null) + return null; + let copy = Object.assign(Object.create(null), value); + copy.pos = newPos; + if (value.end != null) + copy.end = tr.changes.mapPos(value.end); + value = copy; + } + for (let effect of tr.effects) { + if (effect.is(setHover)) + value = effect.value; + if (effect.is(closeHoverTooltipEffect)) + value = null; + } + return value; + }, + provide: f => showHoverTooltip.from(f) + }); + return [ + hoverState, + ViewPlugin.define(view => new HoverPlugin(view, source, hoverState, setHover, options.hoverTime || 300 /* Time */)), + showHoverTooltipHost + ]; +} +/** +Get the active tooltip view for a given tooltip, if available. +*/ +function getTooltip(view, tooltip) { + let plugin = view.plugin(tooltipPlugin); + if (!plugin) + return null; + let found = plugin.manager.tooltips.indexOf(tooltip); + return found < 0 ? null : plugin.manager.tooltipViews[found]; +} +/** +Returns true if any hover tooltips are currently active. +*/ +function hasHoverTooltips(state) { + return state.facet(showHoverTooltip).some(x => x); +} +const closeHoverTooltipEffect = state.StateEffect.define(); +/** +Transaction effect that closes all hover tooltips. +*/ +const closeHoverTooltips = closeHoverTooltipEffect.of(null); +/** +Tell the tooltip extension to recompute the position of the active +tooltips. This can be useful when something happens (such as a +re-positioning or CSS change affecting the editor) that could +invalidate the existing tooltip positions. +*/ +function repositionTooltips(view) { + var _a; + (_a = view.plugin(tooltipPlugin)) === null || _a === void 0 ? void 0 : _a.maybeMeasure(); +} + +const panelConfig = state.Facet.define({ + combine(configs) { + let topContainer, bottomContainer; + for (let c of configs) { + topContainer = topContainer || c.topContainer; + bottomContainer = bottomContainer || c.bottomContainer; + } + return { topContainer, bottomContainer }; + } +}); +/** +Configures the panel-managing extension. +*/ +function panels(config) { + return config ? [panelConfig.of(config)] : []; +} +/** +Get the active panel created by the given constructor, if any. +This can be useful when you need access to your panels' DOM +structure. +*/ +function getPanel(view, panel) { + let plugin = view.plugin(panelPlugin); + let index = plugin ? plugin.specs.indexOf(panel) : -1; + return index > -1 ? plugin.panels[index] : null; +} +const panelPlugin = ViewPlugin.fromClass(class { + constructor(view) { + this.input = view.state.facet(showPanel); + this.specs = this.input.filter(s => s); + this.panels = this.specs.map(spec => spec(view)); + let conf = view.state.facet(panelConfig); + this.top = new PanelGroup(view, true, conf.topContainer); + this.bottom = new PanelGroup(view, false, conf.bottomContainer); + this.top.sync(this.panels.filter(p => p.top)); + this.bottom.sync(this.panels.filter(p => !p.top)); + for (let p of this.panels) { + p.dom.classList.add("cm-panel"); + if (p.mount) + p.mount(); + } + } + update(update) { + let conf = update.state.facet(panelConfig); + if (this.top.container != conf.topContainer) { + this.top.sync([]); + this.top = new PanelGroup(update.view, true, conf.topContainer); + } + if (this.bottom.container != conf.bottomContainer) { + this.bottom.sync([]); + this.bottom = new PanelGroup(update.view, false, conf.bottomContainer); + } + this.top.syncClasses(); + this.bottom.syncClasses(); + let input = update.state.facet(showPanel); + if (input != this.input) { + let specs = input.filter(x => x); + let panels = [], top = [], bottom = [], mount = []; + for (let spec of specs) { + let known = this.specs.indexOf(spec), panel; + if (known < 0) { + panel = spec(update.view); + mount.push(panel); + } + else { + panel = this.panels[known]; + if (panel.update) + panel.update(update); + } + panels.push(panel); + (panel.top ? top : bottom).push(panel); + } + this.specs = specs; + this.panels = panels; + this.top.sync(top); + this.bottom.sync(bottom); + for (let p of mount) { + p.dom.classList.add("cm-panel"); + if (p.mount) + p.mount(); + } + } + else { + for (let p of this.panels) + if (p.update) + p.update(update); + } + } + destroy() { + this.top.sync([]); + this.bottom.sync([]); + } +}, { + provide: plugin => EditorView.scrollMargins.of(view => { + let value = view.plugin(plugin); + return value && { top: value.top.scrollMargin(), bottom: value.bottom.scrollMargin() }; + }) +}); +class PanelGroup { + constructor(view, top, container) { + this.view = view; + this.top = top; + this.container = container; + this.dom = undefined; + this.classes = ""; + this.panels = []; + this.syncClasses(); + } + sync(panels) { + for (let p of this.panels) + if (p.destroy && panels.indexOf(p) < 0) + p.destroy(); + this.panels = panels; + this.syncDOM(); + } + syncDOM() { + if (this.panels.length == 0) { + if (this.dom) { + this.dom.remove(); + this.dom = undefined; + } + return; + } + if (!this.dom) { + this.dom = document.createElement("div"); + this.dom.className = this.top ? "cm-panels cm-panels-top" : "cm-panels cm-panels-bottom"; + this.dom.style[this.top ? "top" : "bottom"] = "0"; + let parent = this.container || this.view.dom; + parent.insertBefore(this.dom, this.top ? parent.firstChild : null); + } + let curDOM = this.dom.firstChild; + for (let panel of this.panels) { + if (panel.dom.parentNode == this.dom) { + while (curDOM != panel.dom) + curDOM = rm(curDOM); + curDOM = curDOM.nextSibling; + } + else { + this.dom.insertBefore(panel.dom, curDOM); + } + } + while (curDOM) + curDOM = rm(curDOM); + } + scrollMargin() { + return !this.dom || this.container ? 0 + : Math.max(0, this.top ? + this.dom.getBoundingClientRect().bottom - Math.max(0, this.view.scrollDOM.getBoundingClientRect().top) : + Math.min(innerHeight, this.view.scrollDOM.getBoundingClientRect().bottom) - this.dom.getBoundingClientRect().top); + } + syncClasses() { + if (!this.container || this.classes == this.view.themeClasses) + return; + for (let cls of this.classes.split(" ")) + if (cls) + this.container.classList.remove(cls); + for (let cls of (this.classes = this.view.themeClasses).split(" ")) + if (cls) + this.container.classList.add(cls); + } +} +function rm(node) { + let next = node.nextSibling; + node.remove(); + return next; +} +/** +Opening a panel is done by providing a constructor function for +the panel through this facet. (The panel is closed again when its +constructor is no longer provided.) Values of `null` are ignored. +*/ +const showPanel = state.Facet.define({ + enables: panelPlugin +}); + +/** +A gutter marker represents a bit of information attached to a line +in a specific gutter. Your own custom markers have to extend this +class. +*/ +class GutterMarker extends state.RangeValue { + /** + @internal + */ + compare(other) { + return this == other || this.constructor == other.constructor && this.eq(other); + } + /** + Compare this marker to another marker of the same type. + */ + eq(other) { return false; } + /** + Called if the marker has a `toDOM` method and its representation + was removed from a gutter. + */ + destroy(dom) { } +} +GutterMarker.prototype.elementClass = ""; +GutterMarker.prototype.toDOM = undefined; +GutterMarker.prototype.mapMode = state.MapMode.TrackBefore; +GutterMarker.prototype.startSide = GutterMarker.prototype.endSide = -1; +GutterMarker.prototype.point = true; +/** +Facet used to add a class to all gutter elements for a given line. +Markers given to this facet should _only_ define an +[`elementclass`](https://codemirror.net/6/docs/ref/#view.GutterMarker.elementClass), not a +[`toDOM`](https://codemirror.net/6/docs/ref/#view.GutterMarker.toDOM) (or the marker will appear +in all gutters for the line). +*/ +const gutterLineClass = state.Facet.define(); +const defaults = { + class: "", + renderEmptyElements: false, + elementStyle: "", + markers: () => state.RangeSet.empty, + lineMarker: () => null, + lineMarkerChange: null, + initialSpacer: null, + updateSpacer: null, + domEventHandlers: {} +}; +const activeGutters = state.Facet.define(); +/** +Define an editor gutter. The order in which the gutters appear is +determined by their extension priority. +*/ +function gutter(config) { + return [gutters(), activeGutters.of(Object.assign(Object.assign({}, defaults), config))]; +} +const unfixGutters = state.Facet.define({ + combine: values => values.some(x => x) +}); +/** +The gutter-drawing plugin is automatically enabled when you add a +gutter, but you can use this function to explicitly configure it. + +Unless `fixed` is explicitly set to `false`, the gutters are +fixed, meaning they don't scroll along with the content +horizontally (except on Internet Explorer, which doesn't support +CSS [`position: +sticky`](https://developer.mozilla.org/en-US/docs/Web/CSS/position#sticky)). +*/ +function gutters(config) { + let result = [ + gutterView, + ]; + if (config && config.fixed === false) + result.push(unfixGutters.of(true)); + return result; +} +const gutterView = ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.prevViewport = view.viewport; + this.dom = document.createElement("div"); + this.dom.className = "cm-gutters"; + this.dom.setAttribute("aria-hidden", "true"); + this.dom.style.minHeight = this.view.contentHeight + "px"; + this.gutters = view.state.facet(activeGutters).map(conf => new SingleGutterView(view, conf)); + for (let gutter of this.gutters) + this.dom.appendChild(gutter.dom); + this.fixed = !view.state.facet(unfixGutters); + if (this.fixed) { + // FIXME IE11 fallback, which doesn't support position: sticky, + // by using position: relative + event handlers that realign the + // gutter (or just force fixed=false on IE11?) + this.dom.style.position = "sticky"; + } + this.syncGutters(false); + view.scrollDOM.insertBefore(this.dom, view.contentDOM); + } + update(update) { + if (this.updateGutters(update)) { + // Detach during sync when the viewport changed significantly + // (such as during scrolling), since for large updates that is + // faster. + let vpA = this.prevViewport, vpB = update.view.viewport; + let vpOverlap = Math.min(vpA.to, vpB.to) - Math.max(vpA.from, vpB.from); + this.syncGutters(vpOverlap < (vpB.to - vpB.from) * 0.8); + } + if (update.geometryChanged) + this.dom.style.minHeight = this.view.contentHeight + "px"; + if (this.view.state.facet(unfixGutters) != !this.fixed) { + this.fixed = !this.fixed; + this.dom.style.position = this.fixed ? "sticky" : ""; + } + this.prevViewport = update.view.viewport; + } + syncGutters(detach) { + let after = this.dom.nextSibling; + if (detach) + this.dom.remove(); + let lineClasses = state.RangeSet.iter(this.view.state.facet(gutterLineClass), this.view.viewport.from); + let classSet = []; + let contexts = this.gutters.map(gutter => new UpdateContext(gutter, this.view.viewport, -this.view.documentPadding.top)); + for (let line of this.view.viewportLineBlocks) { + let text; + if (Array.isArray(line.type)) { + for (let b of line.type) + if (b.type == exports.BlockType.Text) { + text = b; + break; + } + } + else { + text = line.type == exports.BlockType.Text ? line : undefined; + } + if (!text) + continue; + if (classSet.length) + classSet = []; + advanceCursor(lineClasses, classSet, line.from); + for (let cx of contexts) + cx.line(this.view, text, classSet); + } + for (let cx of contexts) + cx.finish(); + if (detach) + this.view.scrollDOM.insertBefore(this.dom, after); + } + updateGutters(update) { + let prev = update.startState.facet(activeGutters), cur = update.state.facet(activeGutters); + let change = update.docChanged || update.heightChanged || update.viewportChanged || + !state.RangeSet.eq(update.startState.facet(gutterLineClass), update.state.facet(gutterLineClass), update.view.viewport.from, update.view.viewport.to); + if (prev == cur) { + for (let gutter of this.gutters) + if (gutter.update(update)) + change = true; + } + else { + change = true; + let gutters = []; + for (let conf of cur) { + let known = prev.indexOf(conf); + if (known < 0) { + gutters.push(new SingleGutterView(this.view, conf)); + } + else { + this.gutters[known].update(update); + gutters.push(this.gutters[known]); + } + } + for (let g of this.gutters) { + g.dom.remove(); + if (gutters.indexOf(g) < 0) + g.destroy(); + } + for (let g of gutters) + this.dom.appendChild(g.dom); + this.gutters = gutters; + } + return change; + } + destroy() { + for (let view of this.gutters) + view.destroy(); + this.dom.remove(); + } +}, { + provide: plugin => EditorView.scrollMargins.of(view => { + let value = view.plugin(plugin); + if (!value || value.gutters.length == 0 || !value.fixed) + return null; + return view.textDirection == exports.Direction.LTR ? { left: value.dom.offsetWidth } : { right: value.dom.offsetWidth }; + }) +}); +function asArray(val) { return (Array.isArray(val) ? val : [val]); } +function advanceCursor(cursor, collect, pos) { + while (cursor.value && cursor.from <= pos) { + if (cursor.from == pos) + collect.push(cursor.value); + cursor.next(); + } +} +class UpdateContext { + constructor(gutter, viewport, height) { + this.gutter = gutter; + this.height = height; + this.localMarkers = []; + this.i = 0; + this.cursor = state.RangeSet.iter(gutter.markers, viewport.from); + } + line(view, line, extraMarkers) { + if (this.localMarkers.length) + this.localMarkers = []; + advanceCursor(this.cursor, this.localMarkers, line.from); + let localMarkers = extraMarkers.length ? this.localMarkers.concat(extraMarkers) : this.localMarkers; + let forLine = this.gutter.config.lineMarker(view, line, localMarkers); + if (forLine) + localMarkers.unshift(forLine); + let gutter = this.gutter; + if (localMarkers.length == 0 && !gutter.config.renderEmptyElements) + return; + let above = line.top - this.height; + if (this.i == gutter.elements.length) { + let newElt = new GutterElement(view, line.height, above, localMarkers); + gutter.elements.push(newElt); + gutter.dom.appendChild(newElt.dom); + } + else { + gutter.elements[this.i].update(view, line.height, above, localMarkers); + } + this.height = line.bottom; + this.i++; + } + finish() { + let gutter = this.gutter; + while (gutter.elements.length > this.i) { + let last = gutter.elements.pop(); + gutter.dom.removeChild(last.dom); + last.destroy(); + } + } +} +class SingleGutterView { + constructor(view, config) { + this.view = view; + this.config = config; + this.elements = []; + this.spacer = null; + this.dom = document.createElement("div"); + this.dom.className = "cm-gutter" + (this.config.class ? " " + this.config.class : ""); + for (let prop in config.domEventHandlers) { + this.dom.addEventListener(prop, (event) => { + let line = view.lineBlockAtHeight(event.clientY - view.documentTop); + if (config.domEventHandlers[prop](view, line, event)) + event.preventDefault(); + }); + } + this.markers = asArray(config.markers(view)); + if (config.initialSpacer) { + this.spacer = new GutterElement(view, 0, 0, [config.initialSpacer(view)]); + this.dom.appendChild(this.spacer.dom); + this.spacer.dom.style.cssText += "visibility: hidden; pointer-events: none"; + } + } + update(update) { + let prevMarkers = this.markers; + this.markers = asArray(this.config.markers(update.view)); + if (this.spacer && this.config.updateSpacer) { + let updated = this.config.updateSpacer(this.spacer.markers[0], update); + if (updated != this.spacer.markers[0]) + this.spacer.update(update.view, 0, 0, [updated]); + } + let vp = update.view.viewport; + return !state.RangeSet.eq(this.markers, prevMarkers, vp.from, vp.to) || + (this.config.lineMarkerChange ? this.config.lineMarkerChange(update) : false); + } + destroy() { + for (let elt of this.elements) + elt.destroy(); + } +} +class GutterElement { + constructor(view, height, above, markers) { + this.height = -1; + this.above = 0; + this.markers = []; + this.dom = document.createElement("div"); + this.dom.className = "cm-gutterElement"; + this.update(view, height, above, markers); + } + update(view, height, above, markers) { + if (this.height != height) + this.dom.style.height = (this.height = height) + "px"; + if (this.above != above) + this.dom.style.marginTop = (this.above = above) ? above + "px" : ""; + if (!sameMarkers(this.markers, markers)) + this.setMarkers(view, markers); + } + setMarkers(view, markers) { + let cls = "cm-gutterElement", domPos = this.dom.firstChild; + for (let iNew = 0, iOld = 0;;) { + let skipTo = iOld, marker = iNew < markers.length ? markers[iNew++] : null, matched = false; + if (marker) { + let c = marker.elementClass; + if (c) + cls += " " + c; + for (let i = iOld; i < this.markers.length; i++) + if (this.markers[i].compare(marker)) { + skipTo = i; + matched = true; + break; + } + } + else { + skipTo = this.markers.length; + } + while (iOld < skipTo) { + let next = this.markers[iOld++]; + if (next.toDOM) { + next.destroy(domPos); + let after = domPos.nextSibling; + domPos.remove(); + domPos = after; + } + } + if (!marker) + break; + if (marker.toDOM) { + if (matched) + domPos = domPos.nextSibling; + else + this.dom.insertBefore(marker.toDOM(view), domPos); + } + if (matched) + iOld++; + } + this.dom.className = cls; + this.markers = markers; + } + destroy() { + this.setMarkers(null, []); // First argument not used unless creating markers + } +} +function sameMarkers(a, b) { + if (a.length != b.length) + return false; + for (let i = 0; i < a.length; i++) + if (!a[i].compare(b[i])) + return false; + return true; +} +/** +Facet used to provide markers to the line number gutter. +*/ +const lineNumberMarkers = state.Facet.define(); +const lineNumberConfig = state.Facet.define({ + combine(values) { + return state.combineConfig(values, { formatNumber: String, domEventHandlers: {} }, { + domEventHandlers(a, b) { + let result = Object.assign({}, a); + for (let event in b) { + let exists = result[event], add = b[event]; + result[event] = exists ? (view, line, event) => exists(view, line, event) || add(view, line, event) : add; + } + return result; + } + }); + } +}); +class NumberMarker extends GutterMarker { + constructor(number) { + super(); + this.number = number; + } + eq(other) { return this.number == other.number; } + toDOM() { return document.createTextNode(this.number); } +} +function formatNumber(view, number) { + return view.state.facet(lineNumberConfig).formatNumber(number, view.state); +} +const lineNumberGutter = activeGutters.compute([lineNumberConfig], state => ({ + class: "cm-lineNumbers", + renderEmptyElements: false, + markers(view) { return view.state.facet(lineNumberMarkers); }, + lineMarker(view, line, others) { + if (others.some(m => m.toDOM)) + return null; + return new NumberMarker(formatNumber(view, view.state.doc.lineAt(line.from).number)); + }, + lineMarkerChange: update => update.startState.facet(lineNumberConfig) != update.state.facet(lineNumberConfig), + initialSpacer(view) { + return new NumberMarker(formatNumber(view, maxLineNumber(view.state.doc.lines))); + }, + updateSpacer(spacer, update) { + let max = formatNumber(update.view, maxLineNumber(update.view.state.doc.lines)); + return max == spacer.number ? spacer : new NumberMarker(max); + }, + domEventHandlers: state.facet(lineNumberConfig).domEventHandlers +})); +/** +Create a line number gutter extension. +*/ +function lineNumbers(config = {}) { + return [ + lineNumberConfig.of(config), + gutters(), + lineNumberGutter + ]; +} +function maxLineNumber(lines) { + let last = 9; + while (last < lines) + last = last * 10 + 9; + return last; +} +const activeLineGutterMarker = new class extends GutterMarker { + constructor() { + super(...arguments); + this.elementClass = "cm-activeLineGutter"; + } +}; +const activeLineGutterHighlighter = gutterLineClass.compute(["selection"], state$1 => { + let marks = [], last = -1; + for (let range of state$1.selection.ranges) + if (range.empty) { + let linePos = state$1.doc.lineAt(range.head).from; + if (linePos > last) { + last = linePos; + marks.push(activeLineGutterMarker.range(linePos)); + } + } + return state.RangeSet.of(marks); +}); +/** +Returns an extension that adds a `cm-activeLineGutter` class to +all gutter elements on the [active +line](https://codemirror.net/6/docs/ref/#view.highlightActiveLine). +*/ +function highlightActiveLineGutter() { + return activeLineGutterHighlighter; +} + +/** +@internal +*/ +const __test = { HeightMap, HeightOracle, MeasuredHeights, QueryType, ChangedRange, computeOrder, moveVisually }; + +exports.BidiSpan = BidiSpan; +exports.BlockInfo = BlockInfo; +exports.Decoration = Decoration; +exports.EditorView = EditorView; +exports.GutterMarker = GutterMarker; +exports.MatchDecorator = MatchDecorator; +exports.ViewPlugin = ViewPlugin; +exports.ViewUpdate = ViewUpdate; +exports.WidgetType = WidgetType; +exports.__test = __test; +exports.closeHoverTooltips = closeHoverTooltips; +exports.crosshairCursor = crosshairCursor; +exports.drawSelection = drawSelection; +exports.dropCursor = dropCursor; +exports.getPanel = getPanel; +exports.getTooltip = getTooltip; +exports.gutter = gutter; +exports.gutterLineClass = gutterLineClass; +exports.gutters = gutters; +exports.hasHoverTooltips = hasHoverTooltips; +exports.highlightActiveLine = highlightActiveLine; +exports.highlightActiveLineGutter = highlightActiveLineGutter; +exports.highlightSpecialChars = highlightSpecialChars; +exports.hoverTooltip = hoverTooltip; +exports.keymap = keymap; +exports.lineNumberMarkers = lineNumberMarkers; +exports.lineNumbers = lineNumbers; +exports.logException = logException; +exports.panels = panels; +exports.placeholder = placeholder; +exports.rectangularSelection = rectangularSelection; +exports.repositionTooltips = repositionTooltips; +exports.runScopeHandlers = runScopeHandlers; +exports.scrollPastEnd = scrollPastEnd; +exports.showPanel = showPanel; +exports.showTooltip = showTooltip; +exports.tooltips = tooltips; diff --git a/node_modules/@codemirror/view/dist/index.d.ts b/node_modules/@codemirror/view/dist/index.d.ts new file mode 100644 index 0000000000..52c997b5fe --- /dev/null +++ b/node_modules/@codemirror/view/dist/index.d.ts @@ -0,0 +1,1793 @@ +import * as _codemirror_state from '@codemirror/state'; +import { RangeSet, RangeValue, Range, EditorState, Extension, Transaction, ChangeSet, EditorSelection, EditorStateConfig, TransactionSpec, SelectionRange, Line, StateEffect, Facet } from '@codemirror/state'; +import { StyleModule, StyleSpec } from 'style-mod'; + +declare type Attrs = { + [name: string]: string; +}; + +interface MarkDecorationSpec { + /** + Whether the mark covers its start and end position or not. This + influences whether content inserted at those positions becomes + part of the mark. Defaults to false. + */ + inclusive?: boolean; + /** + Specify whether the start position of the marked range should be + inclusive. Overrides `inclusive`, when both are present. + */ + inclusiveStart?: boolean; + /** + Whether the end should be inclusive. + */ + inclusiveEnd?: boolean; + /** + Add attributes to the DOM elements that hold the text in the + marked range. + */ + attributes?: { + [key: string]: string; + }; + /** + Shorthand for `{attributes: {class: value}}`. + */ + class?: string; + /** + Add a wrapping element around the text in the marked range. Note + that there will not necessarily be a single element covering the + entire range—other decorations with lower precedence might split + this one if they partially overlap it, and line breaks always + end decoration elements. + */ + tagName?: string; + /** + Decoration specs allow extra properties, which can be retrieved + through the decoration's [`spec`](https://codemirror.net/6/docs/ref/#view.Decoration.spec) + property. + */ + [other: string]: any; +} +interface WidgetDecorationSpec { + /** + The type of widget to draw here. + */ + widget: WidgetType; + /** + Which side of the given position the widget is on. When this is + positive, the widget will be drawn after the cursor if the + cursor is on the same position. Otherwise, it'll be drawn before + it. When multiple widgets sit at the same position, their `side` + values will determine their ordering—those with a lower value + come first. Defaults to 0. + */ + side?: number; + /** + Determines whether this is a block widgets, which will be drawn + between lines, or an inline widget (the default) which is drawn + between the surrounding text. + + Note that block-level decorations should not have vertical + margins, and if you dynamically change their height, you should + make sure to call + [`requestMeasure`](https://codemirror.net/6/docs/ref/#view.EditorView.requestMeasure), so that the + editor can update its information about its vertical layout. + */ + block?: boolean; + /** + Other properties are allowed. + */ + [other: string]: any; +} +interface ReplaceDecorationSpec { + /** + An optional widget to drawn in the place of the replaced + content. + */ + widget?: WidgetType; + /** + Whether this range covers the positions on its sides. This + influences whether new content becomes part of the range and + whether the cursor can be drawn on its sides. Defaults to false + for inline replacements, and true for block replacements. + */ + inclusive?: boolean; + /** + Set inclusivity at the start. + */ + inclusiveStart?: boolean; + /** + Set inclusivity at the end. + */ + inclusiveEnd?: boolean; + /** + Whether this is a block-level decoration. Defaults to false. + */ + block?: boolean; + /** + Other properties are allowed. + */ + [other: string]: any; +} +interface LineDecorationSpec { + /** + DOM attributes to add to the element wrapping the line. + */ + attributes?: { + [key: string]: string; + }; + /** + Shorthand for `{attributes: {class: value}}`. + */ + class?: string; + /** + Other properties are allowed. + */ + [other: string]: any; +} +/** +Widgets added to the content are described by subclasses of this +class. Using a description object like that makes it possible to +delay creating of the DOM structure for a widget until it is +needed, and to avoid redrawing widgets even if the decorations +that define them are recreated. +*/ +declare abstract class WidgetType { + /** + Build the DOM structure for this widget instance. + */ + abstract toDOM(view: EditorView): HTMLElement; + /** + Compare this instance to another instance of the same type. + (TypeScript can't express this, but only instances of the same + specific class will be passed to this method.) This is used to + avoid redrawing widgets when they are replaced by a new + decoration of the same type. The default implementation just + returns `false`, which will cause new instances of the widget to + always be redrawn. + */ + eq(widget: WidgetType): boolean; + /** + Update a DOM element created by a widget of the same type (but + different, non-`eq` content) to reflect this widget. May return + true to indicate that it could update, false to indicate it + couldn't (in which case the widget will be redrawn). The default + implementation just returns false. + */ + updateDOM(dom: HTMLElement): boolean; + /** + The estimated height this widget will have, to be used when + estimating the height of content that hasn't been drawn. May + return -1 to indicate you don't know. The default implementation + returns -1. + */ + get estimatedHeight(): number; + /** + Can be used to configure which kinds of events inside the widget + should be ignored by the editor. The default is to ignore all + events. + */ + ignoreEvent(event: Event): boolean; + /** + This is called when the an instance of the widget is removed + from the editor view. + */ + destroy(dom: HTMLElement): void; +} +/** +A decoration set represents a collection of decorated ranges, +organized for efficient access and mapping. See +[`RangeSet`](https://codemirror.net/6/docs/ref/#state.RangeSet) for its methods. +*/ +declare type DecorationSet = RangeSet; +/** +The different types of blocks that can occur in an editor view. +*/ +declare enum BlockType { + /** + A line of text. + */ + Text = 0, + /** + A block widget associated with the position after it. + */ + WidgetBefore = 1, + /** + A block widget associated with the position before it. + */ + WidgetAfter = 2, + /** + A block widget [replacing](https://codemirror.net/6/docs/ref/#view.Decoration^replace) a range of content. + */ + WidgetRange = 3 +} +/** +A decoration provides information on how to draw or style a piece +of content. You'll usually use it wrapped in a +[`Range`](https://codemirror.net/6/docs/ref/#state.Range), which adds a start and end position. +@nonabstract +*/ +declare abstract class Decoration extends RangeValue { + /** + The config object used to create this decoration. You can + include additional properties in there to store metadata about + your decoration. + */ + readonly spec: any; + protected constructor( + /** + @internal + */ + startSide: number, + /** + @internal + */ + endSide: number, + /** + @internal + */ + widget: WidgetType | null, + /** + The config object used to create this decoration. You can + include additional properties in there to store metadata about + your decoration. + */ + spec: any); + abstract eq(other: Decoration): boolean; + /** + Create a mark decoration, which influences the styling of the + content in its range. Nested mark decorations will cause nested + DOM elements to be created. Nesting order is determined by + precedence of the [facet](https://codemirror.net/6/docs/ref/#view.EditorView^decorations), with + the higher-precedence decorations creating the inner DOM nodes. + Such elements are split on line boundaries and on the boundaries + of lower-precedence decorations. + */ + static mark(spec: MarkDecorationSpec): Decoration; + /** + Create a widget decoration, which displays a DOM element at the + given position. + */ + static widget(spec: WidgetDecorationSpec): Decoration; + /** + Create a replace decoration which replaces the given range with + a widget, or simply hides it. + */ + static replace(spec: ReplaceDecorationSpec): Decoration; + /** + Create a line decoration, which can add DOM attributes to the + line starting at the given position. + */ + static line(spec: LineDecorationSpec): Decoration; + /** + Build a [`DecorationSet`](https://codemirror.net/6/docs/ref/#view.DecorationSet) from the given + decorated range or ranges. If the ranges aren't already sorted, + pass `true` for `sort` to make the library sort them for you. + */ + static set(of: Range | readonly Range[], sort?: boolean): DecorationSet; + /** + The empty set of decorations. + */ + static none: DecorationSet; +} + +/** +Basic rectangle type. +*/ +interface Rect { + readonly left: number; + readonly right: number; + readonly top: number; + readonly bottom: number; +} +declare type ScrollStrategy = "nearest" | "start" | "end" | "center"; + +/** +Command functions are used in key bindings and other types of user +actions. Given an editor view, they check whether their effect can +apply to the editor, and if it can, perform it as a side effect +(which usually means [dispatching](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch) a +transaction) and return `true`. +*/ +declare type Command = (target: EditorView) => boolean; +/** +Log or report an unhandled exception in client code. Should +probably only be used by extension code that allows client code to +provide functions, and calls those functions in a context where an +exception can't be propagated to calling code in a reasonable way +(for example when in an event handler). + +Either calls a handler registered with +[`EditorView.exceptionSink`](https://codemirror.net/6/docs/ref/#view.EditorView^exceptionSink), +`window.onerror`, if defined, or `console.error` (in which case +it'll pass `context`, when given, as first argument). +*/ +declare function logException(state: EditorState, exception: any, context?: string): void; +/** +This is the interface plugin objects conform to. +*/ +interface PluginValue extends Object { + /** + Notifies the plugin of an update that happened in the view. This + is called _before_ the view updates its own DOM. It is + responsible for updating the plugin's internal state (including + any state that may be read by plugin fields) and _writing_ to + the DOM for the changes in the update. To avoid unnecessary + layout recomputations, it should _not_ read the DOM layout—use + [`requestMeasure`](https://codemirror.net/6/docs/ref/#view.EditorView.requestMeasure) to schedule + your code in a DOM reading phase if you need to. + */ + update?(update: ViewUpdate): void; + /** + Called when the plugin is no longer going to be used. Should + revert any changes the plugin made to the DOM. + */ + destroy?(): void; +} +/** +Provides additional information when defining a [view +plugin](https://codemirror.net/6/docs/ref/#view.ViewPlugin). +*/ +interface PluginSpec { + /** + Register the given [event + handlers](https://codemirror.net/6/docs/ref/#view.EditorView^domEventHandlers) for the plugin. + When called, these will have their `this` bound to the plugin + value. + */ + eventHandlers?: DOMEventHandlers; + /** + Specify that the plugin provides additional extensions when + added to an editor configuration. + */ + provide?: (plugin: ViewPlugin) => Extension; + /** + Allow the plugin to provide decorations. When given, this should + be a function that take the plugin value and return a + [decoration set](https://codemirror.net/6/docs/ref/#view.DecorationSet). See also the caveat about + [layout-changing decorations](https://codemirror.net/6/docs/ref/#view.EditorView^decorations) that + depend on the view. + */ + decorations?: (value: V) => DecorationSet; +} +/** +View plugins associate stateful values with a view. They can +influence the way the content is drawn, and are notified of things +that happen in the view. +*/ +declare class ViewPlugin { + /** + Instances of this class act as extensions. + */ + extension: Extension; + private constructor(); + /** + Define a plugin from a constructor function that creates the + plugin's value, given an editor view. + */ + static define(create: (view: EditorView) => V, spec?: PluginSpec): ViewPlugin; + /** + Create a plugin for a class whose constructor takes a single + editor view as argument. + */ + static fromClass(cls: { + new (view: EditorView): V; + }, spec?: PluginSpec): ViewPlugin; +} +interface MeasureRequest { + /** + Called in a DOM read phase to gather information that requires + DOM layout. Should _not_ mutate the document. + */ + read(view: EditorView): T; + /** + Called in a DOM write phase to update the document. Should _not_ + do anything that triggers DOM layout. + */ + write?(measure: T, view: EditorView): void; + /** + When multiple requests with the same key are scheduled, only the + last one will actually be ran. + */ + key?: any; +} +declare type AttrSource = Attrs | ((view: EditorView) => Attrs | null); +/** +View [plugins](https://codemirror.net/6/docs/ref/#view.ViewPlugin) are given instances of this +class, which describe what happened, whenever the view is updated. +*/ +declare class ViewUpdate { + /** + The editor view that the update is associated with. + */ + readonly view: EditorView; + /** + The new editor state. + */ + readonly state: EditorState; + /** + The transactions involved in the update. May be empty. + */ + readonly transactions: readonly Transaction[]; + /** + The changes made to the document by this update. + */ + readonly changes: ChangeSet; + /** + The previous editor state. + */ + readonly startState: EditorState; + private constructor(); + /** + Tells you whether the [viewport](https://codemirror.net/6/docs/ref/#view.EditorView.viewport) or + [visible ranges](https://codemirror.net/6/docs/ref/#view.EditorView.visibleRanges) changed in this + update. + */ + get viewportChanged(): boolean; + /** + Indicates whether the height of a block element in the editor + changed in this update. + */ + get heightChanged(): boolean; + /** + Returns true when the document was modified or the size of the + editor, or elements within the editor, changed. + */ + get geometryChanged(): boolean; + /** + True when this update indicates a focus change. + */ + get focusChanged(): boolean; + /** + Whether the document changed in this update. + */ + get docChanged(): boolean; + /** + Whether the selection was explicitly set in this update. + */ + get selectionSet(): boolean; +} + +/** +Interface that objects registered with +[`EditorView.mouseSelectionStyle`](https://codemirror.net/6/docs/ref/#view.EditorView^mouseSelectionStyle) +must conform to. +*/ +interface MouseSelectionStyle { + /** + Return a new selection for the mouse gesture that starts with + the event that was originally given to the constructor, and ends + with the event passed here. In case of a plain click, those may + both be the `mousedown` event, in case of a drag gesture, the + latest `mousemove` event will be passed. + + When `extend` is true, that means the new selection should, if + possible, extend the start selection. If `multiple` is true, the + new selection should be added to the original selection. + */ + get: (curEvent: MouseEvent, extend: boolean, multiple: boolean) => EditorSelection; + /** + Called when the view is updated while the gesture is in + progress. When the document changes, it may be necessary to map + some data (like the original selection or start position) + through the changes. + + This may return `true` to indicate that the `get` method should + get queried again after the update, because something in the + update could change its result. Be wary of infinite loops when + using this (where `get` returns a new selection, which will + trigger `update`, which schedules another `get` in response). + */ + update: (update: ViewUpdate) => boolean | void; +} +declare type MakeSelectionStyle = (view: EditorView, event: MouseEvent) => MouseSelectionStyle | null; + +/** +Record used to represent information about a block-level element +in the editor view. +*/ +declare class BlockInfo { + /** + The start of the element in the document. + */ + readonly from: number; + /** + The length of the element. + */ + readonly length: number; + /** + The top position of the element (relative to the top of the + document). + */ + readonly top: number; + /** + Its height. + */ + readonly height: number; + /** + The type of element this is. When querying lines, this may be + an array of all the blocks that make up the line. + */ + readonly type: BlockType | readonly BlockInfo[]; + /** + The end of the element as a document position. + */ + get to(): number; + /** + The bottom position of the element. + */ + get bottom(): number; +} + +/** +Used to indicate [text direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection). +*/ +declare enum Direction { + /** + Left-to-right. + */ + LTR = 0, + /** + Right-to-left. + */ + RTL = 1 +} +/** +Represents a contiguous range of text that has a single direction +(as in left-to-right or right-to-left). +*/ +declare class BidiSpan { + /** + The start of the span (relative to the start of the line). + */ + readonly from: number; + /** + The end of the span. + */ + readonly to: number; + /** + The ["bidi + level"](https://unicode.org/reports/tr9/#Basic_Display_Algorithm) + of the span (in this context, 0 means + left-to-right, 1 means right-to-left, 2 means left-to-right + number inside right-to-left text). + */ + readonly level: number; + /** + The direction of this span. + */ + get dir(): Direction; +} + +/** +The type of object given to the [`EditorView`](https://codemirror.net/6/docs/ref/#view.EditorView) +constructor. +*/ +interface EditorViewConfig extends EditorStateConfig { + /** + The view's initial state. If not given, a new state is created + by passing this configuration object to + [`EditorState.create`](https://codemirror.net/6/docs/ref/#state.EditorState^create), using its + `doc`, `selection`, and `extensions` field (if provided). + */ + state?: EditorState; + /** + When given, the editor is immediately appended to the given + element on creation. (Otherwise, you'll have to place the view's + [`dom`](https://codemirror.net/6/docs/ref/#view.EditorView.dom) element in the document yourself.) + */ + parent?: Element | DocumentFragment; + /** + If the view is going to be mounted in a shadow root or document + other than the one held by the global variable `document` (the + default), you should pass it here. If you provide `parent`, but + not this option, the editor will automatically look up a root + from the parent. + */ + root?: Document | ShadowRoot; + /** + Override the transaction [dispatch + function](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch) for this editor view, which + is the way updates get routed to the view. Your implementation, + if provided, should probably call the view's [`update` + method](https://codemirror.net/6/docs/ref/#view.EditorView.update). + */ + dispatch?: (tr: Transaction) => void; +} +/** +An editor view represents the editor's user interface. It holds +the editable DOM surface, and possibly other elements such as the +line number gutter. It handles events and dispatches state +transactions for editing actions. +*/ +declare class EditorView { + /** + The current editor state. + */ + get state(): EditorState; + /** + To be able to display large documents without consuming too much + memory or overloading the browser, CodeMirror only draws the + code that is visible (plus a margin around it) to the DOM. This + property tells you the extent of the current drawn viewport, in + document positions. + */ + get viewport(): { + from: number; + to: number; + }; + /** + When there are, for example, large collapsed ranges in the + viewport, its size can be a lot bigger than the actual visible + content. Thus, if you are doing something like styling the + content in the viewport, it is preferable to only do so for + these ranges, which are the subset of the viewport that is + actually drawn. + */ + get visibleRanges(): readonly { + from: number; + to: number; + }[]; + /** + Returns false when the editor is entirely scrolled out of view + or otherwise hidden. + */ + get inView(): boolean; + /** + Indicates whether the user is currently composing text via + [IME](https://en.wikipedia.org/wiki/Input_method), and at least + one change has been made in the current composition. + */ + get composing(): boolean; + /** + Indicates whether the user is currently in composing state. Note + that on some platforms, like Android, this will be the case a + lot, since just putting the cursor on a word starts a + composition there. + */ + get compositionStarted(): boolean; + private _dispatch; + /** + The document or shadow root that the view lives in. + */ + readonly root: DocumentOrShadowRoot; + /** + The DOM element that wraps the entire editor view. + */ + readonly dom: HTMLElement; + /** + The DOM element that can be styled to scroll. (Note that it may + not have been, so you can't assume this is scrollable.) + */ + readonly scrollDOM: HTMLElement; + /** + The editable DOM element holding the editor content. You should + not, usually, interact with this content directly though the + DOM, since the editor will immediately undo most of the changes + you make. Instead, [dispatch](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch) + [transactions](https://codemirror.net/6/docs/ref/#state.Transaction) to modify content, and + [decorations](https://codemirror.net/6/docs/ref/#view.Decoration) to style it. + */ + readonly contentDOM: HTMLElement; + private announceDOM; + private plugins; + private pluginMap; + private editorAttrs; + private contentAttrs; + private styleModules; + private bidiCache; + private destroyed; + /** + Construct a new view. You'll want to either provide a `parent` + option, or put `view.dom` into your document after creating a + view, so that the user can see the editor. + */ + constructor(config?: EditorViewConfig); + /** + All regular editor state updates should go through this. It + takes a transaction or transaction spec and updates the view to + show the new state produced by that transaction. Its + implementation can be overridden with an + [option](https://codemirror.net/6/docs/ref/#view.EditorView.constructor^config.dispatch). This + function is bound to the view instance, so it does not have to + be called as a method. + */ + dispatch(tr: Transaction): void; + dispatch(...specs: TransactionSpec[]): void; + /** + Update the view for the given array of transactions. This will + update the visible document and selection to match the state + produced by the transactions, and notify view plugins of the + change. You should usually call + [`dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch) instead, which uses this + as a primitive. + */ + update(transactions: readonly Transaction[]): void; + /** + Reset the view to the given state. (This will cause the entire + document to be redrawn and all view plugins to be reinitialized, + so you should probably only use it when the new state isn't + derived from the old state. Otherwise, use + [`dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch) instead.) + */ + setState(newState: EditorState): void; + private updatePlugins; + /** + Get the CSS classes for the currently active editor themes. + */ + get themeClasses(): string; + private updateAttrs; + private showAnnouncements; + private mountStyles; + private readMeasured; + /** + Schedule a layout measurement, optionally providing callbacks to + do custom DOM measuring followed by a DOM write phase. Using + this is preferable reading DOM layout directly from, for + example, an event handler, because it'll make sure measuring and + drawing done by other components is synchronized, avoiding + unnecessary DOM layout computations. + */ + requestMeasure(request?: MeasureRequest): void; + /** + Get the value of a specific plugin, if present. Note that + plugins that crash can be dropped from a view, so even when you + know you registered a given plugin, it is recommended to check + the return value of this method. + */ + plugin(plugin: ViewPlugin): T | null; + /** + The top position of the document, in screen coordinates. This + may be negative when the editor is scrolled down. Points + directly to the top of the first line, not above the padding. + */ + get documentTop(): number; + /** + Reports the padding above and below the document. + */ + get documentPadding(): { + top: number; + bottom: number; + }; + /** + Find the text line or block widget at the given vertical + position (which is interpreted as relative to the [top of the + document](https://codemirror.net/6/docs/ref/#view.EditorView.documentTop) + */ + elementAtHeight(height: number): BlockInfo; + /** + Find the line block (see + [`lineBlockAt`](https://codemirror.net/6/docs/ref/#view.EditorView.lineBlockAt) at the given + height. + */ + lineBlockAtHeight(height: number): BlockInfo; + /** + Get the extent and vertical position of all [line + blocks](https://codemirror.net/6/docs/ref/#view.EditorView.lineBlockAt) in the viewport. Positions + are relative to the [top of the + document](https://codemirror.net/6/docs/ref/#view.EditorView.documentTop); + */ + get viewportLineBlocks(): BlockInfo[]; + /** + Find the line block around the given document position. A line + block is a range delimited on both sides by either a + non-[hidden](https://codemirror.net/6/docs/ref/#view.Decoration^replace) line breaks, or the + start/end of the document. It will usually just hold a line of + text, but may be broken into multiple textblocks by block + widgets. + */ + lineBlockAt(pos: number): BlockInfo; + /** + The editor's total content height. + */ + get contentHeight(): number; + /** + Move a cursor position by [grapheme + cluster](https://codemirror.net/6/docs/ref/#state.findClusterBreak). `forward` determines whether + the motion is away from the line start, or towards it. In + bidirectional text, the line is traversed in visual order, using + the editor's [text direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection). + When the start position was the last one on the line, the + returned position will be across the line break. If there is no + further line, the original position is returned. + + By default, this method moves over a single cluster. The + optional `by` argument can be used to move across more. It will + be called with the first cluster as argument, and should return + a predicate that determines, for each subsequent cluster, + whether it should also be moved over. + */ + moveByChar(start: SelectionRange, forward: boolean, by?: (initial: string) => (next: string) => boolean): SelectionRange; + /** + Move a cursor position across the next group of either + [letters](https://codemirror.net/6/docs/ref/#state.EditorState.charCategorizer) or non-letter + non-whitespace characters. + */ + moveByGroup(start: SelectionRange, forward: boolean): SelectionRange; + /** + Move to the next line boundary in the given direction. If + `includeWrap` is true, line wrapping is on, and there is a + further wrap point on the current line, the wrap point will be + returned. Otherwise this function will return the start or end + of the line. + */ + moveToLineBoundary(start: SelectionRange, forward: boolean, includeWrap?: boolean): SelectionRange; + /** + Move a cursor position vertically. When `distance` isn't given, + it defaults to moving to the next line (including wrapped + lines). Otherwise, `distance` should provide a positive distance + in pixels. + + When `start` has a + [`goalColumn`](https://codemirror.net/6/docs/ref/#state.SelectionRange.goalColumn), the vertical + motion will use that as a target horizontal position. Otherwise, + the cursor's own horizontal position is used. The returned + cursor will have its goal column set to whichever column was + used. + */ + moveVertically(start: SelectionRange, forward: boolean, distance?: number): SelectionRange; + /** + Find the DOM parent node and offset (child offset if `node` is + an element, character offset when it is a text node) at the + given document position. + + Note that for positions that aren't currently in + `visibleRanges`, the resulting DOM position isn't necessarily + meaningful (it may just point before or after a placeholder + element). + */ + domAtPos(pos: number): { + node: Node; + offset: number; + }; + /** + Find the document position at the given DOM node. Can be useful + for associating positions with DOM events. Will raise an error + when `node` isn't part of the editor content. + */ + posAtDOM(node: Node, offset?: number): number; + /** + Get the document position at the given screen coordinates. For + positions not covered by the visible viewport's DOM structure, + this will return null, unless `false` is passed as second + argument, in which case it'll return an estimated position that + would be near the coordinates if it were rendered. + */ + posAtCoords(coords: { + x: number; + y: number; + }, precise: false): number; + posAtCoords(coords: { + x: number; + y: number; + }): number | null; + /** + Get the screen coordinates at the given document position. + `side` determines whether the coordinates are based on the + element before (-1) or after (1) the position (if no element is + available on the given side, the method will transparently use + another strategy to get reasonable coordinates). + */ + coordsAtPos(pos: number, side?: -1 | 1): Rect | null; + /** + The default width of a character in the editor. May not + accurately reflect the width of all characters (given variable + width fonts or styling of invididual ranges). + */ + get defaultCharacterWidth(): number; + /** + The default height of a line in the editor. May not be accurate + for all lines. + */ + get defaultLineHeight(): number; + /** + The text direction + ([`direction`](https://developer.mozilla.org/en-US/docs/Web/CSS/direction) + CSS property) of the editor's content element. + */ + get textDirection(): Direction; + /** + Find the text direction of the block at the given position, as + assigned by CSS. If + [`perLineTextDirection`](https://codemirror.net/6/docs/ref/#view.EditorView^perLineTextDirection) + isn't enabled, or the given position is outside of the viewport, + this will always return the same as + [`textDirection`](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection). Note that + this may trigger a DOM layout. + */ + textDirectionAt(pos: number): Direction; + /** + Whether this editor [wraps lines](https://codemirror.net/6/docs/ref/#view.EditorView.lineWrapping) + (as determined by the + [`white-space`](https://developer.mozilla.org/en-US/docs/Web/CSS/white-space) + CSS property of its content element). + */ + get lineWrapping(): boolean; + /** + Returns the bidirectional text structure of the given line + (which should be in the current document) as an array of span + objects. The order of these spans matches the [text + direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection)—if that is + left-to-right, the leftmost spans come first, otherwise the + rightmost spans come first. + */ + bidiSpans(line: Line): readonly BidiSpan[]; + /** + Check whether the editor has focus. + */ + get hasFocus(): boolean; + /** + Put focus on the editor. + */ + focus(): void; + /** + Clean up this editor view, removing its element from the + document, unregistering event handlers, and notifying + plugins. The view instance can no longer be used after + calling this. + */ + destroy(): void; + /** + Returns an effect that can be + [added](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) to a transaction to + cause it to scroll the given position or range into view. + */ + static scrollIntoView(pos: number | SelectionRange, options?: { + /** + By default (`"nearest"`) the position will be vertically + scrolled only the minimal amount required to move the given + position into view. You can set this to `"start"` to move it + to the top of the view, `"end"` to move it to the bottom, or + `"center"` to move it to the center. + */ + y?: ScrollStrategy; + /** + Effect similar to + [`y`](https://codemirror.net/6/docs/ref/#view.EditorView^scrollIntoView^options.y), but for the + horizontal scroll position. + */ + x?: ScrollStrategy; + /** + Extra vertical distance to add when moving something into + view. Not used with the `"center"` strategy. Defaults to 5. + */ + yMargin?: number; + /** + Extra horizontal distance to add. Not used with the `"center"` + strategy. Defaults to 5. + */ + xMargin?: number; + }): StateEffect; + /** + Facet to add a [style + module](https://github.com/marijnh/style-mod#documentation) to + an editor view. The view will ensure that the module is + mounted in its [document + root](https://codemirror.net/6/docs/ref/#view.EditorView.constructor^config.root). + */ + static styleModule: Facet; + /** + Returns an extension that can be used to add DOM event handlers. + The value should be an object mapping event names to handler + functions. For any given event, such functions are ordered by + extension precedence, and the first handler to return true will + be assumed to have handled that event, and no other handlers or + built-in behavior will be activated for it. These are registered + on the [content element](https://codemirror.net/6/docs/ref/#view.EditorView.contentDOM), except + for `scroll` handlers, which will be called any time the + editor's [scroll element](https://codemirror.net/6/docs/ref/#view.EditorView.scrollDOM) or one of + its parent nodes is scrolled. + */ + static domEventHandlers(handlers: DOMEventHandlers): Extension; + /** + An input handler can override the way changes to the editable + DOM content are handled. Handlers are passed the document + positions between which the change was found, and the new + content. When one returns true, no further input handlers are + called and the default behavior is prevented. + */ + static inputHandler: Facet<(view: EditorView, from: number, to: number, text: string) => boolean, readonly ((view: EditorView, from: number, to: number, text: string) => boolean)[]>; + /** + By default, the editor assumes all its content has the same + [text direction](https://codemirror.net/6/docs/ref/#view.Direction). Configure this with a `true` + value to make it read the text direction of every (rendered) + line separately. + */ + static perLineTextDirection: Facet; + /** + Allows you to provide a function that should be called when the + library catches an exception from an extension (mostly from view + plugins, but may be used by other extensions to route exceptions + from user-code-provided callbacks). This is mostly useful for + debugging and logging. See [`logException`](https://codemirror.net/6/docs/ref/#view.logException). + */ + static exceptionSink: Facet<(exception: any) => void, readonly ((exception: any) => void)[]>; + /** + A facet that can be used to register a function to be called + every time the view updates. + */ + static updateListener: Facet<(update: ViewUpdate) => void, readonly ((update: ViewUpdate) => void)[]>; + /** + Facet that controls whether the editor content DOM is editable. + When its highest-precedence value is `false`, the element will + not have its `contenteditable` attribute set. (Note that this + doesn't affect API calls that change the editor content, even + when those are bound to keys or buttons. See the + [`readOnly`](https://codemirror.net/6/docs/ref/#state.EditorState.readOnly) facet for that.) + */ + static editable: Facet; + /** + Allows you to influence the way mouse selection happens. The + functions in this facet will be called for a `mousedown` event + on the editor, and can return an object that overrides the way a + selection is computed from that mouse click or drag. + */ + static mouseSelectionStyle: Facet; + /** + Facet used to configure whether a given selection drag event + should move or copy the selection. The given predicate will be + called with the `mousedown` event, and can return `true` when + the drag should move the content. + */ + static dragMovesSelection: Facet<(event: MouseEvent) => boolean, readonly ((event: MouseEvent) => boolean)[]>; + /** + Facet used to configure whether a given selecting click adds a + new range to the existing selection or replaces it entirely. The + default behavior is to check `event.metaKey` on macOS, and + `event.ctrlKey` elsewhere. + */ + static clickAddsSelectionRange: Facet<(event: MouseEvent) => boolean, readonly ((event: MouseEvent) => boolean)[]>; + /** + A facet that determines which [decorations](https://codemirror.net/6/docs/ref/#view.Decoration) + are shown in the view. Decorations can be provided in two + ways—directly, or via a function that takes an editor view. + + Only decoration sets provided directly are allowed to influence + the editor's vertical layout structure. The ones provided as + functions are called _after_ the new viewport has been computed, + and thus **must not** introduce block widgets or replacing + decorations that cover line breaks. + */ + static decorations: Facet DecorationSet), readonly (DecorationSet | ((view: EditorView) => DecorationSet))[]>; + /** + Used to provide ranges that should be treated as atoms as far as + cursor motion is concerned. This causes methods like + [`moveByChar`](https://codemirror.net/6/docs/ref/#view.EditorView.moveByChar) and + [`moveVertically`](https://codemirror.net/6/docs/ref/#view.EditorView.moveVertically) (and the + commands built on top of them) to skip across such regions when + a selection endpoint would enter them. This does _not_ prevent + direct programmatic [selection + updates](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection) from moving into such + regions. + */ + static atomicRanges: Facet<(view: EditorView) => _codemirror_state.RangeSet, readonly ((view: EditorView) => _codemirror_state.RangeSet)[]>; + /** + Facet that allows extensions to provide additional scroll + margins (space around the sides of the scrolling element that + should be considered invisible). This can be useful when the + plugin introduces elements that cover part of that element (for + example a horizontally fixed gutter). + */ + static scrollMargins: Facet<(view: EditorView) => Partial | null, readonly ((view: EditorView) => Partial | null)[]>; + /** + Create a theme extension. The first argument can be a + [`style-mod`](https://github.com/marijnh/style-mod#documentation) + style spec providing the styles for the theme. These will be + prefixed with a generated class for the style. + + Because the selectors will be prefixed with a scope class, rule + that directly match the editor's [wrapper + element](https://codemirror.net/6/docs/ref/#view.EditorView.dom)—to which the scope class will be + added—need to be explicitly differentiated by adding an `&` to + the selector for that element—for example + `&.cm-focused`. + + When `dark` is set to true, the theme will be marked as dark, + which will cause the `&dark` rules from [base + themes](https://codemirror.net/6/docs/ref/#view.EditorView^baseTheme) to be used (as opposed to + `&light` when a light theme is active). + */ + static theme(spec: { + [selector: string]: StyleSpec; + }, options?: { + dark?: boolean; + }): Extension; + /** + This facet records whether a dark theme is active. The extension + returned by [`theme`](https://codemirror.net/6/docs/ref/#view.EditorView^theme) automatically + includes an instance of this when the `dark` option is set to + true. + */ + static darkTheme: Facet; + /** + Create an extension that adds styles to the base theme. Like + with [`theme`](https://codemirror.net/6/docs/ref/#view.EditorView^theme), use `&` to indicate the + place of the editor wrapper element when directly targeting + that. You can also use `&dark` or `&light` instead to only + target editors with a dark or light theme. + */ + static baseTheme(spec: { + [selector: string]: StyleSpec; + }): Extension; + /** + Facet that provides additional DOM attributes for the editor's + editable DOM element. + */ + static contentAttributes: Facet; + /** + Facet that provides DOM attributes for the editor's outer + element. + */ + static editorAttributes: Facet; + /** + An extension that enables line wrapping in the editor (by + setting CSS `white-space` to `pre-wrap` in the content). + */ + static lineWrapping: Extension; + /** + State effect used to include screen reader announcements in a + transaction. These will be added to the DOM in a visually hidden + element with `aria-live="polite"` set, and should be used to + describe effects that are visually obvious but may not be + noticed by screen reader users (such as moving to the next + search match). + */ + static announce: _codemirror_state.StateEffectType; + /** + Retrieve an editor view instance from the view's DOM + representation. + */ + static findFromDOM(dom: HTMLElement): EditorView | null; +} +/** +Helper type that maps event names to event object types, or the +`any` type for unknown events. +*/ +interface DOMEventMap extends HTMLElementEventMap { + [other: string]: any; +} +/** +Event handlers are specified with objects like this. For event +types known by TypeScript, this will infer the event argument type +to hold the appropriate event object type. For unknown events, it +is inferred to `any`, and should be explicitly set if you want type +checking. +*/ +declare type DOMEventHandlers = { + [event in keyof DOMEventMap]?: (this: This, event: DOMEventMap[event], view: EditorView) => boolean | void; +}; + +/** +Key bindings associate key names with +[command](https://codemirror.net/6/docs/ref/#view.Command)-style functions. + +Key names may be strings like `"Shift-Ctrl-Enter"`—a key identifier +prefixed with zero or more modifiers. Key identifiers are based on +the strings that can appear in +[`KeyEvent.key`](https://developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent/key). +Use lowercase letters to refer to letter keys (or uppercase letters +if you want shift to be held). You may use `"Space"` as an alias +for the `" "` name. + +Modifiers can be given in any order. `Shift-` (or `s-`), `Alt-` (or +`a-`), `Ctrl-` (or `c-` or `Control-`) and `Cmd-` (or `m-` or +`Meta-`) are recognized. + +When a key binding contains multiple key names separated by +spaces, it represents a multi-stroke binding, which will fire when +the user presses the given keys after each other. + +You can use `Mod-` as a shorthand for `Cmd-` on Mac and `Ctrl-` on +other platforms. So `Mod-b` is `Ctrl-b` on Linux but `Cmd-b` on +macOS. +*/ +interface KeyBinding { + /** + The key name to use for this binding. If the platform-specific + property (`mac`, `win`, or `linux`) for the current platform is + used as well in the binding, that one takes precedence. If `key` + isn't defined and the platform-specific binding isn't either, + a binding is ignored. + */ + key?: string; + /** + Key to use specifically on macOS. + */ + mac?: string; + /** + Key to use specifically on Windows. + */ + win?: string; + /** + Key to use specifically on Linux. + */ + linux?: string; + /** + The command to execute when this binding is triggered. When the + command function returns `false`, further bindings will be tried + for the key. + */ + run: Command; + /** + When given, this defines a second binding, using the (possibly + platform-specific) key name prefixed with `Shift-` to activate + this command. + */ + shift?: Command; + /** + By default, key bindings apply when focus is on the editor + content (the `"editor"` scope). Some extensions, mostly those + that define their own panels, might want to allow you to + register bindings local to that panel. Such bindings should use + a custom scope name. You may also assign multiple scope names to + a binding, separating them by spaces. + */ + scope?: string; + /** + When set to true (the default is false), this will always + prevent the further handling for the bound key, even if the + command(s) return false. This can be useful for cases where the + native behavior of the key is annoying or irrelevant but the + command doesn't always apply (such as, Mod-u for undo selection, + which would cause the browser to view source instead when no + selection can be undone). + */ + preventDefault?: boolean; +} +/** +Facet used for registering keymaps. + +You can add multiple keymaps to an editor. Their priorities +determine their precedence (the ones specified early or with high +priority get checked first). When a handler has returned `true` +for a given key, no further handlers are called. +*/ +declare const keymap: Facet; +/** +Run the key handlers registered for a given scope. The event +object should be a `"keydown"` event. Returns true if any of the +handlers handled it. +*/ +declare function runScopeHandlers(view: EditorView, event: KeyboardEvent, scope: string): boolean; + +declare type SelectionConfig = { + /** + The length of a full cursor blink cycle, in milliseconds. + Defaults to 1200. Can be set to 0 to disable blinking. + */ + cursorBlinkRate?: number; + /** + Whether to show a cursor for non-empty ranges. Defaults to + true. + */ + drawRangeCursor?: boolean; +}; +/** +Returns an extension that hides the browser's native selection and +cursor, replacing the selection with a background behind the text +(with the `cm-selectionBackground` class), and the +cursors with elements overlaid over the code (using +`cm-cursor-primary` and `cm-cursor-secondary`). + +This allows the editor to display secondary selection ranges, and +tends to produce a type of selection more in line with that users +expect in a text editor (the native selection styling will often +leave gaps between lines and won't fill the horizontal space after +a line when the selection continues past it). + +It does have a performance cost, in that it requires an extra DOM +layout cycle for many updates (the selection is drawn based on DOM +layout information that's only available after laying out the +content). +*/ +declare function drawSelection(config?: SelectionConfig): Extension; + +/** +Draws a cursor at the current drop position when something is +dragged over the editor. +*/ +declare function dropCursor(): Extension; + +interface SpecialCharConfig { + /** + An optional function that renders the placeholder elements. + + The `description` argument will be text that clarifies what the + character is, which should be provided to screen readers (for + example with the + [`aria-label`](https://www.w3.org/TR/wai-aria/#aria-label) + attribute) and optionally shown to the user in other ways (such + as the + [`title`](https://developer.mozilla.org/en-US/docs/Web/HTML/Global_attributes/title) + attribute). + + The given placeholder string is a suggestion for how to display + the character visually. + */ + render?: ((code: number, description: string | null, placeholder: string) => HTMLElement) | null; + /** + Regular expression that matches the special characters to + highlight. Must have its 'g'/global flag set. + */ + specialChars?: RegExp; + /** + Regular expression that can be used to add characters to the + default set of characters to highlight. + */ + addSpecialChars?: RegExp | null; +} +/** +Returns an extension that installs highlighting of special +characters. +*/ +declare function highlightSpecialChars( +/** +Configuration options. +*/ +config?: SpecialCharConfig): Extension; + +/** +Returns an extension that makes sure the content has a bottom +margin equivalent to the height of the editor, minus one line +height, so that every line in the document can be scrolled to the +top of the editor. + +This is only meaningful when the editor is scrollable, and should +not be enabled in editors that take the size of their content. +*/ +declare function scrollPastEnd(): Extension; + +/** +Mark lines that have a cursor on them with the `"cm-activeLine"` +DOM class. +*/ +declare function highlightActiveLine(): Extension; + +/** +Extension that enables a placeholder—a piece of example content +to show when the editor is empty. +*/ +declare function placeholder(content: string | HTMLElement): Extension; + +/** +Helper class used to make it easier to maintain decorations on +visible code that matches a given regular expression. To be used +in a [view plugin](https://codemirror.net/6/docs/ref/#view.ViewPlugin). Instances of this object +represent a matching configuration. +*/ +declare class MatchDecorator { + private regexp; + private getDeco; + private boundary; + private maxLength; + /** + Create a decorator. + */ + constructor(config: { + /** + The regular expression to match against the content. Will only + be matched inside lines (not across them). Should have its 'g' + flag set. + */ + regexp: RegExp; + /** + The decoration to apply to matches, either directly or as a + function of the match. + */ + decoration: Decoration | ((match: RegExpExecArray, view: EditorView, pos: number) => Decoration); + /** + By default, changed lines are re-matched entirely. You can + provide a boundary expression, which should match single + character strings that can never occur in `regexp`, to reduce + the amount of re-matching. + */ + boundary?: RegExp; + /** + Matching happens by line, by default, but when lines are + folded or very long lines are only partially drawn, the + decorator may avoid matching part of them for speed. This + controls how much additional invisible content it should + include in its matches. Defaults to 1000. + */ + maxLength?: number; + }); + /** + Compute the full set of decorations for matches in the given + view's viewport. You'll want to call this when initializing your + plugin. + */ + createDeco(view: EditorView): _codemirror_state.RangeSet; + /** + Update a set of decorations for a view update. `deco` _must_ be + the set of decorations produced by _this_ `MatchDecorator` for + the view state before the update. + */ + updateDeco(update: ViewUpdate, deco: DecorationSet): DecorationSet; + private updateRange; +} + +/** +Create an extension that enables rectangular selections. By +default, it will react to left mouse drag with the Alt key held +down. When such a selection occurs, the text within the rectangle +that was dragged over will be selected, as one selection +[range](https://codemirror.net/6/docs/ref/#state.SelectionRange) per line. +*/ +declare function rectangularSelection(options?: { + /** + A custom predicate function, which takes a `mousedown` event and + returns true if it should be used for rectangular selection. + */ + eventFilter?: (event: MouseEvent) => boolean; +}): Extension; +/** +Returns an extension that turns the pointer cursor into a +crosshair when a given modifier key, defaulting to Alt, is held +down. Can serve as a visual hint that rectangular selection is +going to happen when paired with +[`rectangularSelection`](https://codemirror.net/6/docs/ref/#view.rectangularSelection). +*/ +declare function crosshairCursor(options?: { + key?: "Alt" | "Control" | "Shift" | "Meta"; +}): Extension; + +/** +Creates an extension that configures tooltip behavior. +*/ +declare function tooltips(config?: { + /** + By default, tooltips use `"fixed"` + [positioning](https://developer.mozilla.org/en-US/docs/Web/CSS/position), + which has the advantage that tooltips don't get cut off by + scrollable parent elements. However, CSS rules like `contain: + layout` can break fixed positioning in child nodes, which can be + worked about by using `"absolute"` here. + + On iOS, which at the time of writing still doesn't properly + support fixed positioning, the library always uses absolute + positioning. + */ + position?: "fixed" | "absolute"; + /** + The element to put the tooltips into. By default, they are put + in the editor (`cm-editor`) element, and that is usually what + you want. But in some layouts that can lead to positioning + issues, and you need to use a different parent to work around + those. + */ + parent?: HTMLElement; + /** + By default, when figuring out whether there is room for a + tooltip at a given position, the extension considers the entire + space between 0,0 and `innerWidth`,`innerHeight` to be available + for showing tooltips. You can provide a function here that + returns an alternative rectangle. + */ + tooltipSpace?: (view: EditorView) => { + top: number; + left: number; + bottom: number; + right: number; + }; +}): Extension; +/** +Describes a tooltip. Values of this type, when provided through +the [`showTooltip`](https://codemirror.net/6/docs/ref/#view.showTooltip) facet, control the +individual tooltips on the editor. +*/ +interface Tooltip { + /** + The document position at which to show the tooltip. + */ + pos: number; + /** + The end of the range annotated by this tooltip, if different + from `pos`. + */ + end?: number; + /** + A constructor function that creates the tooltip's [DOM + representation](https://codemirror.net/6/docs/ref/#view.TooltipView). + */ + create(view: EditorView): TooltipView; + /** + Whether the tooltip should be shown above or below the target + position. Not guaranteed to be respected for hover tooltips + since all hover tooltips for the same range are always + positioned together. Defaults to false. + */ + above?: boolean; + /** + Whether the `above` option should be honored when there isn't + enough space on that side to show the tooltip inside the + viewport. Defaults to false. + */ + strictSide?: boolean; + /** + When set to true, show a triangle connecting the tooltip element + to position `pos`. + */ + arrow?: boolean; +} +/** +Describes the way a tooltip is displayed. +*/ +interface TooltipView { + /** + The DOM element to position over the editor. + */ + dom: HTMLElement; + /** + Adjust the position of the tooltip relative to its anchor + position. A positive `x` value will move the tooltip + horizontally along with the text direction (so right in + left-to-right context, left in right-to-left). A positive `y` + will move the tooltip up when it is above its anchor, and down + otherwise. + */ + offset?: { + x: number; + y: number; + }; + /** + By default, a tooltip's screen position will be based on the + text position of its `pos` property. This method can be provided + to make the tooltip view itself responsible for finding its + screen position. + */ + getCoords?: (pos: number) => Rect; + /** + By default, tooltips are moved when they overlap with other + tooltips. Set this to `true` to disable that behavior for this + tooltip. + */ + overlap?: boolean; + /** + Called after the tooltip is added to the DOM for the first time. + */ + mount?(view: EditorView): void; + /** + Update the DOM element for a change in the view's state. + */ + update?(update: ViewUpdate): void; + /** + Called when the tooltip has been (re)positioned. + */ + positioned?(): void; +} +/** +Facet to which an extension can add a value to show a tooltip. +*/ +declare const showTooltip: Facet; +/** +Set up a hover tooltip, which shows up when the pointer hovers +over ranges of text. The callback is called when the mouse hovers +over the document text. It should, if there is a tooltip +associated with position `pos`, return the tooltip description +(either directly or in a promise). The `side` argument indicates +on which side of the position the pointer is—it will be -1 if the +pointer is before the position, 1 if after the position. + +Note that all hover tooltips are hosted within a single tooltip +container element. This allows multiple tooltips over the same +range to be "merged" together without overlapping. +*/ +declare function hoverTooltip(source: (view: EditorView, pos: number, side: -1 | 1) => Tooltip | null | Promise, options?: { + /** + Controls whether a transaction hides the tooltip. The default + is to not hide. + */ + hideOn?: (tr: Transaction, tooltip: Tooltip) => boolean; + /** + When enabled (this defaults to false), close the tooltip + whenever the document changes or the selection is set. + */ + hideOnChange?: boolean | "touch"; + /** + Hover time after which the tooltip should appear, in + milliseconds. Defaults to 300ms. + */ + hoverTime?: number; +}): Extension; +/** +Get the active tooltip view for a given tooltip, if available. +*/ +declare function getTooltip(view: EditorView, tooltip: Tooltip): TooltipView | null; +/** +Returns true if any hover tooltips are currently active. +*/ +declare function hasHoverTooltips(state: EditorState): boolean; +/** +Transaction effect that closes all hover tooltips. +*/ +declare const closeHoverTooltips: StateEffect; +/** +Tell the tooltip extension to recompute the position of the active +tooltips. This can be useful when something happens (such as a +re-positioning or CSS change affecting the editor) that could +invalidate the existing tooltip positions. +*/ +declare function repositionTooltips(view: EditorView): void; + +declare type PanelConfig = { + /** + By default, panels will be placed inside the editor's DOM + structure. You can use this option to override where panels with + `top: true` are placed. + */ + topContainer?: HTMLElement; + /** + Override where panels with `top: false` are placed. + */ + bottomContainer?: HTMLElement; +}; +/** +Configures the panel-managing extension. +*/ +declare function panels(config?: PanelConfig): Extension; +/** +Object that describes an active panel. +*/ +interface Panel { + /** + The element representing this panel. The library will add the + `"cm-panel"` DOM class to this. + */ + dom: HTMLElement; + /** + Optionally called after the panel has been added to the editor. + */ + mount?(): void; + /** + Update the DOM for a given view update. + */ + update?(update: ViewUpdate): void; + /** + Called when the panel is removed from the editor or the editor + is destroyed. + */ + destroy?(): void; + /** + Whether the panel should be at the top or bottom of the editor. + Defaults to false. + */ + top?: boolean; +} +/** +Get the active panel created by the given constructor, if any. +This can be useful when you need access to your panels' DOM +structure. +*/ +declare function getPanel(view: EditorView, panel: PanelConstructor): Panel | null; +/** +A function that initializes a panel. Used in +[`showPanel`](https://codemirror.net/6/docs/ref/#view.showPanel). +*/ +declare type PanelConstructor = (view: EditorView) => Panel; +/** +Opening a panel is done by providing a constructor function for +the panel through this facet. (The panel is closed again when its +constructor is no longer provided.) Values of `null` are ignored. +*/ +declare const showPanel: Facet; + +/** +A gutter marker represents a bit of information attached to a line +in a specific gutter. Your own custom markers have to extend this +class. +*/ +declare abstract class GutterMarker extends RangeValue { + /** + Compare this marker to another marker of the same type. + */ + eq(other: GutterMarker): boolean; + /** + Render the DOM node for this marker, if any. + */ + toDOM?(view: EditorView): Node; + /** + This property can be used to add CSS classes to the gutter + element that contains this marker. + */ + elementClass: string; + /** + Called if the marker has a `toDOM` method and its representation + was removed from a gutter. + */ + destroy(dom: Node): void; +} +/** +Facet used to add a class to all gutter elements for a given line. +Markers given to this facet should _only_ define an +[`elementclass`](https://codemirror.net/6/docs/ref/#view.GutterMarker.elementClass), not a +[`toDOM`](https://codemirror.net/6/docs/ref/#view.GutterMarker.toDOM) (or the marker will appear +in all gutters for the line). +*/ +declare const gutterLineClass: Facet, readonly RangeSet[]>; +declare type Handlers = { + [event: string]: (view: EditorView, line: BlockInfo, event: Event) => boolean; +}; +interface GutterConfig { + /** + An extra CSS class to be added to the wrapper (`cm-gutter`) + element. + */ + class?: string; + /** + Controls whether empty gutter elements should be rendered. + Defaults to false. + */ + renderEmptyElements?: boolean; + /** + Retrieve a set of markers to use in this gutter. + */ + markers?: (view: EditorView) => (RangeSet | readonly RangeSet[]); + /** + Can be used to optionally add a single marker to every line. + */ + lineMarker?: (view: EditorView, line: BlockInfo, otherMarkers: readonly GutterMarker[]) => GutterMarker | null; + /** + If line markers depend on additional state, and should be + updated when that changes, pass a predicate here that checks + whether a given view update might change the line markers. + */ + lineMarkerChange?: null | ((update: ViewUpdate) => boolean); + /** + Add a hidden spacer element that gives the gutter its base + width. + */ + initialSpacer?: null | ((view: EditorView) => GutterMarker); + /** + Update the spacer element when the view is updated. + */ + updateSpacer?: null | ((spacer: GutterMarker, update: ViewUpdate) => GutterMarker); + /** + Supply event handlers for DOM events on this gutter. + */ + domEventHandlers?: Handlers; +} +/** +Define an editor gutter. The order in which the gutters appear is +determined by their extension priority. +*/ +declare function gutter(config: GutterConfig): Extension; +/** +The gutter-drawing plugin is automatically enabled when you add a +gutter, but you can use this function to explicitly configure it. + +Unless `fixed` is explicitly set to `false`, the gutters are +fixed, meaning they don't scroll along with the content +horizontally (except on Internet Explorer, which doesn't support +CSS [`position: +sticky`](https://developer.mozilla.org/en-US/docs/Web/CSS/position#sticky)). +*/ +declare function gutters(config?: { + fixed?: boolean; +}): Extension; +interface LineNumberConfig { + /** + How to display line numbers. Defaults to simply converting them + to string. + */ + formatNumber?: (lineNo: number, state: EditorState) => string; + /** + Supply event handlers for DOM events on this gutter. + */ + domEventHandlers?: Handlers; +} +/** +Facet used to provide markers to the line number gutter. +*/ +declare const lineNumberMarkers: Facet, readonly RangeSet[]>; +/** +Create a line number gutter extension. +*/ +declare function lineNumbers(config?: LineNumberConfig): Extension; +/** +Returns an extension that adds a `cm-activeLineGutter` class to +all gutter elements on the [active +line](https://codemirror.net/6/docs/ref/#view.highlightActiveLine). +*/ +declare function highlightActiveLineGutter(): Extension; + +export { BidiSpan, BlockInfo, BlockType, Command, DOMEventHandlers, DOMEventMap, Decoration, DecorationSet, Direction, EditorView, EditorViewConfig, GutterMarker, KeyBinding, MatchDecorator, MouseSelectionStyle, Panel, PanelConstructor, PluginSpec, PluginValue, Rect, Tooltip, TooltipView, ViewPlugin, ViewUpdate, WidgetType, closeHoverTooltips, crosshairCursor, drawSelection, dropCursor, getPanel, getTooltip, gutter, gutterLineClass, gutters, hasHoverTooltips, highlightActiveLine, highlightActiveLineGutter, highlightSpecialChars, hoverTooltip, keymap, lineNumberMarkers, lineNumbers, logException, panels, placeholder, rectangularSelection, repositionTooltips, runScopeHandlers, scrollPastEnd, showPanel, showTooltip, tooltips }; diff --git a/node_modules/@codemirror/view/dist/index.js b/node_modules/@codemirror/view/dist/index.js new file mode 100644 index 0000000000..2ed98c8b30 --- /dev/null +++ b/node_modules/@codemirror/view/dist/index.js @@ -0,0 +1,8978 @@ +import { Text, RangeSet, MapMode, RangeValue, Facet, StateEffect, ChangeSet, findClusterBreak, EditorSelection, EditorState, findColumn, CharCategory, Prec, Transaction, combineConfig, StateField, RangeSetBuilder, codePointAt, countColumn } from '@codemirror/state'; +import { StyleModule } from 'style-mod'; +import { keyName, base } from 'w3c-keyname'; + +function getSelection(root) { + let target; + // Browsers differ on whether shadow roots have a getSelection + // method. If it exists, use that, otherwise, call it on the + // document. + if (root.nodeType == 11) { // Shadow root + target = root.getSelection ? root : root.ownerDocument; + } + else { + target = root; + } + return target.getSelection(); +} +function contains(dom, node) { + return node ? dom == node || dom.contains(node.nodeType != 1 ? node.parentNode : node) : false; +} +function deepActiveElement() { + let elt = document.activeElement; + while (elt && elt.shadowRoot) + elt = elt.shadowRoot.activeElement; + return elt; +} +function hasSelection(dom, selection) { + if (!selection.anchorNode) + return false; + try { + // Firefox will raise 'permission denied' errors when accessing + // properties of `sel.anchorNode` when it's in a generated CSS + // element. + return contains(dom, selection.anchorNode); + } + catch (_) { + return false; + } +} +function clientRectsFor(dom) { + if (dom.nodeType == 3) + return textRange(dom, 0, dom.nodeValue.length).getClientRects(); + else if (dom.nodeType == 1) + return dom.getClientRects(); + else + return []; +} +// Scans forward and backward through DOM positions equivalent to the +// given one to see if the two are in the same place (i.e. after a +// text node vs at the end of that text node) +function isEquivalentPosition(node, off, targetNode, targetOff) { + return targetNode ? (scanFor(node, off, targetNode, targetOff, -1) || + scanFor(node, off, targetNode, targetOff, 1)) : false; +} +function domIndex(node) { + for (var index = 0;; index++) { + node = node.previousSibling; + if (!node) + return index; + } +} +function scanFor(node, off, targetNode, targetOff, dir) { + for (;;) { + if (node == targetNode && off == targetOff) + return true; + if (off == (dir < 0 ? 0 : maxOffset(node))) { + if (node.nodeName == "DIV") + return false; + let parent = node.parentNode; + if (!parent || parent.nodeType != 1) + return false; + off = domIndex(node) + (dir < 0 ? 0 : 1); + node = parent; + } + else if (node.nodeType == 1) { + node = node.childNodes[off + (dir < 0 ? -1 : 0)]; + if (node.nodeType == 1 && node.contentEditable == "false") + return false; + off = dir < 0 ? maxOffset(node) : 0; + } + else { + return false; + } + } +} +function maxOffset(node) { + return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length; +} +const Rect0 = { left: 0, right: 0, top: 0, bottom: 0 }; +function flattenRect(rect, left) { + let x = left ? rect.left : rect.right; + return { left: x, right: x, top: rect.top, bottom: rect.bottom }; +} +function windowRect(win) { + return { left: 0, right: win.innerWidth, + top: 0, bottom: win.innerHeight }; +} +function scrollRectIntoView(dom, rect, side, x, y, xMargin, yMargin, ltr) { + let doc = dom.ownerDocument, win = doc.defaultView; + for (let cur = dom; cur;) { + if (cur.nodeType == 1) { // Element + let bounding, top = cur == doc.body; + if (top) { + bounding = windowRect(win); + } + else { + if (cur.scrollHeight <= cur.clientHeight && cur.scrollWidth <= cur.clientWidth) { + cur = cur.parentNode; + continue; + } + let rect = cur.getBoundingClientRect(); + // Make sure scrollbar width isn't included in the rectangle + bounding = { left: rect.left, right: rect.left + cur.clientWidth, + top: rect.top, bottom: rect.top + cur.clientHeight }; + } + let moveX = 0, moveY = 0; + if (y == "nearest") { + if (rect.top < bounding.top) { + moveY = -(bounding.top - rect.top + yMargin); + if (side > 0 && rect.bottom > bounding.bottom + moveY) + moveY = rect.bottom - bounding.bottom + moveY + yMargin; + } + else if (rect.bottom > bounding.bottom) { + moveY = rect.bottom - bounding.bottom + yMargin; + if (side < 0 && (rect.top - moveY) < bounding.top) + moveY = -(bounding.top + moveY - rect.top + yMargin); + } + } + else { + let rectHeight = rect.bottom - rect.top, boundingHeight = bounding.bottom - bounding.top; + let targetTop = y == "center" && rectHeight <= boundingHeight ? rect.top + rectHeight / 2 - boundingHeight / 2 : + y == "start" || y == "center" && side < 0 ? rect.top - yMargin : + rect.bottom - boundingHeight + yMargin; + moveY = targetTop - bounding.top; + } + if (x == "nearest") { + if (rect.left < bounding.left) { + moveX = -(bounding.left - rect.left + xMargin); + if (side > 0 && rect.right > bounding.right + moveX) + moveX = rect.right - bounding.right + moveX + xMargin; + } + else if (rect.right > bounding.right) { + moveX = rect.right - bounding.right + xMargin; + if (side < 0 && rect.left < bounding.left + moveX) + moveX = -(bounding.left + moveX - rect.left + xMargin); + } + } + else { + let targetLeft = x == "center" ? rect.left + (rect.right - rect.left) / 2 - (bounding.right - bounding.left) / 2 : + (x == "start") == ltr ? rect.left - xMargin : + rect.right - (bounding.right - bounding.left) + xMargin; + moveX = targetLeft - bounding.left; + } + if (moveX || moveY) { + if (top) { + win.scrollBy(moveX, moveY); + } + else { + if (moveY) { + let start = cur.scrollTop; + cur.scrollTop += moveY; + moveY = cur.scrollTop - start; + } + if (moveX) { + let start = cur.scrollLeft; + cur.scrollLeft += moveX; + moveX = cur.scrollLeft - start; + } + rect = { left: rect.left - moveX, top: rect.top - moveY, + right: rect.right - moveX, bottom: rect.bottom - moveY }; + } + } + if (top) + break; + cur = cur.assignedSlot || cur.parentNode; + x = y = "nearest"; + } + else if (cur.nodeType == 11) { // A shadow root + cur = cur.host; + } + else { + break; + } + } +} +class DOMSelectionState { + constructor() { + this.anchorNode = null; + this.anchorOffset = 0; + this.focusNode = null; + this.focusOffset = 0; + } + eq(domSel) { + return this.anchorNode == domSel.anchorNode && this.anchorOffset == domSel.anchorOffset && + this.focusNode == domSel.focusNode && this.focusOffset == domSel.focusOffset; + } + setRange(range) { + this.set(range.anchorNode, range.anchorOffset, range.focusNode, range.focusOffset); + } + set(anchorNode, anchorOffset, focusNode, focusOffset) { + this.anchorNode = anchorNode; + this.anchorOffset = anchorOffset; + this.focusNode = focusNode; + this.focusOffset = focusOffset; + } +} +let preventScrollSupported = null; +// Feature-detects support for .focus({preventScroll: true}), and uses +// a fallback kludge when not supported. +function focusPreventScroll(dom) { + if (dom.setActive) + return dom.setActive(); // in IE + if (preventScrollSupported) + return dom.focus(preventScrollSupported); + let stack = []; + for (let cur = dom; cur; cur = cur.parentNode) { + stack.push(cur, cur.scrollTop, cur.scrollLeft); + if (cur == cur.ownerDocument) + break; + } + dom.focus(preventScrollSupported == null ? { + get preventScroll() { + preventScrollSupported = { preventScroll: true }; + return true; + } + } : undefined); + if (!preventScrollSupported) { + preventScrollSupported = false; + for (let i = 0; i < stack.length;) { + let elt = stack[i++], top = stack[i++], left = stack[i++]; + if (elt.scrollTop != top) + elt.scrollTop = top; + if (elt.scrollLeft != left) + elt.scrollLeft = left; + } + } +} +let scratchRange; +function textRange(node, from, to = from) { + let range = scratchRange || (scratchRange = document.createRange()); + range.setEnd(node, to); + range.setStart(node, from); + return range; +} +function dispatchKey(elt, name, code) { + let options = { key: name, code: name, keyCode: code, which: code, cancelable: true }; + let down = new KeyboardEvent("keydown", options); + down.synthetic = true; + elt.dispatchEvent(down); + let up = new KeyboardEvent("keyup", options); + up.synthetic = true; + elt.dispatchEvent(up); + return down.defaultPrevented || up.defaultPrevented; +} +function getRoot(node) { + while (node) { + if (node && (node.nodeType == 9 || node.nodeType == 11 && node.host)) + return node; + node = node.assignedSlot || node.parentNode; + } + return null; +} +function clearAttributes(node) { + while (node.attributes.length) + node.removeAttributeNode(node.attributes[0]); +} + +class DOMPos { + constructor(node, offset, precise = true) { + this.node = node; + this.offset = offset; + this.precise = precise; + } + static before(dom, precise) { return new DOMPos(dom.parentNode, domIndex(dom), precise); } + static after(dom, precise) { return new DOMPos(dom.parentNode, domIndex(dom) + 1, precise); } +} +const noChildren = []; +class ContentView { + constructor() { + this.parent = null; + this.dom = null; + this.dirty = 2 /* Node */; + } + get editorView() { + if (!this.parent) + throw new Error("Accessing view in orphan content view"); + return this.parent.editorView; + } + get overrideDOMText() { return null; } + get posAtStart() { + return this.parent ? this.parent.posBefore(this) : 0; + } + get posAtEnd() { + return this.posAtStart + this.length; + } + posBefore(view) { + let pos = this.posAtStart; + for (let child of this.children) { + if (child == view) + return pos; + pos += child.length + child.breakAfter; + } + throw new RangeError("Invalid child in posBefore"); + } + posAfter(view) { + return this.posBefore(view) + view.length; + } + // Will return a rectangle directly before (when side < 0), after + // (side > 0) or directly on (when the browser supports it) the + // given position. + coordsAt(_pos, _side) { return null; } + sync(track) { + if (this.dirty & 2 /* Node */) { + let parent = this.dom; + let prev = null, next; + for (let child of this.children) { + if (child.dirty) { + if (!child.dom && (next = prev ? prev.nextSibling : parent.firstChild)) { + let contentView = ContentView.get(next); + if (!contentView || !contentView.parent && contentView.constructor == child.constructor) + child.reuseDOM(next); + } + child.sync(track); + child.dirty = 0 /* Not */; + } + next = prev ? prev.nextSibling : parent.firstChild; + if (track && !track.written && track.node == parent && next != child.dom) + track.written = true; + if (child.dom.parentNode == parent) { + while (next && next != child.dom) + next = rm$1(next); + } + else { + parent.insertBefore(child.dom, next); + } + prev = child.dom; + } + next = prev ? prev.nextSibling : parent.firstChild; + if (next && track && track.node == parent) + track.written = true; + while (next) + next = rm$1(next); + } + else if (this.dirty & 1 /* Child */) { + for (let child of this.children) + if (child.dirty) { + child.sync(track); + child.dirty = 0 /* Not */; + } + } + } + reuseDOM(_dom) { } + localPosFromDOM(node, offset) { + let after; + if (node == this.dom) { + after = this.dom.childNodes[offset]; + } + else { + let bias = maxOffset(node) == 0 ? 0 : offset == 0 ? -1 : 1; + for (;;) { + let parent = node.parentNode; + if (parent == this.dom) + break; + if (bias == 0 && parent.firstChild != parent.lastChild) { + if (node == parent.firstChild) + bias = -1; + else + bias = 1; + } + node = parent; + } + if (bias < 0) + after = node; + else + after = node.nextSibling; + } + if (after == this.dom.firstChild) + return 0; + while (after && !ContentView.get(after)) + after = after.nextSibling; + if (!after) + return this.length; + for (let i = 0, pos = 0;; i++) { + let child = this.children[i]; + if (child.dom == after) + return pos; + pos += child.length + child.breakAfter; + } + } + domBoundsAround(from, to, offset = 0) { + let fromI = -1, fromStart = -1, toI = -1, toEnd = -1; + for (let i = 0, pos = offset, prevEnd = offset; i < this.children.length; i++) { + let child = this.children[i], end = pos + child.length; + if (pos < from && end > to) + return child.domBoundsAround(from, to, pos); + if (end >= from && fromI == -1) { + fromI = i; + fromStart = pos; + } + if (pos > to && child.dom.parentNode == this.dom) { + toI = i; + toEnd = prevEnd; + break; + } + prevEnd = end; + pos = end + child.breakAfter; + } + return { from: fromStart, to: toEnd < 0 ? offset + this.length : toEnd, + startDOM: (fromI ? this.children[fromI - 1].dom.nextSibling : null) || this.dom.firstChild, + endDOM: toI < this.children.length && toI >= 0 ? this.children[toI].dom : null }; + } + markDirty(andParent = false) { + this.dirty |= 2 /* Node */; + this.markParentsDirty(andParent); + } + markParentsDirty(childList) { + for (let parent = this.parent; parent; parent = parent.parent) { + if (childList) + parent.dirty |= 2 /* Node */; + if (parent.dirty & 1 /* Child */) + return; + parent.dirty |= 1 /* Child */; + childList = false; + } + } + setParent(parent) { + if (this.parent != parent) { + this.parent = parent; + if (this.dirty) + this.markParentsDirty(true); + } + } + setDOM(dom) { + if (this.dom) + this.dom.cmView = null; + this.dom = dom; + dom.cmView = this; + } + get rootView() { + for (let v = this;;) { + let parent = v.parent; + if (!parent) + return v; + v = parent; + } + } + replaceChildren(from, to, children = noChildren) { + this.markDirty(); + for (let i = from; i < to; i++) { + let child = this.children[i]; + if (child.parent == this) + child.destroy(); + } + this.children.splice(from, to - from, ...children); + for (let i = 0; i < children.length; i++) + children[i].setParent(this); + } + ignoreMutation(_rec) { return false; } + ignoreEvent(_event) { return false; } + childCursor(pos = this.length) { + return new ChildCursor(this.children, pos, this.children.length); + } + childPos(pos, bias = 1) { + return this.childCursor().findPos(pos, bias); + } + toString() { + let name = this.constructor.name.replace("View", ""); + return name + (this.children.length ? "(" + this.children.join() + ")" : + this.length ? "[" + (name == "Text" ? this.text : this.length) + "]" : "") + + (this.breakAfter ? "#" : ""); + } + static get(node) { return node.cmView; } + get isEditable() { return true; } + merge(from, to, source, hasStart, openStart, openEnd) { + return false; + } + become(other) { return false; } + // When this is a zero-length view with a side, this should return a + // number <= 0 to indicate it is before its position, or a + // number > 0 when after its position. + getSide() { return 0; } + destroy() { + this.parent = null; + } +} +ContentView.prototype.breakAfter = 0; +// Remove a DOM node and return its next sibling. +function rm$1(dom) { + let next = dom.nextSibling; + dom.parentNode.removeChild(dom); + return next; +} +class ChildCursor { + constructor(children, pos, i) { + this.children = children; + this.pos = pos; + this.i = i; + this.off = 0; + } + findPos(pos, bias = 1) { + for (;;) { + if (pos > this.pos || pos == this.pos && + (bias > 0 || this.i == 0 || this.children[this.i - 1].breakAfter)) { + this.off = pos - this.pos; + return this; + } + let next = this.children[--this.i]; + this.pos -= next.length + next.breakAfter; + } + } +} +function replaceRange(parent, fromI, fromOff, toI, toOff, insert, breakAtStart, openStart, openEnd) { + let { children } = parent; + let before = children.length ? children[fromI] : null; + let last = insert.length ? insert[insert.length - 1] : null; + let breakAtEnd = last ? last.breakAfter : breakAtStart; + // Change within a single child + if (fromI == toI && before && !breakAtStart && !breakAtEnd && insert.length < 2 && + before.merge(fromOff, toOff, insert.length ? last : null, fromOff == 0, openStart, openEnd)) + return; + if (toI < children.length) { + let after = children[toI]; + // Make sure the end of the child after the update is preserved in `after` + if (after && toOff < after.length) { + // If we're splitting a child, separate part of it to avoid that + // being mangled when updating the child before the update. + if (fromI == toI) { + after = after.split(toOff); + toOff = 0; + } + // If the element after the replacement should be merged with + // the last replacing element, update `content` + if (!breakAtEnd && last && after.merge(0, toOff, last, true, 0, openEnd)) { + insert[insert.length - 1] = after; + } + else { + // Remove the start of the after element, if necessary, and + // add it to `content`. + if (toOff) + after.merge(0, toOff, null, false, 0, openEnd); + insert.push(after); + } + } + else if (after === null || after === void 0 ? void 0 : after.breakAfter) { + // The element at `toI` is entirely covered by this range. + // Preserve its line break, if any. + if (last) + last.breakAfter = 1; + else + breakAtStart = 1; + } + // Since we've handled the next element from the current elements + // now, make sure `toI` points after that. + toI++; + } + if (before) { + before.breakAfter = breakAtStart; + if (fromOff > 0) { + if (!breakAtStart && insert.length && before.merge(fromOff, before.length, insert[0], false, openStart, 0)) { + before.breakAfter = insert.shift().breakAfter; + } + else if (fromOff < before.length || before.children.length && before.children[before.children.length - 1].length == 0) { + before.merge(fromOff, before.length, null, false, openStart, 0); + } + fromI++; + } + } + // Try to merge widgets on the boundaries of the replacement + while (fromI < toI && insert.length) { + if (children[toI - 1].become(insert[insert.length - 1])) { + toI--; + insert.pop(); + openEnd = insert.length ? 0 : openStart; + } + else if (children[fromI].become(insert[0])) { + fromI++; + insert.shift(); + openStart = insert.length ? 0 : openEnd; + } + else { + break; + } + } + if (!insert.length && fromI && toI < children.length && !children[fromI - 1].breakAfter && + children[toI].merge(0, 0, children[fromI - 1], false, openStart, openEnd)) + fromI--; + if (fromI < toI || insert.length) + parent.replaceChildren(fromI, toI, insert); +} +function mergeChildrenInto(parent, from, to, insert, openStart, openEnd) { + let cur = parent.childCursor(); + let { i: toI, off: toOff } = cur.findPos(to, 1); + let { i: fromI, off: fromOff } = cur.findPos(from, -1); + let dLen = from - to; + for (let view of insert) + dLen += view.length; + parent.length += dLen; + replaceRange(parent, fromI, fromOff, toI, toOff, insert, 0, openStart, openEnd); +} + +let nav = typeof navigator != "undefined" ? navigator : { userAgent: "", vendor: "", platform: "" }; +let doc = typeof document != "undefined" ? document : { documentElement: { style: {} } }; +const ie_edge = /*@__PURE__*//Edge\/(\d+)/.exec(nav.userAgent); +const ie_upto10 = /*@__PURE__*//MSIE \d/.test(nav.userAgent); +const ie_11up = /*@__PURE__*//Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(nav.userAgent); +const ie = !!(ie_upto10 || ie_11up || ie_edge); +const gecko = !ie && /*@__PURE__*//gecko\/(\d+)/i.test(nav.userAgent); +const chrome = !ie && /*@__PURE__*//Chrome\/(\d+)/.exec(nav.userAgent); +const webkit = "webkitFontSmoothing" in doc.documentElement.style; +const safari = !ie && /*@__PURE__*//Apple Computer/.test(nav.vendor); +const ios = safari && (/*@__PURE__*//Mobile\/\w+/.test(nav.userAgent) || nav.maxTouchPoints > 2); +var browser = { + mac: ios || /*@__PURE__*//Mac/.test(nav.platform), + windows: /*@__PURE__*//Win/.test(nav.platform), + linux: /*@__PURE__*//Linux|X11/.test(nav.platform), + ie, + ie_version: ie_upto10 ? doc.documentMode || 6 : ie_11up ? +ie_11up[1] : ie_edge ? +ie_edge[1] : 0, + gecko, + gecko_version: gecko ? +(/*@__PURE__*//Firefox\/(\d+)/.exec(nav.userAgent) || [0, 0])[1] : 0, + chrome: !!chrome, + chrome_version: chrome ? +chrome[1] : 0, + ios, + android: /*@__PURE__*//Android\b/.test(nav.userAgent), + webkit, + safari, + webkit_version: webkit ? +(/*@__PURE__*//\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0, + tabSize: doc.documentElement.style.tabSize != null ? "tab-size" : "-moz-tab-size" +}; + +const MaxJoinLen = 256; +class TextView extends ContentView { + constructor(text) { + super(); + this.text = text; + } + get length() { return this.text.length; } + createDOM(textDOM) { + this.setDOM(textDOM || document.createTextNode(this.text)); + } + sync(track) { + if (!this.dom) + this.createDOM(); + if (this.dom.nodeValue != this.text) { + if (track && track.node == this.dom) + track.written = true; + this.dom.nodeValue = this.text; + } + } + reuseDOM(dom) { + if (dom.nodeType == 3) + this.createDOM(dom); + } + merge(from, to, source) { + if (source && (!(source instanceof TextView) || this.length - (to - from) + source.length > MaxJoinLen)) + return false; + this.text = this.text.slice(0, from) + (source ? source.text : "") + this.text.slice(to); + this.markDirty(); + return true; + } + split(from) { + let result = new TextView(this.text.slice(from)); + this.text = this.text.slice(0, from); + this.markDirty(); + return result; + } + localPosFromDOM(node, offset) { + return node == this.dom ? offset : offset ? this.text.length : 0; + } + domAtPos(pos) { return new DOMPos(this.dom, pos); } + domBoundsAround(_from, _to, offset) { + return { from: offset, to: offset + this.length, startDOM: this.dom, endDOM: this.dom.nextSibling }; + } + coordsAt(pos, side) { + return textCoords(this.dom, pos, side); + } +} +class MarkView extends ContentView { + constructor(mark, children = [], length = 0) { + super(); + this.mark = mark; + this.children = children; + this.length = length; + for (let ch of children) + ch.setParent(this); + } + setAttrs(dom) { + clearAttributes(dom); + if (this.mark.class) + dom.className = this.mark.class; + if (this.mark.attrs) + for (let name in this.mark.attrs) + dom.setAttribute(name, this.mark.attrs[name]); + return dom; + } + reuseDOM(node) { + if (node.nodeName == this.mark.tagName.toUpperCase()) { + this.setDOM(node); + this.dirty |= 4 /* Attrs */ | 2 /* Node */; + } + } + sync(track) { + if (!this.dom) + this.setDOM(this.setAttrs(document.createElement(this.mark.tagName))); + else if (this.dirty & 4 /* Attrs */) + this.setAttrs(this.dom); + super.sync(track); + } + merge(from, to, source, _hasStart, openStart, openEnd) { + if (source && (!(source instanceof MarkView && source.mark.eq(this.mark)) || + (from && openStart <= 0) || (to < this.length && openEnd <= 0))) + return false; + mergeChildrenInto(this, from, to, source ? source.children : [], openStart - 1, openEnd - 1); + this.markDirty(); + return true; + } + split(from) { + let result = [], off = 0, detachFrom = -1, i = 0; + for (let elt of this.children) { + let end = off + elt.length; + if (end > from) + result.push(off < from ? elt.split(from - off) : elt); + if (detachFrom < 0 && off >= from) + detachFrom = i; + off = end; + i++; + } + let length = this.length - from; + this.length = from; + if (detachFrom > -1) { + this.children.length = detachFrom; + this.markDirty(); + } + return new MarkView(this.mark, result, length); + } + domAtPos(pos) { + return inlineDOMAtPos(this.dom, this.children, pos); + } + coordsAt(pos, side) { + return coordsInChildren(this, pos, side); + } +} +function textCoords(text, pos, side) { + let length = text.nodeValue.length; + if (pos > length) + pos = length; + let from = pos, to = pos, flatten = 0; + if (pos == 0 && side < 0 || pos == length && side >= 0) { + if (!(browser.chrome || browser.gecko)) { // These browsers reliably return valid rectangles for empty ranges + if (pos) { + from--; + flatten = 1; + } // FIXME this is wrong in RTL text + else if (to < length) { + to++; + flatten = -1; + } + } + } + else { + if (side < 0) + from--; + else if (to < length) + to++; + } + let rects = textRange(text, from, to).getClientRects(); + if (!rects.length) + return Rect0; + let rect = rects[(flatten ? flatten < 0 : side >= 0) ? 0 : rects.length - 1]; + if (browser.safari && !flatten && rect.width == 0) + rect = Array.prototype.find.call(rects, r => r.width) || rect; + return flatten ? flattenRect(rect, flatten < 0) : rect || null; +} +// Also used for collapsed ranges that don't have a placeholder widget! +class WidgetView extends ContentView { + constructor(widget, length, side) { + super(); + this.widget = widget; + this.length = length; + this.side = side; + this.prevWidget = null; + } + static create(widget, length, side) { + return new (widget.customView || WidgetView)(widget, length, side); + } + split(from) { + let result = WidgetView.create(this.widget, this.length - from, this.side); + this.length -= from; + return result; + } + sync() { + if (!this.dom || !this.widget.updateDOM(this.dom)) { + if (this.dom && this.prevWidget) + this.prevWidget.destroy(this.dom); + this.prevWidget = null; + this.setDOM(this.widget.toDOM(this.editorView)); + this.dom.contentEditable = "false"; + } + } + getSide() { return this.side; } + merge(from, to, source, hasStart, openStart, openEnd) { + if (source && (!(source instanceof WidgetView) || !this.widget.compare(source.widget) || + from > 0 && openStart <= 0 || to < this.length && openEnd <= 0)) + return false; + this.length = from + (source ? source.length : 0) + (this.length - to); + return true; + } + become(other) { + if (other.length == this.length && other instanceof WidgetView && other.side == this.side) { + if (this.widget.constructor == other.widget.constructor) { + if (!this.widget.eq(other.widget)) + this.markDirty(true); + if (this.dom && !this.prevWidget) + this.prevWidget = this.widget; + this.widget = other.widget; + return true; + } + } + return false; + } + ignoreMutation() { return true; } + ignoreEvent(event) { return this.widget.ignoreEvent(event); } + get overrideDOMText() { + if (this.length == 0) + return Text.empty; + let top = this; + while (top.parent) + top = top.parent; + let view = top.editorView, text = view && view.state.doc, start = this.posAtStart; + return text ? text.slice(start, start + this.length) : Text.empty; + } + domAtPos(pos) { + return pos == 0 ? DOMPos.before(this.dom) : DOMPos.after(this.dom, pos == this.length); + } + domBoundsAround() { return null; } + coordsAt(pos, side) { + let rects = this.dom.getClientRects(), rect = null; + if (!rects.length) + return Rect0; + for (let i = pos > 0 ? rects.length - 1 : 0;; i += (pos > 0 ? -1 : 1)) { + rect = rects[i]; + if (pos > 0 ? i == 0 : i == rects.length - 1 || rect.top < rect.bottom) + break; + } + return (pos == 0 && side > 0 || pos == this.length && side <= 0) ? rect : flattenRect(rect, pos == 0); + } + get isEditable() { return false; } + destroy() { + super.destroy(); + if (this.dom) + this.widget.destroy(this.dom); + } +} +class CompositionView extends WidgetView { + domAtPos(pos) { + let { topView, text } = this.widget; + if (!topView) + return new DOMPos(text, Math.min(pos, text.nodeValue.length)); + return scanCompositionTree(pos, 0, topView, text, (v, p) => v.domAtPos(p), p => new DOMPos(text, Math.min(p, text.nodeValue.length))); + } + sync() { this.setDOM(this.widget.toDOM()); } + localPosFromDOM(node, offset) { + let { topView, text } = this.widget; + if (!topView) + return Math.min(offset, this.length); + return posFromDOMInCompositionTree(node, offset, topView, text); + } + ignoreMutation() { return false; } + get overrideDOMText() { return null; } + coordsAt(pos, side) { + let { topView, text } = this.widget; + if (!topView) + return textCoords(text, pos, side); + return scanCompositionTree(pos, side, topView, text, (v, pos, side) => v.coordsAt(pos, side), (pos, side) => textCoords(text, pos, side)); + } + destroy() { + var _a; + super.destroy(); + (_a = this.widget.topView) === null || _a === void 0 ? void 0 : _a.destroy(); + } + get isEditable() { return true; } +} +// Uses the old structure of a chunk of content view frozen for +// composition to try and find a reasonable DOM location for the given +// offset. +function scanCompositionTree(pos, side, view, text, enterView, fromText) { + if (view instanceof MarkView) { + for (let child of view.children) { + let hasComp = contains(child.dom, text); + let len = hasComp ? text.nodeValue.length : child.length; + if (pos < len || pos == len && child.getSide() <= 0) + return hasComp ? scanCompositionTree(pos, side, child, text, enterView, fromText) : enterView(child, pos, side); + pos -= len; + } + return enterView(view, view.length, -1); + } + else if (view.dom == text) { + return fromText(pos, side); + } + else { + return enterView(view, pos, side); + } +} +function posFromDOMInCompositionTree(node, offset, view, text) { + if (view instanceof MarkView) { + for (let child of view.children) { + let pos = 0, hasComp = contains(child.dom, text); + if (contains(child.dom, node)) + return pos + (hasComp ? posFromDOMInCompositionTree(node, offset, child, text) : child.localPosFromDOM(node, offset)); + pos += hasComp ? text.nodeValue.length : child.length; + } + } + else if (view.dom == text) { + return Math.min(offset, text.nodeValue.length); + } + return view.localPosFromDOM(node, offset); +} +// These are drawn around uneditable widgets to avoid a number of +// browser bugs that show up when the cursor is directly next to +// uneditable inline content. +class WidgetBufferView extends ContentView { + constructor(side) { + super(); + this.side = side; + } + get length() { return 0; } + merge() { return false; } + become(other) { + return other instanceof WidgetBufferView && other.side == this.side; + } + split() { return new WidgetBufferView(this.side); } + sync() { + if (!this.dom) { + let dom = document.createElement("img"); + dom.className = "cm-widgetBuffer"; + dom.setAttribute("aria-hidden", "true"); + this.setDOM(dom); + } + } + getSide() { return this.side; } + domAtPos(pos) { return DOMPos.before(this.dom); } + localPosFromDOM() { return 0; } + domBoundsAround() { return null; } + coordsAt(pos) { + let imgRect = this.dom.getBoundingClientRect(); + // Since the height doesn't correspond to text height, try + // to borrow the height from some sibling node. + let siblingRect = inlineSiblingRect(this, this.side > 0 ? -1 : 1); + return siblingRect && siblingRect.top < imgRect.bottom && siblingRect.bottom > imgRect.top + ? { left: imgRect.left, right: imgRect.right, top: siblingRect.top, bottom: siblingRect.bottom } : imgRect; + } + get overrideDOMText() { + return Text.empty; + } +} +TextView.prototype.children = WidgetView.prototype.children = WidgetBufferView.prototype.children = noChildren; +function inlineSiblingRect(view, side) { + let parent = view.parent, index = parent ? parent.children.indexOf(view) : -1; + while (parent && index >= 0) { + if (side < 0 ? index > 0 : index < parent.children.length) { + let next = parent.children[index + side]; + if (next instanceof TextView) { + let nextRect = next.coordsAt(side < 0 ? next.length : 0, side); + if (nextRect) + return nextRect; + } + index += side; + } + else if (parent instanceof MarkView && parent.parent) { + index = parent.parent.children.indexOf(parent) + (side < 0 ? 0 : 1); + parent = parent.parent; + } + else { + let last = parent.dom.lastChild; + if (last && last.nodeName == "BR") + return last.getClientRects()[0]; + break; + } + } + return undefined; +} +function inlineDOMAtPos(dom, children, pos) { + let i = 0; + for (let off = 0; i < children.length; i++) { + let child = children[i], end = off + child.length; + if (end == off && child.getSide() <= 0) + continue; + if (pos > off && pos < end && child.dom.parentNode == dom) + return child.domAtPos(pos - off); + if (pos <= off) + break; + off = end; + } + for (; i > 0; i--) { + let before = children[i - 1].dom; + if (before.parentNode == dom) + return DOMPos.after(before); + } + return new DOMPos(dom, 0); +} +// Assumes `view`, if a mark view, has precisely 1 child. +function joinInlineInto(parent, view, open) { + let last, { children } = parent; + if (open > 0 && view instanceof MarkView && children.length && + (last = children[children.length - 1]) instanceof MarkView && last.mark.eq(view.mark)) { + joinInlineInto(last, view.children[0], open - 1); + } + else { + children.push(view); + view.setParent(parent); + } + parent.length += view.length; +} +function coordsInChildren(view, pos, side) { + for (let off = 0, i = 0; i < view.children.length; i++) { + let child = view.children[i], end = off + child.length, next; + if ((side <= 0 || end == view.length || child.getSide() > 0 ? end >= pos : end > pos) && + (pos < end || i + 1 == view.children.length || (next = view.children[i + 1]).length || next.getSide() > 0)) { + let flatten = 0; + if (end == off) { + if (child.getSide() <= 0) + continue; + flatten = side = -child.getSide(); + } + let rect = child.coordsAt(Math.max(0, pos - off), side); + return flatten && rect ? flattenRect(rect, side < 0) : rect; + } + off = end; + } + let last = view.dom.lastChild; + if (!last) + return view.dom.getBoundingClientRect(); + let rects = clientRectsFor(last); + return rects[rects.length - 1] || null; +} + +function combineAttrs(source, target) { + for (let name in source) { + if (name == "class" && target.class) + target.class += " " + source.class; + else if (name == "style" && target.style) + target.style += ";" + source.style; + else + target[name] = source[name]; + } + return target; +} +function attrsEq(a, b) { + if (a == b) + return true; + if (!a || !b) + return false; + let keysA = Object.keys(a), keysB = Object.keys(b); + if (keysA.length != keysB.length) + return false; + for (let key of keysA) { + if (keysB.indexOf(key) == -1 || a[key] !== b[key]) + return false; + } + return true; +} +function updateAttrs(dom, prev, attrs) { + let changed = null; + if (prev) + for (let name in prev) + if (!(attrs && name in attrs)) + dom.removeAttribute(changed = name); + if (attrs) + for (let name in attrs) + if (!(prev && prev[name] == attrs[name])) + dom.setAttribute(changed = name, attrs[name]); + return !!changed; +} + +/** +Widgets added to the content are described by subclasses of this +class. Using a description object like that makes it possible to +delay creating of the DOM structure for a widget until it is +needed, and to avoid redrawing widgets even if the decorations +that define them are recreated. +*/ +class WidgetType { + /** + Compare this instance to another instance of the same type. + (TypeScript can't express this, but only instances of the same + specific class will be passed to this method.) This is used to + avoid redrawing widgets when they are replaced by a new + decoration of the same type. The default implementation just + returns `false`, which will cause new instances of the widget to + always be redrawn. + */ + eq(widget) { return false; } + /** + Update a DOM element created by a widget of the same type (but + different, non-`eq` content) to reflect this widget. May return + true to indicate that it could update, false to indicate it + couldn't (in which case the widget will be redrawn). The default + implementation just returns false. + */ + updateDOM(dom) { return false; } + /** + @internal + */ + compare(other) { + return this == other || this.constructor == other.constructor && this.eq(other); + } + /** + The estimated height this widget will have, to be used when + estimating the height of content that hasn't been drawn. May + return -1 to indicate you don't know. The default implementation + returns -1. + */ + get estimatedHeight() { return -1; } + /** + Can be used to configure which kinds of events inside the widget + should be ignored by the editor. The default is to ignore all + events. + */ + ignoreEvent(event) { return true; } + /** + @internal + */ + get customView() { return null; } + /** + This is called when the an instance of the widget is removed + from the editor view. + */ + destroy(dom) { } +} +/** +The different types of blocks that can occur in an editor view. +*/ +var BlockType = /*@__PURE__*/(function (BlockType) { + /** + A line of text. + */ + BlockType[BlockType["Text"] = 0] = "Text"; + /** + A block widget associated with the position after it. + */ + BlockType[BlockType["WidgetBefore"] = 1] = "WidgetBefore"; + /** + A block widget associated with the position before it. + */ + BlockType[BlockType["WidgetAfter"] = 2] = "WidgetAfter"; + /** + A block widget [replacing](https://codemirror.net/6/docs/ref/#view.Decoration^replace) a range of content. + */ + BlockType[BlockType["WidgetRange"] = 3] = "WidgetRange"; +return BlockType})(BlockType || (BlockType = {})); +/** +A decoration provides information on how to draw or style a piece +of content. You'll usually use it wrapped in a +[`Range`](https://codemirror.net/6/docs/ref/#state.Range), which adds a start and end position. +@nonabstract +*/ +class Decoration extends RangeValue { + constructor( + /** + @internal + */ + startSide, + /** + @internal + */ + endSide, + /** + @internal + */ + widget, + /** + The config object used to create this decoration. You can + include additional properties in there to store metadata about + your decoration. + */ + spec) { + super(); + this.startSide = startSide; + this.endSide = endSide; + this.widget = widget; + this.spec = spec; + } + /** + @internal + */ + get heightRelevant() { return false; } + /** + Create a mark decoration, which influences the styling of the + content in its range. Nested mark decorations will cause nested + DOM elements to be created. Nesting order is determined by + precedence of the [facet](https://codemirror.net/6/docs/ref/#view.EditorView^decorations), with + the higher-precedence decorations creating the inner DOM nodes. + Such elements are split on line boundaries and on the boundaries + of lower-precedence decorations. + */ + static mark(spec) { + return new MarkDecoration(spec); + } + /** + Create a widget decoration, which displays a DOM element at the + given position. + */ + static widget(spec) { + let side = spec.side || 0, block = !!spec.block; + side += block ? (side > 0 ? 300000000 /* BlockAfter */ : -400000000 /* BlockBefore */) : (side > 0 ? 100000000 /* InlineAfter */ : -100000000 /* InlineBefore */); + return new PointDecoration(spec, side, side, block, spec.widget || null, false); + } + /** + Create a replace decoration which replaces the given range with + a widget, or simply hides it. + */ + static replace(spec) { + let block = !!spec.block, startSide, endSide; + if (spec.isBlockGap) { + startSide = -500000000 /* GapStart */; + endSide = 400000000 /* GapEnd */; + } + else { + let { start, end } = getInclusive(spec, block); + startSide = (start ? (block ? -300000000 /* BlockIncStart */ : -1 /* InlineIncStart */) : 500000000 /* NonIncStart */) - 1; + endSide = (end ? (block ? 200000000 /* BlockIncEnd */ : 1 /* InlineIncEnd */) : -600000000 /* NonIncEnd */) + 1; + } + return new PointDecoration(spec, startSide, endSide, block, spec.widget || null, true); + } + /** + Create a line decoration, which can add DOM attributes to the + line starting at the given position. + */ + static line(spec) { + return new LineDecoration(spec); + } + /** + Build a [`DecorationSet`](https://codemirror.net/6/docs/ref/#view.DecorationSet) from the given + decorated range or ranges. If the ranges aren't already sorted, + pass `true` for `sort` to make the library sort them for you. + */ + static set(of, sort = false) { + return RangeSet.of(of, sort); + } + /** + @internal + */ + hasHeight() { return this.widget ? this.widget.estimatedHeight > -1 : false; } +} +/** +The empty set of decorations. +*/ +Decoration.none = RangeSet.empty; +class MarkDecoration extends Decoration { + constructor(spec) { + let { start, end } = getInclusive(spec); + super(start ? -1 /* InlineIncStart */ : 500000000 /* NonIncStart */, end ? 1 /* InlineIncEnd */ : -600000000 /* NonIncEnd */, null, spec); + this.tagName = spec.tagName || "span"; + this.class = spec.class || ""; + this.attrs = spec.attributes || null; + } + eq(other) { + return this == other || + other instanceof MarkDecoration && + this.tagName == other.tagName && + this.class == other.class && + attrsEq(this.attrs, other.attrs); + } + range(from, to = from) { + if (from >= to) + throw new RangeError("Mark decorations may not be empty"); + return super.range(from, to); + } +} +MarkDecoration.prototype.point = false; +class LineDecoration extends Decoration { + constructor(spec) { + super(-200000000 /* Line */, -200000000 /* Line */, null, spec); + } + eq(other) { + return other instanceof LineDecoration && attrsEq(this.spec.attributes, other.spec.attributes); + } + range(from, to = from) { + if (to != from) + throw new RangeError("Line decoration ranges must be zero-length"); + return super.range(from, to); + } +} +LineDecoration.prototype.mapMode = MapMode.TrackBefore; +LineDecoration.prototype.point = true; +class PointDecoration extends Decoration { + constructor(spec, startSide, endSide, block, widget, isReplace) { + super(startSide, endSide, widget, spec); + this.block = block; + this.isReplace = isReplace; + this.mapMode = !block ? MapMode.TrackDel : startSide <= 0 ? MapMode.TrackBefore : MapMode.TrackAfter; + } + // Only relevant when this.block == true + get type() { + return this.startSide < this.endSide ? BlockType.WidgetRange + : this.startSide <= 0 ? BlockType.WidgetBefore : BlockType.WidgetAfter; + } + get heightRelevant() { return this.block || !!this.widget && this.widget.estimatedHeight >= 5; } + eq(other) { + return other instanceof PointDecoration && + widgetsEq(this.widget, other.widget) && + this.block == other.block && + this.startSide == other.startSide && this.endSide == other.endSide; + } + range(from, to = from) { + if (this.isReplace && (from > to || (from == to && this.startSide > 0 && this.endSide <= 0))) + throw new RangeError("Invalid range for replacement decoration"); + if (!this.isReplace && to != from) + throw new RangeError("Widget decorations can only have zero-length ranges"); + return super.range(from, to); + } +} +PointDecoration.prototype.point = true; +function getInclusive(spec, block = false) { + let { inclusiveStart: start, inclusiveEnd: end } = spec; + if (start == null) + start = spec.inclusive; + if (end == null) + end = spec.inclusive; + return { start: start !== null && start !== void 0 ? start : block, end: end !== null && end !== void 0 ? end : block }; +} +function widgetsEq(a, b) { + return a == b || !!(a && b && a.compare(b)); +} +function addRange(from, to, ranges, margin = 0) { + let last = ranges.length - 1; + if (last >= 0 && ranges[last] + margin >= from) + ranges[last] = Math.max(ranges[last], to); + else + ranges.push(from, to); +} + +class LineView extends ContentView { + constructor() { + super(...arguments); + this.children = []; + this.length = 0; + this.prevAttrs = undefined; + this.attrs = null; + this.breakAfter = 0; + } + // Consumes source + merge(from, to, source, hasStart, openStart, openEnd) { + if (source) { + if (!(source instanceof LineView)) + return false; + if (!this.dom) + source.transferDOM(this); // Reuse source.dom when appropriate + } + if (hasStart) + this.setDeco(source ? source.attrs : null); + mergeChildrenInto(this, from, to, source ? source.children : [], openStart, openEnd); + return true; + } + split(at) { + let end = new LineView; + end.breakAfter = this.breakAfter; + if (this.length == 0) + return end; + let { i, off } = this.childPos(at); + if (off) { + end.append(this.children[i].split(off), 0); + this.children[i].merge(off, this.children[i].length, null, false, 0, 0); + i++; + } + for (let j = i; j < this.children.length; j++) + end.append(this.children[j], 0); + while (i > 0 && this.children[i - 1].length == 0) + this.children[--i].destroy(); + this.children.length = i; + this.markDirty(); + this.length = at; + return end; + } + transferDOM(other) { + if (!this.dom) + return; + this.markDirty(); + other.setDOM(this.dom); + other.prevAttrs = this.prevAttrs === undefined ? this.attrs : this.prevAttrs; + this.prevAttrs = undefined; + this.dom = null; + } + setDeco(attrs) { + if (!attrsEq(this.attrs, attrs)) { + if (this.dom) { + this.prevAttrs = this.attrs; + this.markDirty(); + } + this.attrs = attrs; + } + } + append(child, openStart) { + joinInlineInto(this, child, openStart); + } + // Only called when building a line view in ContentBuilder + addLineDeco(deco) { + let attrs = deco.spec.attributes, cls = deco.spec.class; + if (attrs) + this.attrs = combineAttrs(attrs, this.attrs || {}); + if (cls) + this.attrs = combineAttrs({ class: cls }, this.attrs || {}); + } + domAtPos(pos) { + return inlineDOMAtPos(this.dom, this.children, pos); + } + reuseDOM(node) { + if (node.nodeName == "DIV") { + this.setDOM(node); + this.dirty |= 4 /* Attrs */ | 2 /* Node */; + } + } + sync(track) { + var _a; + if (!this.dom) { + this.setDOM(document.createElement("div")); + this.dom.className = "cm-line"; + this.prevAttrs = this.attrs ? null : undefined; + } + else if (this.dirty & 4 /* Attrs */) { + clearAttributes(this.dom); + this.dom.className = "cm-line"; + this.prevAttrs = this.attrs ? null : undefined; + } + if (this.prevAttrs !== undefined) { + updateAttrs(this.dom, this.prevAttrs, this.attrs); + this.dom.classList.add("cm-line"); + this.prevAttrs = undefined; + } + super.sync(track); + let last = this.dom.lastChild; + while (last && ContentView.get(last) instanceof MarkView) + last = last.lastChild; + if (!last || !this.length || + last.nodeName != "BR" && ((_a = ContentView.get(last)) === null || _a === void 0 ? void 0 : _a.isEditable) == false && + (!browser.ios || !this.children.some(ch => ch instanceof TextView))) { + let hack = document.createElement("BR"); + hack.cmIgnore = true; + this.dom.appendChild(hack); + } + } + measureTextSize() { + if (this.children.length == 0 || this.length > 20) + return null; + let totalWidth = 0; + for (let child of this.children) { + if (!(child instanceof TextView)) + return null; + let rects = clientRectsFor(child.dom); + if (rects.length != 1) + return null; + totalWidth += rects[0].width; + } + return { lineHeight: this.dom.getBoundingClientRect().height, + charWidth: totalWidth / this.length }; + } + coordsAt(pos, side) { + return coordsInChildren(this, pos, side); + } + become(_other) { return false; } + get type() { return BlockType.Text; } + static find(docView, pos) { + for (let i = 0, off = 0; i < docView.children.length; i++) { + let block = docView.children[i], end = off + block.length; + if (end >= pos) { + if (block instanceof LineView) + return block; + if (end > pos) + break; + } + off = end + block.breakAfter; + } + return null; + } +} +class BlockWidgetView extends ContentView { + constructor(widget, length, type) { + super(); + this.widget = widget; + this.length = length; + this.type = type; + this.breakAfter = 0; + this.prevWidget = null; + } + merge(from, to, source, _takeDeco, openStart, openEnd) { + if (source && (!(source instanceof BlockWidgetView) || !this.widget.compare(source.widget) || + from > 0 && openStart <= 0 || to < this.length && openEnd <= 0)) + return false; + this.length = from + (source ? source.length : 0) + (this.length - to); + return true; + } + domAtPos(pos) { + return pos == 0 ? DOMPos.before(this.dom) : DOMPos.after(this.dom, pos == this.length); + } + split(at) { + let len = this.length - at; + this.length = at; + let end = new BlockWidgetView(this.widget, len, this.type); + end.breakAfter = this.breakAfter; + return end; + } + get children() { return noChildren; } + sync() { + if (!this.dom || !this.widget.updateDOM(this.dom)) { + if (this.dom && this.prevWidget) + this.prevWidget.destroy(this.dom); + this.prevWidget = null; + this.setDOM(this.widget.toDOM(this.editorView)); + this.dom.contentEditable = "false"; + } + } + get overrideDOMText() { + return this.parent ? this.parent.view.state.doc.slice(this.posAtStart, this.posAtEnd) : Text.empty; + } + domBoundsAround() { return null; } + become(other) { + if (other instanceof BlockWidgetView && other.type == this.type && + other.widget.constructor == this.widget.constructor) { + if (!other.widget.eq(this.widget)) + this.markDirty(true); + if (this.dom && !this.prevWidget) + this.prevWidget = this.widget; + this.widget = other.widget; + this.length = other.length; + this.breakAfter = other.breakAfter; + return true; + } + return false; + } + ignoreMutation() { return true; } + ignoreEvent(event) { return this.widget.ignoreEvent(event); } + destroy() { + super.destroy(); + if (this.dom) + this.widget.destroy(this.dom); + } +} + +class ContentBuilder { + constructor(doc, pos, end, disallowBlockEffectsFor) { + this.doc = doc; + this.pos = pos; + this.end = end; + this.disallowBlockEffectsFor = disallowBlockEffectsFor; + this.content = []; + this.curLine = null; + this.breakAtStart = 0; + this.pendingBuffer = 0 /* No */; + // Set to false directly after a widget that covers the position after it + this.atCursorPos = true; + this.openStart = -1; + this.openEnd = -1; + this.text = ""; + this.textOff = 0; + this.cursor = doc.iter(); + this.skip = pos; + } + posCovered() { + if (this.content.length == 0) + return !this.breakAtStart && this.doc.lineAt(this.pos).from != this.pos; + let last = this.content[this.content.length - 1]; + return !last.breakAfter && !(last instanceof BlockWidgetView && last.type == BlockType.WidgetBefore); + } + getLine() { + if (!this.curLine) { + this.content.push(this.curLine = new LineView); + this.atCursorPos = true; + } + return this.curLine; + } + flushBuffer(active) { + if (this.pendingBuffer) { + this.curLine.append(wrapMarks(new WidgetBufferView(-1), active), active.length); + this.pendingBuffer = 0 /* No */; + } + } + addBlockWidget(view) { + this.flushBuffer([]); + this.curLine = null; + this.content.push(view); + } + finish(openEnd) { + if (!openEnd) + this.flushBuffer([]); + else + this.pendingBuffer = 0 /* No */; + if (!this.posCovered()) + this.getLine(); + } + buildText(length, active, openStart) { + while (length > 0) { + if (this.textOff == this.text.length) { + let { value, lineBreak, done } = this.cursor.next(this.skip); + this.skip = 0; + if (done) + throw new Error("Ran out of text content when drawing inline views"); + if (lineBreak) { + if (!this.posCovered()) + this.getLine(); + if (this.content.length) + this.content[this.content.length - 1].breakAfter = 1; + else + this.breakAtStart = 1; + this.flushBuffer([]); + this.curLine = null; + length--; + continue; + } + else { + this.text = value; + this.textOff = 0; + } + } + let take = Math.min(this.text.length - this.textOff, length, 512 /* Chunk */); + this.flushBuffer(active.slice(0, openStart)); + this.getLine().append(wrapMarks(new TextView(this.text.slice(this.textOff, this.textOff + take)), active), openStart); + this.atCursorPos = true; + this.textOff += take; + length -= take; + openStart = 0; + } + } + span(from, to, active, openStart) { + this.buildText(to - from, active, openStart); + this.pos = to; + if (this.openStart < 0) + this.openStart = openStart; + } + point(from, to, deco, active, openStart, index) { + if (this.disallowBlockEffectsFor[index] && deco instanceof PointDecoration) { + if (deco.block) + throw new RangeError("Block decorations may not be specified via plugins"); + if (to > this.doc.lineAt(this.pos).to) + throw new RangeError("Decorations that replace line breaks may not be specified via plugins"); + } + let len = to - from; + if (deco instanceof PointDecoration) { + if (deco.block) { + let { type } = deco; + if (type == BlockType.WidgetAfter && !this.posCovered()) + this.getLine(); + this.addBlockWidget(new BlockWidgetView(deco.widget || new NullWidget("div"), len, type)); + } + else { + let view = WidgetView.create(deco.widget || new NullWidget("span"), len, deco.startSide); + let cursorBefore = this.atCursorPos && !view.isEditable && openStart <= active.length && (from < to || deco.startSide > 0); + let cursorAfter = !view.isEditable && (from < to || deco.startSide <= 0); + let line = this.getLine(); + if (this.pendingBuffer == 2 /* IfCursor */ && !cursorBefore) + this.pendingBuffer = 0 /* No */; + this.flushBuffer(active); + if (cursorBefore) { + line.append(wrapMarks(new WidgetBufferView(1), active), openStart); + openStart = active.length + Math.max(0, openStart - active.length); + } + line.append(wrapMarks(view, active), openStart); + this.atCursorPos = cursorAfter; + this.pendingBuffer = !cursorAfter ? 0 /* No */ : from < to ? 1 /* Yes */ : 2 /* IfCursor */; + } + } + else if (this.doc.lineAt(this.pos).from == this.pos) { // Line decoration + this.getLine().addLineDeco(deco); + } + if (len) { + // Advance the iterator past the replaced content + if (this.textOff + len <= this.text.length) { + this.textOff += len; + } + else { + this.skip += len - (this.text.length - this.textOff); + this.text = ""; + this.textOff = 0; + } + this.pos = to; + } + if (this.openStart < 0) + this.openStart = openStart; + } + static build(text, from, to, decorations, dynamicDecorationMap) { + let builder = new ContentBuilder(text, from, to, dynamicDecorationMap); + builder.openEnd = RangeSet.spans(decorations, from, to, builder); + if (builder.openStart < 0) + builder.openStart = builder.openEnd; + builder.finish(builder.openEnd); + return builder; + } +} +function wrapMarks(view, active) { + for (let mark of active) + view = new MarkView(mark, [view], view.length); + return view; +} +class NullWidget extends WidgetType { + constructor(tag) { + super(); + this.tag = tag; + } + eq(other) { return other.tag == this.tag; } + toDOM() { return document.createElement(this.tag); } + updateDOM(elt) { return elt.nodeName.toLowerCase() == this.tag; } +} + +const clickAddsSelectionRange = /*@__PURE__*/Facet.define(); +const dragMovesSelection$1 = /*@__PURE__*/Facet.define(); +const mouseSelectionStyle = /*@__PURE__*/Facet.define(); +const exceptionSink = /*@__PURE__*/Facet.define(); +const updateListener = /*@__PURE__*/Facet.define(); +const inputHandler = /*@__PURE__*/Facet.define(); +const perLineTextDirection = /*@__PURE__*/Facet.define({ + combine: values => values.some(x => x) +}); +class ScrollTarget { + constructor(range, y = "nearest", x = "nearest", yMargin = 5, xMargin = 5) { + this.range = range; + this.y = y; + this.x = x; + this.yMargin = yMargin; + this.xMargin = xMargin; + } + map(changes) { + return changes.empty ? this : new ScrollTarget(this.range.map(changes), this.y, this.x, this.yMargin, this.xMargin); + } +} +const scrollIntoView = /*@__PURE__*/StateEffect.define({ map: (t, ch) => t.map(ch) }); +/** +Log or report an unhandled exception in client code. Should +probably only be used by extension code that allows client code to +provide functions, and calls those functions in a context where an +exception can't be propagated to calling code in a reasonable way +(for example when in an event handler). + +Either calls a handler registered with +[`EditorView.exceptionSink`](https://codemirror.net/6/docs/ref/#view.EditorView^exceptionSink), +`window.onerror`, if defined, or `console.error` (in which case +it'll pass `context`, when given, as first argument). +*/ +function logException(state, exception, context) { + let handler = state.facet(exceptionSink); + if (handler.length) + handler[0](exception); + else if (window.onerror) + window.onerror(String(exception), context, undefined, undefined, exception); + else if (context) + console.error(context + ":", exception); + else + console.error(exception); +} +const editable = /*@__PURE__*/Facet.define({ combine: values => values.length ? values[0] : true }); +let nextPluginID = 0; +const viewPlugin = /*@__PURE__*/Facet.define(); +/** +View plugins associate stateful values with a view. They can +influence the way the content is drawn, and are notified of things +that happen in the view. +*/ +class ViewPlugin { + constructor( + /** + @internal + */ + id, + /** + @internal + */ + create, + /** + @internal + */ + domEventHandlers, buildExtensions) { + this.id = id; + this.create = create; + this.domEventHandlers = domEventHandlers; + this.extension = buildExtensions(this); + } + /** + Define a plugin from a constructor function that creates the + plugin's value, given an editor view. + */ + static define(create, spec) { + const { eventHandlers, provide, decorations: deco } = spec || {}; + return new ViewPlugin(nextPluginID++, create, eventHandlers, plugin => { + let ext = [viewPlugin.of(plugin)]; + if (deco) + ext.push(decorations.of(view => { + let pluginInst = view.plugin(plugin); + return pluginInst ? deco(pluginInst) : Decoration.none; + })); + if (provide) + ext.push(provide(plugin)); + return ext; + }); + } + /** + Create a plugin for a class whose constructor takes a single + editor view as argument. + */ + static fromClass(cls, spec) { + return ViewPlugin.define(view => new cls(view), spec); + } +} +class PluginInstance { + constructor(spec) { + this.spec = spec; + // When starting an update, all plugins have this field set to the + // update object, indicating they need to be updated. When finished + // updating, it is set to `false`. Retrieving a plugin that needs to + // be updated with `view.plugin` forces an eager update. + this.mustUpdate = null; + // This is null when the plugin is initially created, but + // initialized on the first update. + this.value = null; + } + update(view) { + if (!this.value) { + if (this.spec) { + try { + this.value = this.spec.create(view); + } + catch (e) { + logException(view.state, e, "CodeMirror plugin crashed"); + this.deactivate(); + } + } + } + else if (this.mustUpdate) { + let update = this.mustUpdate; + this.mustUpdate = null; + if (this.value.update) { + try { + this.value.update(update); + } + catch (e) { + logException(update.state, e, "CodeMirror plugin crashed"); + if (this.value.destroy) + try { + this.value.destroy(); + } + catch (_) { } + this.deactivate(); + } + } + } + return this; + } + destroy(view) { + var _a; + if ((_a = this.value) === null || _a === void 0 ? void 0 : _a.destroy) { + try { + this.value.destroy(); + } + catch (e) { + logException(view.state, e, "CodeMirror plugin crashed"); + } + } + } + deactivate() { + this.spec = this.value = null; + } +} +const editorAttributes = /*@__PURE__*/Facet.define(); +const contentAttributes = /*@__PURE__*/Facet.define(); +// Provide decorations +const decorations = /*@__PURE__*/Facet.define(); +const atomicRanges = /*@__PURE__*/Facet.define(); +const scrollMargins = /*@__PURE__*/Facet.define(); +const styleModule = /*@__PURE__*/Facet.define(); +class ChangedRange { + constructor(fromA, toA, fromB, toB) { + this.fromA = fromA; + this.toA = toA; + this.fromB = fromB; + this.toB = toB; + } + join(other) { + return new ChangedRange(Math.min(this.fromA, other.fromA), Math.max(this.toA, other.toA), Math.min(this.fromB, other.fromB), Math.max(this.toB, other.toB)); + } + addToSet(set) { + let i = set.length, me = this; + for (; i > 0; i--) { + let range = set[i - 1]; + if (range.fromA > me.toA) + continue; + if (range.toA < me.fromA) + break; + me = me.join(range); + set.splice(i - 1, 1); + } + set.splice(i, 0, me); + return set; + } + static extendWithRanges(diff, ranges) { + if (ranges.length == 0) + return diff; + let result = []; + for (let dI = 0, rI = 0, posA = 0, posB = 0;; dI++) { + let next = dI == diff.length ? null : diff[dI], off = posA - posB; + let end = next ? next.fromB : 1e9; + while (rI < ranges.length && ranges[rI] < end) { + let from = ranges[rI], to = ranges[rI + 1]; + let fromB = Math.max(posB, from), toB = Math.min(end, to); + if (fromB <= toB) + new ChangedRange(fromB + off, toB + off, fromB, toB).addToSet(result); + if (to > end) + break; + else + rI += 2; + } + if (!next) + return result; + new ChangedRange(next.fromA, next.toA, next.fromB, next.toB).addToSet(result); + posA = next.toA; + posB = next.toB; + } + } +} +/** +View [plugins](https://codemirror.net/6/docs/ref/#view.ViewPlugin) are given instances of this +class, which describe what happened, whenever the view is updated. +*/ +class ViewUpdate { + constructor( + /** + The editor view that the update is associated with. + */ + view, + /** + The new editor state. + */ + state, + /** + The transactions involved in the update. May be empty. + */ + transactions) { + this.view = view; + this.state = state; + this.transactions = transactions; + /** + @internal + */ + this.flags = 0; + this.startState = view.state; + this.changes = ChangeSet.empty(this.startState.doc.length); + for (let tr of transactions) + this.changes = this.changes.compose(tr.changes); + let changedRanges = []; + this.changes.iterChangedRanges((fromA, toA, fromB, toB) => changedRanges.push(new ChangedRange(fromA, toA, fromB, toB))); + this.changedRanges = changedRanges; + let focus = view.hasFocus; + if (focus != view.inputState.notifiedFocused) { + view.inputState.notifiedFocused = focus; + this.flags |= 1 /* Focus */; + } + } + /** + @internal + */ + static create(view, state, transactions) { + return new ViewUpdate(view, state, transactions); + } + /** + Tells you whether the [viewport](https://codemirror.net/6/docs/ref/#view.EditorView.viewport) or + [visible ranges](https://codemirror.net/6/docs/ref/#view.EditorView.visibleRanges) changed in this + update. + */ + get viewportChanged() { + return (this.flags & 4 /* Viewport */) > 0; + } + /** + Indicates whether the height of a block element in the editor + changed in this update. + */ + get heightChanged() { + return (this.flags & 2 /* Height */) > 0; + } + /** + Returns true when the document was modified or the size of the + editor, or elements within the editor, changed. + */ + get geometryChanged() { + return this.docChanged || (this.flags & (8 /* Geometry */ | 2 /* Height */)) > 0; + } + /** + True when this update indicates a focus change. + */ + get focusChanged() { + return (this.flags & 1 /* Focus */) > 0; + } + /** + Whether the document changed in this update. + */ + get docChanged() { + return !this.changes.empty; + } + /** + Whether the selection was explicitly set in this update. + */ + get selectionSet() { + return this.transactions.some(tr => tr.selection); + } + /** + @internal + */ + get empty() { return this.flags == 0 && this.transactions.length == 0; } +} + +/** +Used to indicate [text direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection). +*/ +var Direction = /*@__PURE__*/(function (Direction) { + // (These are chosen to match the base levels, in bidi algorithm + // terms, of spans in that direction.) + /** + Left-to-right. + */ + Direction[Direction["LTR"] = 0] = "LTR"; + /** + Right-to-left. + */ + Direction[Direction["RTL"] = 1] = "RTL"; +return Direction})(Direction || (Direction = {})); +const LTR = Direction.LTR, RTL = Direction.RTL; +// Decode a string with each type encoded as log2(type) +function dec(str) { + let result = []; + for (let i = 0; i < str.length; i++) + result.push(1 << +str[i]); + return result; +} +// Character types for codepoints 0 to 0xf8 +const LowTypes = /*@__PURE__*/dec("88888888888888888888888888888888888666888888787833333333337888888000000000000000000000000008888880000000000000000000000000088888888888888888888888888888888888887866668888088888663380888308888800000000000000000000000800000000000000000000000000000008"); +// Character types for codepoints 0x600 to 0x6f9 +const ArabicTypes = /*@__PURE__*/dec("4444448826627288999999999992222222222222222222222222222222222222222222222229999999999999999999994444444444644222822222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222999999949999999229989999223333333333"); +const Brackets = /*@__PURE__*/Object.create(null), BracketStack = []; +// There's a lot more in +// https://www.unicode.org/Public/UCD/latest/ucd/BidiBrackets.txt, +// which are left out to keep code size down. +for (let p of ["()", "[]", "{}"]) { + let l = /*@__PURE__*/p.charCodeAt(0), r = /*@__PURE__*/p.charCodeAt(1); + Brackets[l] = r; + Brackets[r] = -l; +} +function charType(ch) { + return ch <= 0xf7 ? LowTypes[ch] : + 0x590 <= ch && ch <= 0x5f4 ? 2 /* R */ : + 0x600 <= ch && ch <= 0x6f9 ? ArabicTypes[ch - 0x600] : + 0x6ee <= ch && ch <= 0x8ac ? 4 /* AL */ : + 0x2000 <= ch && ch <= 0x200b ? 256 /* NI */ : + ch == 0x200c ? 256 /* NI */ : 1 /* L */; +} +const BidiRE = /[\u0590-\u05f4\u0600-\u06ff\u0700-\u08ac]/; +/** +Represents a contiguous range of text that has a single direction +(as in left-to-right or right-to-left). +*/ +class BidiSpan { + /** + @internal + */ + constructor( + /** + The start of the span (relative to the start of the line). + */ + from, + /** + The end of the span. + */ + to, + /** + The ["bidi + level"](https://unicode.org/reports/tr9/#Basic_Display_Algorithm) + of the span (in this context, 0 means + left-to-right, 1 means right-to-left, 2 means left-to-right + number inside right-to-left text). + */ + level) { + this.from = from; + this.to = to; + this.level = level; + } + /** + The direction of this span. + */ + get dir() { return this.level % 2 ? RTL : LTR; } + /** + @internal + */ + side(end, dir) { return (this.dir == dir) == end ? this.to : this.from; } + /** + @internal + */ + static find(order, index, level, assoc) { + let maybe = -1; + for (let i = 0; i < order.length; i++) { + let span = order[i]; + if (span.from <= index && span.to >= index) { + if (span.level == level) + return i; + // When multiple spans match, if assoc != 0, take the one that + // covers that side, otherwise take the one with the minimum + // level. + if (maybe < 0 || (assoc != 0 ? (assoc < 0 ? span.from < index : span.to > index) : order[maybe].level > span.level)) + maybe = i; + } + } + if (maybe < 0) + throw new RangeError("Index out of range"); + return maybe; + } +} +// Reused array of character types +const types = []; +function computeOrder(line, direction) { + let len = line.length, outerType = direction == LTR ? 1 /* L */ : 2 /* R */, oppositeType = direction == LTR ? 2 /* R */ : 1 /* L */; + if (!line || outerType == 1 /* L */ && !BidiRE.test(line)) + return trivialOrder(len); + // W1. Examine each non-spacing mark (NSM) in the level run, and + // change the type of the NSM to the type of the previous + // character. If the NSM is at the start of the level run, it will + // get the type of sor. + // W2. Search backwards from each instance of a European number + // until the first strong type (R, L, AL, or sor) is found. If an + // AL is found, change the type of the European number to Arabic + // number. + // W3. Change all ALs to R. + // (Left after this: L, R, EN, AN, ET, CS, NI) + for (let i = 0, prev = outerType, prevStrong = outerType; i < len; i++) { + let type = charType(line.charCodeAt(i)); + if (type == 512 /* NSM */) + type = prev; + else if (type == 8 /* EN */ && prevStrong == 4 /* AL */) + type = 16 /* AN */; + types[i] = type == 4 /* AL */ ? 2 /* R */ : type; + if (type & 7 /* Strong */) + prevStrong = type; + prev = type; + } + // W5. A sequence of European terminators adjacent to European + // numbers changes to all European numbers. + // W6. Otherwise, separators and terminators change to Other + // Neutral. + // W7. Search backwards from each instance of a European number + // until the first strong type (R, L, or sor) is found. If an L is + // found, then change the type of the European number to L. + // (Left after this: L, R, EN+AN, NI) + for (let i = 0, prev = outerType, prevStrong = outerType; i < len; i++) { + let type = types[i]; + if (type == 128 /* CS */) { + if (i < len - 1 && prev == types[i + 1] && (prev & 24 /* Num */)) + type = types[i] = prev; + else + types[i] = 256 /* NI */; + } + else if (type == 64 /* ET */) { + let end = i + 1; + while (end < len && types[end] == 64 /* ET */) + end++; + let replace = (i && prev == 8 /* EN */) || (end < len && types[end] == 8 /* EN */) ? (prevStrong == 1 /* L */ ? 1 /* L */ : 8 /* EN */) : 256 /* NI */; + for (let j = i; j < end; j++) + types[j] = replace; + i = end - 1; + } + else if (type == 8 /* EN */ && prevStrong == 1 /* L */) { + types[i] = 1 /* L */; + } + prev = type; + if (type & 7 /* Strong */) + prevStrong = type; + } + // N0. Process bracket pairs in an isolating run sequence + // sequentially in the logical order of the text positions of the + // opening paired brackets using the logic given below. Within this + // scope, bidirectional types EN and AN are treated as R. + for (let i = 0, sI = 0, context = 0, ch, br, type; i < len; i++) { + // Keeps [startIndex, type, strongSeen] triples for each open + // bracket on BracketStack. + if (br = Brackets[ch = line.charCodeAt(i)]) { + if (br < 0) { // Closing bracket + for (let sJ = sI - 3; sJ >= 0; sJ -= 3) { + if (BracketStack[sJ + 1] == -br) { + let flags = BracketStack[sJ + 2]; + let type = (flags & 2 /* EmbedInside */) ? outerType : + !(flags & 4 /* OppositeInside */) ? 0 : + (flags & 1 /* OppositeBefore */) ? oppositeType : outerType; + if (type) + types[i] = types[BracketStack[sJ]] = type; + sI = sJ; + break; + } + } + } + else if (BracketStack.length == 189 /* MaxDepth */) { + break; + } + else { + BracketStack[sI++] = i; + BracketStack[sI++] = ch; + BracketStack[sI++] = context; + } + } + else if ((type = types[i]) == 2 /* R */ || type == 1 /* L */) { + let embed = type == outerType; + context = embed ? 0 : 1 /* OppositeBefore */; + for (let sJ = sI - 3; sJ >= 0; sJ -= 3) { + let cur = BracketStack[sJ + 2]; + if (cur & 2 /* EmbedInside */) + break; + if (embed) { + BracketStack[sJ + 2] |= 2 /* EmbedInside */; + } + else { + if (cur & 4 /* OppositeInside */) + break; + BracketStack[sJ + 2] |= 4 /* OppositeInside */; + } + } + } + } + // N1. A sequence of neutrals takes the direction of the + // surrounding strong text if the text on both sides has the same + // direction. European and Arabic numbers act as if they were R in + // terms of their influence on neutrals. Start-of-level-run (sor) + // and end-of-level-run (eor) are used at level run boundaries. + // N2. Any remaining neutrals take the embedding direction. + // (Left after this: L, R, EN+AN) + for (let i = 0; i < len; i++) { + if (types[i] == 256 /* NI */) { + let end = i + 1; + while (end < len && types[end] == 256 /* NI */) + end++; + let beforeL = (i ? types[i - 1] : outerType) == 1 /* L */; + let afterL = (end < len ? types[end] : outerType) == 1 /* L */; + let replace = beforeL == afterL ? (beforeL ? 1 /* L */ : 2 /* R */) : outerType; + for (let j = i; j < end; j++) + types[j] = replace; + i = end - 1; + } + } + // Here we depart from the documented algorithm, in order to avoid + // building up an actual levels array. Since there are only three + // levels (0, 1, 2) in an implementation that doesn't take + // explicit embedding into account, we can build up the order on + // the fly, without following the level-based algorithm. + let order = []; + if (outerType == 1 /* L */) { + for (let i = 0; i < len;) { + let start = i, rtl = types[i++] != 1 /* L */; + while (i < len && rtl == (types[i] != 1 /* L */)) + i++; + if (rtl) { + for (let j = i; j > start;) { + let end = j, l = types[--j] != 2 /* R */; + while (j > start && l == (types[j - 1] != 2 /* R */)) + j--; + order.push(new BidiSpan(j, end, l ? 2 : 1)); + } + } + else { + order.push(new BidiSpan(start, i, 0)); + } + } + } + else { + for (let i = 0; i < len;) { + let start = i, rtl = types[i++] == 2 /* R */; + while (i < len && rtl == (types[i] == 2 /* R */)) + i++; + order.push(new BidiSpan(start, i, rtl ? 1 : 2)); + } + } + return order; +} +function trivialOrder(length) { + return [new BidiSpan(0, length, 0)]; +} +let movedOver = ""; +function moveVisually(line, order, dir, start, forward) { + var _a; + let startIndex = start.head - line.from, spanI = -1; + if (startIndex == 0) { + if (!forward || !line.length) + return null; + if (order[0].level != dir) { + startIndex = order[0].side(false, dir); + spanI = 0; + } + } + else if (startIndex == line.length) { + if (forward) + return null; + let last = order[order.length - 1]; + if (last.level != dir) { + startIndex = last.side(true, dir); + spanI = order.length - 1; + } + } + if (spanI < 0) + spanI = BidiSpan.find(order, startIndex, (_a = start.bidiLevel) !== null && _a !== void 0 ? _a : -1, start.assoc); + let span = order[spanI]; + // End of span. (But not end of line--that was checked for above.) + if (startIndex == span.side(forward, dir)) { + span = order[spanI += forward ? 1 : -1]; + startIndex = span.side(!forward, dir); + } + let indexForward = forward == (span.dir == dir); + let nextIndex = findClusterBreak(line.text, startIndex, indexForward); + movedOver = line.text.slice(Math.min(startIndex, nextIndex), Math.max(startIndex, nextIndex)); + if (nextIndex != span.side(forward, dir)) + return EditorSelection.cursor(nextIndex + line.from, indexForward ? -1 : 1, span.level); + let nextSpan = spanI == (forward ? order.length - 1 : 0) ? null : order[spanI + (forward ? 1 : -1)]; + if (!nextSpan && span.level != dir) + return EditorSelection.cursor(forward ? line.to : line.from, forward ? -1 : 1, dir); + if (nextSpan && nextSpan.level < span.level) + return EditorSelection.cursor(nextSpan.side(!forward, dir) + line.from, forward ? 1 : -1, nextSpan.level); + return EditorSelection.cursor(nextIndex + line.from, forward ? -1 : 1, span.level); +} + +const LineBreakPlaceholder = "\uffff"; +class DOMReader { + constructor(points, state) { + this.points = points; + this.text = ""; + this.lineSeparator = state.facet(EditorState.lineSeparator); + } + append(text) { + this.text += text; + } + lineBreak() { + this.text += LineBreakPlaceholder; + } + readRange(start, end) { + if (!start) + return this; + let parent = start.parentNode; + for (let cur = start;;) { + this.findPointBefore(parent, cur); + this.readNode(cur); + let next = cur.nextSibling; + if (next == end) + break; + let view = ContentView.get(cur), nextView = ContentView.get(next); + if (view && nextView ? view.breakAfter : + (view ? view.breakAfter : isBlockElement(cur)) || + (isBlockElement(next) && (cur.nodeName != "BR" || cur.cmIgnore))) + this.lineBreak(); + cur = next; + } + this.findPointBefore(parent, end); + return this; + } + readTextNode(node) { + let text = node.nodeValue; + for (let point of this.points) + if (point.node == node) + point.pos = this.text.length + Math.min(point.offset, text.length); + for (let off = 0, re = this.lineSeparator ? null : /\r\n?|\n/g;;) { + let nextBreak = -1, breakSize = 1, m; + if (this.lineSeparator) { + nextBreak = text.indexOf(this.lineSeparator, off); + breakSize = this.lineSeparator.length; + } + else if (m = re.exec(text)) { + nextBreak = m.index; + breakSize = m[0].length; + } + this.append(text.slice(off, nextBreak < 0 ? text.length : nextBreak)); + if (nextBreak < 0) + break; + this.lineBreak(); + if (breakSize > 1) + for (let point of this.points) + if (point.node == node && point.pos > this.text.length) + point.pos -= breakSize - 1; + off = nextBreak + breakSize; + } + } + readNode(node) { + if (node.cmIgnore) + return; + let view = ContentView.get(node); + let fromView = view && view.overrideDOMText; + if (fromView != null) { + this.findPointInside(node, fromView.length); + for (let i = fromView.iter(); !i.next().done;) { + if (i.lineBreak) + this.lineBreak(); + else + this.append(i.value); + } + } + else if (node.nodeType == 3) { + this.readTextNode(node); + } + else if (node.nodeName == "BR") { + if (node.nextSibling) + this.lineBreak(); + } + else if (node.nodeType == 1) { + this.readRange(node.firstChild, null); + } + } + findPointBefore(node, next) { + for (let point of this.points) + if (point.node == node && node.childNodes[point.offset] == next) + point.pos = this.text.length; + } + findPointInside(node, maxLen) { + for (let point of this.points) + if (node.nodeType == 3 ? point.node == node : node.contains(point.node)) + point.pos = this.text.length + Math.min(maxLen, point.offset); + } +} +function isBlockElement(node) { + return node.nodeType == 1 && /^(DIV|P|LI|UL|OL|BLOCKQUOTE|DD|DT|H\d|SECTION|PRE)$/.test(node.nodeName); +} +class DOMPoint { + constructor(node, offset) { + this.node = node; + this.offset = offset; + this.pos = -1; + } +} + +class DocView extends ContentView { + constructor(view) { + super(); + this.view = view; + this.compositionDeco = Decoration.none; + this.decorations = []; + this.dynamicDecorationMap = []; + // Track a minimum width for the editor. When measuring sizes in + // measureVisibleLineHeights, this is updated to point at the width + // of a given element and its extent in the document. When a change + // happens in that range, these are reset. That way, once we've seen + // a line/element of a given length, we keep the editor wide enough + // to fit at least that element, until it is changed, at which point + // we forget it again. + this.minWidth = 0; + this.minWidthFrom = 0; + this.minWidthTo = 0; + // Track whether the DOM selection was set in a lossy way, so that + // we don't mess it up when reading it back it + this.impreciseAnchor = null; + this.impreciseHead = null; + this.forceSelection = false; + // Used by the resize observer to ignore resizes that we caused + // ourselves + this.lastUpdate = Date.now(); + this.setDOM(view.contentDOM); + this.children = [new LineView]; + this.children[0].setParent(this); + this.updateDeco(); + this.updateInner([new ChangedRange(0, 0, 0, view.state.doc.length)], 0); + } + get root() { return this.view.root; } + get editorView() { return this.view; } + get length() { return this.view.state.doc.length; } + // Update the document view to a given state. scrollIntoView can be + // used as a hint to compute a new viewport that includes that + // position, if we know the editor is going to scroll that position + // into view. + update(update) { + let changedRanges = update.changedRanges; + if (this.minWidth > 0 && changedRanges.length) { + if (!changedRanges.every(({ fromA, toA }) => toA < this.minWidthFrom || fromA > this.minWidthTo)) { + this.minWidth = this.minWidthFrom = this.minWidthTo = 0; + } + else { + this.minWidthFrom = update.changes.mapPos(this.minWidthFrom, 1); + this.minWidthTo = update.changes.mapPos(this.minWidthTo, 1); + } + } + if (this.view.inputState.composing < 0) + this.compositionDeco = Decoration.none; + else if (update.transactions.length || this.dirty) + this.compositionDeco = computeCompositionDeco(this.view, update.changes); + // When the DOM nodes around the selection are moved to another + // parent, Chrome sometimes reports a different selection through + // getSelection than the one that it actually shows to the user. + // This forces a selection update when lines are joined to work + // around that. Issue #54 + if ((browser.ie || browser.chrome) && !this.compositionDeco.size && update && + update.state.doc.lines != update.startState.doc.lines) + this.forceSelection = true; + let prevDeco = this.decorations, deco = this.updateDeco(); + let decoDiff = findChangedDeco(prevDeco, deco, update.changes); + changedRanges = ChangedRange.extendWithRanges(changedRanges, decoDiff); + if (this.dirty == 0 /* Not */ && changedRanges.length == 0) { + return false; + } + else { + this.updateInner(changedRanges, update.startState.doc.length); + if (update.transactions.length) + this.lastUpdate = Date.now(); + return true; + } + } + // Used by update and the constructor do perform the actual DOM + // update + updateInner(changes, oldLength) { + this.view.viewState.mustMeasureContent = true; + this.updateChildren(changes, oldLength); + let { observer } = this.view; + observer.ignore(() => { + // Lock the height during redrawing, since Chrome sometimes + // messes with the scroll position during DOM mutation (though + // no relayout is triggered and I cannot imagine how it can + // recompute the scroll position without a layout) + this.dom.style.height = this.view.viewState.contentHeight + "px"; + this.dom.style.flexBasis = this.minWidth ? this.minWidth + "px" : ""; + // Chrome will sometimes, when DOM mutations occur directly + // around the selection, get confused and report a different + // selection from the one it displays (issue #218). This tries + // to detect that situation. + let track = browser.chrome || browser.ios ? { node: observer.selectionRange.focusNode, written: false } : undefined; + this.sync(track); + this.dirty = 0 /* Not */; + if (track && (track.written || observer.selectionRange.focusNode != track.node)) + this.forceSelection = true; + this.dom.style.height = ""; + }); + let gaps = []; + if (this.view.viewport.from || this.view.viewport.to < this.view.state.doc.length) + for (let child of this.children) + if (child instanceof BlockWidgetView && child.widget instanceof BlockGapWidget) + gaps.push(child.dom); + observer.updateGaps(gaps); + } + updateChildren(changes, oldLength) { + let cursor = this.childCursor(oldLength); + for (let i = changes.length - 1;; i--) { + let next = i >= 0 ? changes[i] : null; + if (!next) + break; + let { fromA, toA, fromB, toB } = next; + let { content, breakAtStart, openStart, openEnd } = ContentBuilder.build(this.view.state.doc, fromB, toB, this.decorations, this.dynamicDecorationMap); + let { i: toI, off: toOff } = cursor.findPos(toA, 1); + let { i: fromI, off: fromOff } = cursor.findPos(fromA, -1); + replaceRange(this, fromI, fromOff, toI, toOff, content, breakAtStart, openStart, openEnd); + } + } + // Sync the DOM selection to this.state.selection + updateSelection(mustRead = false, fromPointer = false) { + if (mustRead) + this.view.observer.readSelectionRange(); + if (!(fromPointer || this.mayControlSelection()) || + browser.ios && this.view.inputState.rapidCompositionStart) + return; + let force = this.forceSelection; + this.forceSelection = false; + let main = this.view.state.selection.main; + // FIXME need to handle the case where the selection falls inside a block range + let anchor = this.domAtPos(main.anchor); + let head = main.empty ? anchor : this.domAtPos(main.head); + // Always reset on Firefox when next to an uneditable node to + // avoid invisible cursor bugs (#111) + if (browser.gecko && main.empty && betweenUneditable(anchor)) { + let dummy = document.createTextNode(""); + this.view.observer.ignore(() => anchor.node.insertBefore(dummy, anchor.node.childNodes[anchor.offset] || null)); + anchor = head = new DOMPos(dummy, 0); + force = true; + } + let domSel = this.view.observer.selectionRange; + // If the selection is already here, or in an equivalent position, don't touch it + if (force || !domSel.focusNode || + !isEquivalentPosition(anchor.node, anchor.offset, domSel.anchorNode, domSel.anchorOffset) || + !isEquivalentPosition(head.node, head.offset, domSel.focusNode, domSel.focusOffset)) { + this.view.observer.ignore(() => { + // Chrome Android will hide the virtual keyboard when tapping + // inside an uneditable node, and not bring it back when we + // move the cursor to its proper position. This tries to + // restore the keyboard by cycling focus. + if (browser.android && browser.chrome && this.dom.contains(domSel.focusNode) && + inUneditable(domSel.focusNode, this.dom)) { + this.dom.blur(); + this.dom.focus({ preventScroll: true }); + } + let rawSel = getSelection(this.root); + if (main.empty) { + // Work around https://bugzilla.mozilla.org/show_bug.cgi?id=1612076 + if (browser.gecko) { + let nextTo = nextToUneditable(anchor.node, anchor.offset); + if (nextTo && nextTo != (1 /* Before */ | 2 /* After */)) { + let text = nearbyTextNode(anchor.node, anchor.offset, nextTo == 1 /* Before */ ? 1 : -1); + if (text) + anchor = new DOMPos(text, nextTo == 1 /* Before */ ? 0 : text.nodeValue.length); + } + } + rawSel.collapse(anchor.node, anchor.offset); + if (main.bidiLevel != null && domSel.cursorBidiLevel != null) + domSel.cursorBidiLevel = main.bidiLevel; + } + else if (rawSel.extend) { + // Selection.extend can be used to create an 'inverted' selection + // (one where the focus is before the anchor), but not all + // browsers support it yet. + rawSel.collapse(anchor.node, anchor.offset); + rawSel.extend(head.node, head.offset); + } + else { + // Primitive (IE) way + let range = document.createRange(); + if (main.anchor > main.head) + [anchor, head] = [head, anchor]; + range.setEnd(head.node, head.offset); + range.setStart(anchor.node, anchor.offset); + rawSel.removeAllRanges(); + rawSel.addRange(range); + } + }); + this.view.observer.setSelectionRange(anchor, head); + } + this.impreciseAnchor = anchor.precise ? null : new DOMPos(domSel.anchorNode, domSel.anchorOffset); + this.impreciseHead = head.precise ? null : new DOMPos(domSel.focusNode, domSel.focusOffset); + } + enforceCursorAssoc() { + if (this.compositionDeco.size) + return; + let cursor = this.view.state.selection.main; + let sel = getSelection(this.root); + if (!cursor.empty || !cursor.assoc || !sel.modify) + return; + let line = LineView.find(this, cursor.head); + if (!line) + return; + let lineStart = line.posAtStart; + if (cursor.head == lineStart || cursor.head == lineStart + line.length) + return; + let before = this.coordsAt(cursor.head, -1), after = this.coordsAt(cursor.head, 1); + if (!before || !after || before.bottom > after.top) + return; + let dom = this.domAtPos(cursor.head + cursor.assoc); + sel.collapse(dom.node, dom.offset); + sel.modify("move", cursor.assoc < 0 ? "forward" : "backward", "lineboundary"); + } + mayControlSelection() { + return this.view.state.facet(editable) ? this.root.activeElement == this.dom + : hasSelection(this.dom, this.view.observer.selectionRange); + } + nearest(dom) { + for (let cur = dom; cur;) { + let domView = ContentView.get(cur); + if (domView && domView.rootView == this) + return domView; + cur = cur.parentNode; + } + return null; + } + posFromDOM(node, offset) { + let view = this.nearest(node); + if (!view) + throw new RangeError("Trying to find position for a DOM position outside of the document"); + return view.localPosFromDOM(node, offset) + view.posAtStart; + } + domAtPos(pos) { + let { i, off } = this.childCursor().findPos(pos, -1); + for (; i < this.children.length - 1;) { + let child = this.children[i]; + if (off < child.length || child instanceof LineView) + break; + i++; + off = 0; + } + return this.children[i].domAtPos(off); + } + coordsAt(pos, side) { + for (let off = this.length, i = this.children.length - 1;; i--) { + let child = this.children[i], start = off - child.breakAfter - child.length; + if (pos > start || + (pos == start && child.type != BlockType.WidgetBefore && child.type != BlockType.WidgetAfter && + (!i || side == 2 || this.children[i - 1].breakAfter || + (this.children[i - 1].type == BlockType.WidgetBefore && side > -2)))) + return child.coordsAt(pos - start, side); + off = start; + } + } + measureVisibleLineHeights(viewport) { + let result = [], { from, to } = viewport; + let contentWidth = this.view.contentDOM.clientWidth; + let isWider = contentWidth > Math.max(this.view.scrollDOM.clientWidth, this.minWidth) + 1; + let widest = -1, ltr = this.view.textDirection == Direction.LTR; + for (let pos = 0, i = 0; i < this.children.length; i++) { + let child = this.children[i], end = pos + child.length; + if (end > to) + break; + if (pos >= from) { + let childRect = child.dom.getBoundingClientRect(); + result.push(childRect.height); + if (isWider) { + let last = child.dom.lastChild; + let rects = last ? clientRectsFor(last) : []; + if (rects.length) { + let rect = rects[rects.length - 1]; + let width = ltr ? rect.right - childRect.left : childRect.right - rect.left; + if (width > widest) { + widest = width; + this.minWidth = contentWidth; + this.minWidthFrom = pos; + this.minWidthTo = end; + } + } + } + } + pos = end + child.breakAfter; + } + return result; + } + textDirectionAt(pos) { + let { i } = this.childPos(pos, 1); + return getComputedStyle(this.children[i].dom).direction == "rtl" ? Direction.RTL : Direction.LTR; + } + measureTextSize() { + for (let child of this.children) { + if (child instanceof LineView) { + let measure = child.measureTextSize(); + if (measure) + return measure; + } + } + // If no workable line exists, force a layout of a measurable element + let dummy = document.createElement("div"), lineHeight, charWidth; + dummy.className = "cm-line"; + dummy.textContent = "abc def ghi jkl mno pqr stu"; + this.view.observer.ignore(() => { + this.dom.appendChild(dummy); + let rect = clientRectsFor(dummy.firstChild)[0]; + lineHeight = dummy.getBoundingClientRect().height; + charWidth = rect ? rect.width / 27 : 7; + dummy.remove(); + }); + return { lineHeight, charWidth }; + } + childCursor(pos = this.length) { + // Move back to start of last element when possible, so that + // `ChildCursor.findPos` doesn't have to deal with the edge case + // of being after the last element. + let i = this.children.length; + if (i) + pos -= this.children[--i].length; + return new ChildCursor(this.children, pos, i); + } + computeBlockGapDeco() { + let deco = [], vs = this.view.viewState; + for (let pos = 0, i = 0;; i++) { + let next = i == vs.viewports.length ? null : vs.viewports[i]; + let end = next ? next.from - 1 : this.length; + if (end > pos) { + let height = vs.lineBlockAt(end).bottom - vs.lineBlockAt(pos).top; + deco.push(Decoration.replace({ + widget: new BlockGapWidget(height), + block: true, + inclusive: true, + isBlockGap: true, + }).range(pos, end)); + } + if (!next) + break; + pos = next.to + 1; + } + return Decoration.set(deco); + } + updateDeco() { + let allDeco = this.view.state.facet(decorations).map((d, i) => { + let dynamic = this.dynamicDecorationMap[i] = typeof d == "function"; + return dynamic ? d(this.view) : d; + }); + for (let i = allDeco.length; i < allDeco.length + 3; i++) + this.dynamicDecorationMap[i] = false; + return this.decorations = [ + ...allDeco, + this.compositionDeco, + this.computeBlockGapDeco(), + this.view.viewState.lineGapDeco + ]; + } + scrollIntoView(target) { + let { range } = target; + let rect = this.coordsAt(range.head, range.empty ? range.assoc : range.head > range.anchor ? -1 : 1), other; + if (!rect) + return; + if (!range.empty && (other = this.coordsAt(range.anchor, range.anchor > range.head ? -1 : 1))) + rect = { left: Math.min(rect.left, other.left), top: Math.min(rect.top, other.top), + right: Math.max(rect.right, other.right), bottom: Math.max(rect.bottom, other.bottom) }; + let mLeft = 0, mRight = 0, mTop = 0, mBottom = 0; + for (let margins of this.view.state.facet(scrollMargins).map(f => f(this.view))) + if (margins) { + let { left, right, top, bottom } = margins; + if (left != null) + mLeft = Math.max(mLeft, left); + if (right != null) + mRight = Math.max(mRight, right); + if (top != null) + mTop = Math.max(mTop, top); + if (bottom != null) + mBottom = Math.max(mBottom, bottom); + } + let targetRect = { + left: rect.left - mLeft, top: rect.top - mTop, + right: rect.right + mRight, bottom: rect.bottom + mBottom + }; + scrollRectIntoView(this.view.scrollDOM, targetRect, range.head < range.anchor ? -1 : 1, target.x, target.y, target.xMargin, target.yMargin, this.view.textDirection == Direction.LTR); + } +} +function betweenUneditable(pos) { + return pos.node.nodeType == 1 && pos.node.firstChild && + (pos.offset == 0 || pos.node.childNodes[pos.offset - 1].contentEditable == "false") && + (pos.offset == pos.node.childNodes.length || pos.node.childNodes[pos.offset].contentEditable == "false"); +} +class BlockGapWidget extends WidgetType { + constructor(height) { + super(); + this.height = height; + } + toDOM() { + let elt = document.createElement("div"); + this.updateDOM(elt); + return elt; + } + eq(other) { return other.height == this.height; } + updateDOM(elt) { + elt.style.height = this.height + "px"; + return true; + } + get estimatedHeight() { return this.height; } +} +function compositionSurroundingNode(view) { + let sel = view.observer.selectionRange; + let textNode = sel.focusNode && nearbyTextNode(sel.focusNode, sel.focusOffset, 0); + if (!textNode) + return null; + let cView = view.docView.nearest(textNode); + if (!cView) + return null; + if (cView instanceof LineView) { + let topNode = textNode; + while (topNode.parentNode != cView.dom) + topNode = topNode.parentNode; + let prev = topNode.previousSibling; + while (prev && !ContentView.get(prev)) + prev = prev.previousSibling; + let pos = prev ? ContentView.get(prev).posAtEnd : cView.posAtStart; + return { from: pos, to: pos, node: topNode, text: textNode }; + } + else { + for (;;) { + let { parent } = cView; + if (!parent) + return null; + if (parent instanceof LineView) + break; + cView = parent; + } + let from = cView.posAtStart; + return { from, to: from + cView.length, node: cView.dom, text: textNode }; + } +} +function computeCompositionDeco(view, changes) { + let surrounding = compositionSurroundingNode(view); + if (!surrounding) + return Decoration.none; + let { from, to, node, text: textNode } = surrounding; + let newFrom = changes.mapPos(from, 1), newTo = Math.max(newFrom, changes.mapPos(to, -1)); + let { state } = view, text = node.nodeType == 3 ? node.nodeValue : + new DOMReader([], state).readRange(node.firstChild, null).text; + if (newTo - newFrom < text.length) { + if (state.doc.sliceString(newFrom, Math.min(state.doc.length, newFrom + text.length), LineBreakPlaceholder) == text) + newTo = newFrom + text.length; + else if (state.doc.sliceString(Math.max(0, newTo - text.length), newTo, LineBreakPlaceholder) == text) + newFrom = newTo - text.length; + else + return Decoration.none; + } + else if (state.doc.sliceString(newFrom, newTo, LineBreakPlaceholder) != text) { + return Decoration.none; + } + let topView = ContentView.get(node); + if (topView instanceof CompositionView) + topView = topView.widget.topView; + else if (topView) + topView.parent = null; + return Decoration.set(Decoration.replace({ widget: new CompositionWidget(node, textNode, topView), inclusive: true }) + .range(newFrom, newTo)); +} +class CompositionWidget extends WidgetType { + constructor(top, text, topView) { + super(); + this.top = top; + this.text = text; + this.topView = topView; + } + eq(other) { return this.top == other.top && this.text == other.text; } + toDOM() { return this.top; } + ignoreEvent() { return false; } + get customView() { return CompositionView; } +} +function nearbyTextNode(node, offset, side) { + for (;;) { + if (node.nodeType == 3) + return node; + if (node.nodeType == 1 && offset > 0 && side <= 0) { + node = node.childNodes[offset - 1]; + offset = maxOffset(node); + } + else if (node.nodeType == 1 && offset < node.childNodes.length && side >= 0) { + node = node.childNodes[offset]; + offset = 0; + } + else { + return null; + } + } +} +function nextToUneditable(node, offset) { + if (node.nodeType != 1) + return 0; + return (offset && node.childNodes[offset - 1].contentEditable == "false" ? 1 /* Before */ : 0) | + (offset < node.childNodes.length && node.childNodes[offset].contentEditable == "false" ? 2 /* After */ : 0); +} +class DecorationComparator$1 { + constructor() { + this.changes = []; + } + compareRange(from, to) { addRange(from, to, this.changes); } + comparePoint(from, to) { addRange(from, to, this.changes); } +} +function findChangedDeco(a, b, diff) { + let comp = new DecorationComparator$1; + RangeSet.compare(a, b, diff, comp); + return comp.changes; +} +function inUneditable(node, inside) { + for (let cur = node; cur && cur != inside; cur = cur.assignedSlot || cur.parentNode) { + if (cur.nodeType == 1 && cur.contentEditable == 'false') { + return true; + } + } + return false; +} + +function groupAt(state, pos, bias = 1) { + let categorize = state.charCategorizer(pos); + let line = state.doc.lineAt(pos), linePos = pos - line.from; + if (line.length == 0) + return EditorSelection.cursor(pos); + if (linePos == 0) + bias = 1; + else if (linePos == line.length) + bias = -1; + let from = linePos, to = linePos; + if (bias < 0) + from = findClusterBreak(line.text, linePos, false); + else + to = findClusterBreak(line.text, linePos); + let cat = categorize(line.text.slice(from, to)); + while (from > 0) { + let prev = findClusterBreak(line.text, from, false); + if (categorize(line.text.slice(prev, from)) != cat) + break; + from = prev; + } + while (to < line.length) { + let next = findClusterBreak(line.text, to); + if (categorize(line.text.slice(to, next)) != cat) + break; + to = next; + } + return EditorSelection.range(from + line.from, to + line.from); +} +// Search the DOM for the {node, offset} position closest to the given +// coordinates. Very inefficient and crude, but can usually be avoided +// by calling caret(Position|Range)FromPoint instead. +function getdx(x, rect) { + return rect.left > x ? rect.left - x : Math.max(0, x - rect.right); +} +function getdy(y, rect) { + return rect.top > y ? rect.top - y : Math.max(0, y - rect.bottom); +} +function yOverlap(a, b) { + return a.top < b.bottom - 1 && a.bottom > b.top + 1; +} +function upTop(rect, top) { + return top < rect.top ? { top, left: rect.left, right: rect.right, bottom: rect.bottom } : rect; +} +function upBot(rect, bottom) { + return bottom > rect.bottom ? { top: rect.top, left: rect.left, right: rect.right, bottom } : rect; +} +function domPosAtCoords(parent, x, y) { + let closest, closestRect, closestX, closestY; + let above, below, aboveRect, belowRect; + for (let child = parent.firstChild; child; child = child.nextSibling) { + let rects = clientRectsFor(child); + for (let i = 0; i < rects.length; i++) { + let rect = rects[i]; + if (closestRect && yOverlap(closestRect, rect)) + rect = upTop(upBot(rect, closestRect.bottom), closestRect.top); + let dx = getdx(x, rect), dy = getdy(y, rect); + if (dx == 0 && dy == 0) + return child.nodeType == 3 ? domPosInText(child, x, y) : domPosAtCoords(child, x, y); + if (!closest || closestY > dy || closestY == dy && closestX > dx) { + closest = child; + closestRect = rect; + closestX = dx; + closestY = dy; + } + if (dx == 0) { + if (y > rect.bottom && (!aboveRect || aboveRect.bottom < rect.bottom)) { + above = child; + aboveRect = rect; + } + else if (y < rect.top && (!belowRect || belowRect.top > rect.top)) { + below = child; + belowRect = rect; + } + } + else if (aboveRect && yOverlap(aboveRect, rect)) { + aboveRect = upBot(aboveRect, rect.bottom); + } + else if (belowRect && yOverlap(belowRect, rect)) { + belowRect = upTop(belowRect, rect.top); + } + } + } + if (aboveRect && aboveRect.bottom >= y) { + closest = above; + closestRect = aboveRect; + } + else if (belowRect && belowRect.top <= y) { + closest = below; + closestRect = belowRect; + } + if (!closest) + return { node: parent, offset: 0 }; + let clipX = Math.max(closestRect.left, Math.min(closestRect.right, x)); + if (closest.nodeType == 3) + return domPosInText(closest, clipX, y); + if (!closestX && closest.contentEditable == "true") + return domPosAtCoords(closest, clipX, y); + let offset = Array.prototype.indexOf.call(parent.childNodes, closest) + + (x >= (closestRect.left + closestRect.right) / 2 ? 1 : 0); + return { node: parent, offset }; +} +function domPosInText(node, x, y) { + let len = node.nodeValue.length; + let closestOffset = -1, closestDY = 1e9, generalSide = 0; + for (let i = 0; i < len; i++) { + let rects = textRange(node, i, i + 1).getClientRects(); + for (let j = 0; j < rects.length; j++) { + let rect = rects[j]; + if (rect.top == rect.bottom) + continue; + if (!generalSide) + generalSide = x - rect.left; + let dy = (rect.top > y ? rect.top - y : y - rect.bottom) - 1; + if (rect.left - 1 <= x && rect.right + 1 >= x && dy < closestDY) { + let right = x >= (rect.left + rect.right) / 2, after = right; + if (browser.chrome || browser.gecko) { + // Check for RTL on browsers that support getting client + // rects for empty ranges. + let rectBefore = textRange(node, i).getBoundingClientRect(); + if (rectBefore.left == rect.right) + after = !right; + } + if (dy <= 0) + return { node, offset: i + (after ? 1 : 0) }; + closestOffset = i + (after ? 1 : 0); + closestDY = dy; + } + } + } + return { node, offset: closestOffset > -1 ? closestOffset : generalSide > 0 ? node.nodeValue.length : 0 }; +} +function posAtCoords(view, { x, y }, precise, bias = -1) { + var _a; + let content = view.contentDOM.getBoundingClientRect(), docTop = content.top + view.viewState.paddingTop; + let block, { docHeight } = view.viewState; + let yOffset = y - docTop; + if (yOffset < 0) + return 0; + if (yOffset > docHeight) + return view.state.doc.length; + // Scan for a text block near the queried y position + for (let halfLine = view.defaultLineHeight / 2, bounced = false;;) { + block = view.elementAtHeight(yOffset); + if (block.type == BlockType.Text) + break; + for (;;) { + // Move the y position out of this block + yOffset = bias > 0 ? block.bottom + halfLine : block.top - halfLine; + if (yOffset >= 0 && yOffset <= docHeight) + break; + // If the document consists entirely of replaced widgets, we + // won't find a text block, so return 0 + if (bounced) + return precise ? null : 0; + bounced = true; + bias = -bias; + } + } + y = docTop + yOffset; + let lineStart = block.from; + // If this is outside of the rendered viewport, we can't determine a position + if (lineStart < view.viewport.from) + return view.viewport.from == 0 ? 0 : precise ? null : posAtCoordsImprecise(view, content, block, x, y); + if (lineStart > view.viewport.to) + return view.viewport.to == view.state.doc.length ? view.state.doc.length : + precise ? null : posAtCoordsImprecise(view, content, block, x, y); + // Prefer ShadowRootOrDocument.elementFromPoint if present, fall back to document if not + let doc = view.dom.ownerDocument; + let root = view.root.elementFromPoint ? view.root : doc; + let element = root.elementFromPoint(x, y); + if (element && !view.contentDOM.contains(element)) + element = null; + // If the element is unexpected, clip x at the sides of the content area and try again + if (!element) { + x = Math.max(content.left + 1, Math.min(content.right - 1, x)); + element = root.elementFromPoint(x, y); + if (element && !view.contentDOM.contains(element)) + element = null; + } + // There's visible editor content under the point, so we can try + // using caret(Position|Range)FromPoint as a shortcut + let node, offset = -1; + if (element && ((_a = view.docView.nearest(element)) === null || _a === void 0 ? void 0 : _a.isEditable) != false) { + if (doc.caretPositionFromPoint) { + let pos = doc.caretPositionFromPoint(x, y); + if (pos) + ({ offsetNode: node, offset } = pos); + } + else if (doc.caretRangeFromPoint) { + let range = doc.caretRangeFromPoint(x, y); + if (range) { + ({ startContainer: node, startOffset: offset } = range); + if (browser.safari && isSuspiciousCaretResult(node, offset, x)) + node = undefined; + } + } + } + // No luck, do our own (potentially expensive) search + if (!node || !view.docView.dom.contains(node)) { + let line = LineView.find(view.docView, lineStart); + if (!line) + return yOffset > block.top + block.height / 2 ? block.to : block.from; + ({ node, offset } = domPosAtCoords(line.dom, x, y)); + } + return view.docView.posFromDOM(node, offset); +} +function posAtCoordsImprecise(view, contentRect, block, x, y) { + let into = Math.round((x - contentRect.left) * view.defaultCharacterWidth); + if (view.lineWrapping && block.height > view.defaultLineHeight * 1.5) { + let line = Math.floor((y - block.top) / view.defaultLineHeight); + into += line * view.viewState.heightOracle.lineLength; + } + let content = view.state.sliceDoc(block.from, block.to); + return block.from + findColumn(content, into, view.state.tabSize); +} +// In case of a high line height, Safari's caretRangeFromPoint treats +// the space between lines as belonging to the last character of the +// line before. This is used to detect such a result so that it can be +// ignored (issue #401). +function isSuspiciousCaretResult(node, offset, x) { + let len; + if (node.nodeType != 3 || offset != (len = node.nodeValue.length)) + return false; + for (let next = node.nextSibling; next; next = next.nextSibling) + if (next.nodeType != 1 || next.nodeName != "BR") + return false; + return textRange(node, len - 1, len).getBoundingClientRect().left > x; +} +function moveToLineBoundary(view, start, forward, includeWrap) { + let line = view.state.doc.lineAt(start.head); + let coords = !includeWrap || !view.lineWrapping ? null + : view.coordsAtPos(start.assoc < 0 && start.head > line.from ? start.head - 1 : start.head); + if (coords) { + let editorRect = view.dom.getBoundingClientRect(); + let direction = view.textDirectionAt(line.from); + let pos = view.posAtCoords({ x: forward == (direction == Direction.LTR) ? editorRect.right - 1 : editorRect.left + 1, + y: (coords.top + coords.bottom) / 2 }); + if (pos != null) + return EditorSelection.cursor(pos, forward ? -1 : 1); + } + let lineView = LineView.find(view.docView, start.head); + let end = lineView ? (forward ? lineView.posAtEnd : lineView.posAtStart) : (forward ? line.to : line.from); + return EditorSelection.cursor(end, forward ? -1 : 1); +} +function moveByChar(view, start, forward, by) { + let line = view.state.doc.lineAt(start.head), spans = view.bidiSpans(line); + let direction = view.textDirectionAt(line.from); + for (let cur = start, check = null;;) { + let next = moveVisually(line, spans, direction, cur, forward), char = movedOver; + if (!next) { + if (line.number == (forward ? view.state.doc.lines : 1)) + return cur; + char = "\n"; + line = view.state.doc.line(line.number + (forward ? 1 : -1)); + spans = view.bidiSpans(line); + next = EditorSelection.cursor(forward ? line.from : line.to); + } + if (!check) { + if (!by) + return next; + check = by(char); + } + else if (!check(char)) { + return cur; + } + cur = next; + } +} +function byGroup(view, pos, start) { + let categorize = view.state.charCategorizer(pos); + let cat = categorize(start); + return (next) => { + let nextCat = categorize(next); + if (cat == CharCategory.Space) + cat = nextCat; + return cat == nextCat; + }; +} +function moveVertically(view, start, forward, distance) { + let startPos = start.head, dir = forward ? 1 : -1; + if (startPos == (forward ? view.state.doc.length : 0)) + return EditorSelection.cursor(startPos, start.assoc); + let goal = start.goalColumn, startY; + let rect = view.contentDOM.getBoundingClientRect(); + let startCoords = view.coordsAtPos(startPos), docTop = view.documentTop; + if (startCoords) { + if (goal == null) + goal = startCoords.left - rect.left; + startY = dir < 0 ? startCoords.top : startCoords.bottom; + } + else { + let line = view.viewState.lineBlockAt(startPos); + if (goal == null) + goal = Math.min(rect.right - rect.left, view.defaultCharacterWidth * (startPos - line.from)); + startY = (dir < 0 ? line.top : line.bottom) + docTop; + } + let resolvedGoal = rect.left + goal; + let dist = distance !== null && distance !== void 0 ? distance : (view.defaultLineHeight >> 1); + for (let extra = 0;; extra += 10) { + let curY = startY + (dist + extra) * dir; + let pos = posAtCoords(view, { x: resolvedGoal, y: curY }, false, dir); + if (curY < rect.top || curY > rect.bottom || (dir < 0 ? pos < startPos : pos > startPos)) + return EditorSelection.cursor(pos, start.assoc, undefined, goal); + } +} +function skipAtoms(view, oldPos, pos) { + let atoms = view.state.facet(atomicRanges).map(f => f(view)); + for (;;) { + let moved = false; + for (let set of atoms) { + set.between(pos.from - 1, pos.from + 1, (from, to, value) => { + if (pos.from > from && pos.from < to) { + pos = oldPos.from > pos.from ? EditorSelection.cursor(from, 1) : EditorSelection.cursor(to, -1); + moved = true; + } + }); + } + if (!moved) + return pos; + } +} + +// This will also be where dragging info and such goes +class InputState { + constructor(view) { + this.lastKeyCode = 0; + this.lastKeyTime = 0; + this.chromeScrollHack = -1; + // On iOS, some keys need to have their default behavior happen + // (after which we retroactively handle them and reset the DOM) to + // avoid messing up the virtual keyboard state. + this.pendingIOSKey = undefined; + this.lastSelectionOrigin = null; + this.lastSelectionTime = 0; + this.lastEscPress = 0; + this.lastContextMenu = 0; + this.scrollHandlers = []; + this.registeredEvents = []; + this.customHandlers = []; + // -1 means not in a composition. Otherwise, this counts the number + // of changes made during the composition. The count is used to + // avoid treating the start state of the composition, before any + // changes have been made, as part of the composition. + this.composing = -1; + // Tracks whether the next change should be marked as starting the + // composition (null means no composition, true means next is the + // first, false means first has already been marked for this + // composition) + this.compositionFirstChange = null; + this.compositionEndedAt = 0; + this.rapidCompositionStart = false; + this.mouseSelection = null; + for (let type in handlers) { + let handler = handlers[type]; + view.contentDOM.addEventListener(type, (event) => { + if (!eventBelongsToEditor(view, event) || this.ignoreDuringComposition(event)) + return; + if (type == "keydown" && this.keydown(view, event)) + return; + if (this.mustFlushObserver(event)) + view.observer.forceFlush(); + if (this.runCustomHandlers(type, view, event)) + event.preventDefault(); + else + handler(view, event); + }); + this.registeredEvents.push(type); + } + if (browser.chrome && browser.chrome_version >= 102) { + // On Chrome 102, viewport updates somehow stop wheel-based + // scrolling. Turning off pointer events during the scroll seems + // to avoid the issue. + view.scrollDOM.addEventListener("wheel", () => { + if (this.chromeScrollHack < 0) + view.contentDOM.style.pointerEvents = "none"; + else + window.clearTimeout(this.chromeScrollHack); + this.chromeScrollHack = setTimeout(() => { + this.chromeScrollHack = -1; + view.contentDOM.style.pointerEvents = ""; + }, 100); + }, { passive: true }); + } + this.notifiedFocused = view.hasFocus; + // On Safari adding an input event handler somehow prevents an + // issue where the composition vanishes when you press enter. + if (browser.safari) + view.contentDOM.addEventListener("input", () => null); + } + setSelectionOrigin(origin) { + this.lastSelectionOrigin = origin; + this.lastSelectionTime = Date.now(); + } + ensureHandlers(view, plugins) { + var _a; + let handlers; + this.customHandlers = []; + for (let plugin of plugins) + if (handlers = (_a = plugin.update(view).spec) === null || _a === void 0 ? void 0 : _a.domEventHandlers) { + this.customHandlers.push({ plugin: plugin.value, handlers }); + for (let type in handlers) + if (this.registeredEvents.indexOf(type) < 0 && type != "scroll") { + this.registeredEvents.push(type); + view.contentDOM.addEventListener(type, (event) => { + if (!eventBelongsToEditor(view, event)) + return; + if (this.runCustomHandlers(type, view, event)) + event.preventDefault(); + }); + } + } + } + runCustomHandlers(type, view, event) { + for (let set of this.customHandlers) { + let handler = set.handlers[type]; + if (handler) { + try { + if (handler.call(set.plugin, event, view) || event.defaultPrevented) + return true; + } + catch (e) { + logException(view.state, e); + } + } + } + return false; + } + runScrollHandlers(view, event) { + for (let set of this.customHandlers) { + let handler = set.handlers.scroll; + if (handler) { + try { + handler.call(set.plugin, event, view); + } + catch (e) { + logException(view.state, e); + } + } + } + } + keydown(view, event) { + // Must always run, even if a custom handler handled the event + this.lastKeyCode = event.keyCode; + this.lastKeyTime = Date.now(); + if (event.keyCode == 9 && Date.now() < this.lastEscPress + 2000) + return true; + // Chrome for Android usually doesn't fire proper key events, but + // occasionally does, usually surrounded by a bunch of complicated + // composition changes. When an enter or backspace key event is + // seen, hold off on handling DOM events for a bit, and then + // dispatch it. + if (browser.android && browser.chrome && !event.synthetic && + (event.keyCode == 13 || event.keyCode == 8)) { + view.observer.delayAndroidKey(event.key, event.keyCode); + return true; + } + // Prevent the default behavior of Enter on iOS makes the + // virtual keyboard get stuck in the wrong (lowercase) + // state. So we let it go through, and then, in + // applyDOMChange, notify key handlers of it and reset to + // the state they produce. + let pending; + if (browser.ios && (pending = PendingKeys.find(key => key.keyCode == event.keyCode)) && + !(event.ctrlKey || event.altKey || event.metaKey) && !event.synthetic) { + this.pendingIOSKey = pending; + setTimeout(() => this.flushIOSKey(view), 250); + return true; + } + return false; + } + flushIOSKey(view) { + let key = this.pendingIOSKey; + if (!key) + return false; + this.pendingIOSKey = undefined; + return dispatchKey(view.contentDOM, key.key, key.keyCode); + } + ignoreDuringComposition(event) { + if (!/^key/.test(event.type)) + return false; + if (this.composing > 0) + return true; + // See https://www.stum.de/2016/06/24/handling-ime-events-in-javascript/. + // On some input method editors (IMEs), the Enter key is used to + // confirm character selection. On Safari, when Enter is pressed, + // compositionend and keydown events are sometimes emitted in the + // wrong order. The key event should still be ignored, even when + // it happens after the compositionend event. + if (browser.safari && Date.now() - this.compositionEndedAt < 100) { + this.compositionEndedAt = 0; + return true; + } + return false; + } + mustFlushObserver(event) { + return (event.type == "keydown" && event.keyCode != 229) || + event.type == "compositionend" && !browser.ios; + } + startMouseSelection(mouseSelection) { + if (this.mouseSelection) + this.mouseSelection.destroy(); + this.mouseSelection = mouseSelection; + } + update(update) { + if (this.mouseSelection) + this.mouseSelection.update(update); + if (update.transactions.length) + this.lastKeyCode = this.lastSelectionTime = 0; + } + destroy() { + if (this.mouseSelection) + this.mouseSelection.destroy(); + } +} +const PendingKeys = [ + { key: "Backspace", keyCode: 8, inputType: "deleteContentBackward" }, + { key: "Enter", keyCode: 13, inputType: "insertParagraph" }, + { key: "Delete", keyCode: 46, inputType: "deleteContentForward" } +]; +// Key codes for modifier keys +const modifierCodes = [16, 17, 18, 20, 91, 92, 224, 225]; +class MouseSelection { + constructor(view, startEvent, style, mustSelect) { + this.view = view; + this.style = style; + this.mustSelect = mustSelect; + this.lastEvent = startEvent; + let doc = view.contentDOM.ownerDocument; + doc.addEventListener("mousemove", this.move = this.move.bind(this)); + doc.addEventListener("mouseup", this.up = this.up.bind(this)); + this.extend = startEvent.shiftKey; + this.multiple = view.state.facet(EditorState.allowMultipleSelections) && addsSelectionRange(view, startEvent); + this.dragMove = dragMovesSelection(view, startEvent); + this.dragging = isInPrimarySelection(view, startEvent) && getClickType(startEvent) == 1 ? null : false; + // When clicking outside of the selection, immediately apply the + // effect of starting the selection + if (this.dragging === false) { + startEvent.preventDefault(); + this.select(startEvent); + } + } + move(event) { + if (event.buttons == 0) + return this.destroy(); + if (this.dragging !== false) + return; + this.select(this.lastEvent = event); + } + up(event) { + if (this.dragging == null) + this.select(this.lastEvent); + if (!this.dragging) + event.preventDefault(); + this.destroy(); + } + destroy() { + let doc = this.view.contentDOM.ownerDocument; + doc.removeEventListener("mousemove", this.move); + doc.removeEventListener("mouseup", this.up); + this.view.inputState.mouseSelection = null; + } + select(event) { + let selection = this.style.get(event, this.extend, this.multiple); + if (this.mustSelect || !selection.eq(this.view.state.selection) || + selection.main.assoc != this.view.state.selection.main.assoc) + this.view.dispatch({ + selection, + userEvent: "select.pointer", + scrollIntoView: true + }); + this.mustSelect = false; + } + update(update) { + if (update.docChanged && this.dragging) + this.dragging = this.dragging.map(update.changes); + if (this.style.update(update)) + setTimeout(() => this.select(this.lastEvent), 20); + } +} +function addsSelectionRange(view, event) { + let facet = view.state.facet(clickAddsSelectionRange); + return facet.length ? facet[0](event) : browser.mac ? event.metaKey : event.ctrlKey; +} +function dragMovesSelection(view, event) { + let facet = view.state.facet(dragMovesSelection$1); + return facet.length ? facet[0](event) : browser.mac ? !event.altKey : !event.ctrlKey; +} +function isInPrimarySelection(view, event) { + let { main } = view.state.selection; + if (main.empty) + return false; + // On boundary clicks, check whether the coordinates are inside the + // selection's client rectangles + let sel = getSelection(view.root); + if (sel.rangeCount == 0) + return true; + let rects = sel.getRangeAt(0).getClientRects(); + for (let i = 0; i < rects.length; i++) { + let rect = rects[i]; + if (rect.left <= event.clientX && rect.right >= event.clientX && + rect.top <= event.clientY && rect.bottom >= event.clientY) + return true; + } + return false; +} +function eventBelongsToEditor(view, event) { + if (!event.bubbles) + return true; + if (event.defaultPrevented) + return false; + for (let node = event.target, cView; node != view.contentDOM; node = node.parentNode) + if (!node || node.nodeType == 11 || ((cView = ContentView.get(node)) && cView.ignoreEvent(event))) + return false; + return true; +} +const handlers = /*@__PURE__*/Object.create(null); +// This is very crude, but unfortunately both these browsers _pretend_ +// that they have a clipboard API—all the objects and methods are +// there, they just don't work, and they are hard to test. +const brokenClipboardAPI = (browser.ie && browser.ie_version < 15) || + (browser.ios && browser.webkit_version < 604); +function capturePaste(view) { + let parent = view.dom.parentNode; + if (!parent) + return; + let target = parent.appendChild(document.createElement("textarea")); + target.style.cssText = "position: fixed; left: -10000px; top: 10px"; + target.focus(); + setTimeout(() => { + view.focus(); + target.remove(); + doPaste(view, target.value); + }, 50); +} +function doPaste(view, input) { + let { state } = view, changes, i = 1, text = state.toText(input); + let byLine = text.lines == state.selection.ranges.length; + let linewise = lastLinewiseCopy != null && state.selection.ranges.every(r => r.empty) && lastLinewiseCopy == text.toString(); + if (linewise) { + let lastLine = -1; + changes = state.changeByRange(range => { + let line = state.doc.lineAt(range.from); + if (line.from == lastLine) + return { range }; + lastLine = line.from; + let insert = state.toText((byLine ? text.line(i++).text : input) + state.lineBreak); + return { changes: { from: line.from, insert }, + range: EditorSelection.cursor(range.from + insert.length) }; + }); + } + else if (byLine) { + changes = state.changeByRange(range => { + let line = text.line(i++); + return { changes: { from: range.from, to: range.to, insert: line.text }, + range: EditorSelection.cursor(range.from + line.length) }; + }); + } + else { + changes = state.replaceSelection(text); + } + view.dispatch(changes, { + userEvent: "input.paste", + scrollIntoView: true + }); +} +handlers.keydown = (view, event) => { + view.inputState.setSelectionOrigin("select"); + if (event.keyCode == 27) + view.inputState.lastEscPress = Date.now(); + else if (modifierCodes.indexOf(event.keyCode) < 0) + view.inputState.lastEscPress = 0; +}; +let lastTouch = 0; +handlers.touchstart = (view, e) => { + lastTouch = Date.now(); + view.inputState.setSelectionOrigin("select.pointer"); +}; +handlers.touchmove = view => { + view.inputState.setSelectionOrigin("select.pointer"); +}; +handlers.mousedown = (view, event) => { + view.observer.flush(); + if (lastTouch > Date.now() - 2000 && getClickType(event) == 1) + return; // Ignore touch interaction + let style = null; + for (let makeStyle of view.state.facet(mouseSelectionStyle)) { + style = makeStyle(view, event); + if (style) + break; + } + if (!style && event.button == 0) + style = basicMouseSelection(view, event); + if (style) { + let mustFocus = view.root.activeElement != view.contentDOM; + if (mustFocus) + view.observer.ignore(() => focusPreventScroll(view.contentDOM)); + view.inputState.startMouseSelection(new MouseSelection(view, event, style, mustFocus)); + } +}; +function rangeForClick(view, pos, bias, type) { + if (type == 1) { // Single click + return EditorSelection.cursor(pos, bias); + } + else if (type == 2) { // Double click + return groupAt(view.state, pos, bias); + } + else { // Triple click + let visual = LineView.find(view.docView, pos), line = view.state.doc.lineAt(visual ? visual.posAtEnd : pos); + let from = visual ? visual.posAtStart : line.from, to = visual ? visual.posAtEnd : line.to; + if (to < view.state.doc.length && to == line.to) + to++; + return EditorSelection.range(from, to); + } +} +let insideY = (y, rect) => y >= rect.top && y <= rect.bottom; +let inside = (x, y, rect) => insideY(y, rect) && x >= rect.left && x <= rect.right; +// Try to determine, for the given coordinates, associated with the +// given position, whether they are related to the element before or +// the element after the position. +function findPositionSide(view, pos, x, y) { + let line = LineView.find(view.docView, pos); + if (!line) + return 1; + let off = pos - line.posAtStart; + // Line boundaries point into the line + if (off == 0) + return 1; + if (off == line.length) + return -1; + // Positions on top of an element point at that element + let before = line.coordsAt(off, -1); + if (before && inside(x, y, before)) + return -1; + let after = line.coordsAt(off, 1); + if (after && inside(x, y, after)) + return 1; + // This is probably a line wrap point. Pick before if the point is + // beside it. + return before && insideY(y, before) ? -1 : 1; +} +function queryPos(view, event) { + let pos = view.posAtCoords({ x: event.clientX, y: event.clientY }, false); + return { pos, bias: findPositionSide(view, pos, event.clientX, event.clientY) }; +} +const BadMouseDetail = browser.ie && browser.ie_version <= 11; +let lastMouseDown = null, lastMouseDownCount = 0, lastMouseDownTime = 0; +function getClickType(event) { + if (!BadMouseDetail) + return event.detail; + let last = lastMouseDown, lastTime = lastMouseDownTime; + lastMouseDown = event; + lastMouseDownTime = Date.now(); + return lastMouseDownCount = !last || (lastTime > Date.now() - 400 && Math.abs(last.clientX - event.clientX) < 2 && + Math.abs(last.clientY - event.clientY) < 2) ? (lastMouseDownCount + 1) % 3 : 1; +} +function basicMouseSelection(view, event) { + let start = queryPos(view, event), type = getClickType(event); + let startSel = view.state.selection; + let last = start, lastEvent = event; + return { + update(update) { + if (update.docChanged) { + if (start) + start.pos = update.changes.mapPos(start.pos); + startSel = startSel.map(update.changes); + lastEvent = null; + } + }, + get(event, extend, multiple) { + let cur; + if (lastEvent && event.clientX == lastEvent.clientX && event.clientY == lastEvent.clientY) + cur = last; + else { + cur = last = queryPos(view, event); + lastEvent = event; + } + if (!cur || !start) + return startSel; + let range = rangeForClick(view, cur.pos, cur.bias, type); + if (start.pos != cur.pos && !extend) { + let startRange = rangeForClick(view, start.pos, start.bias, type); + let from = Math.min(startRange.from, range.from), to = Math.max(startRange.to, range.to); + range = from < range.from ? EditorSelection.range(from, to) : EditorSelection.range(to, from); + } + if (extend) + return startSel.replaceRange(startSel.main.extend(range.from, range.to)); + else if (multiple) + return startSel.addRange(range); + else + return EditorSelection.create([range]); + } + }; +} +handlers.dragstart = (view, event) => { + let { selection: { main } } = view.state; + let { mouseSelection } = view.inputState; + if (mouseSelection) + mouseSelection.dragging = main; + if (event.dataTransfer) { + event.dataTransfer.setData("Text", view.state.sliceDoc(main.from, main.to)); + event.dataTransfer.effectAllowed = "copyMove"; + } +}; +function dropText(view, event, text, direct) { + if (!text) + return; + let dropPos = view.posAtCoords({ x: event.clientX, y: event.clientY }, false); + event.preventDefault(); + let { mouseSelection } = view.inputState; + let del = direct && mouseSelection && mouseSelection.dragging && mouseSelection.dragMove ? + { from: mouseSelection.dragging.from, to: mouseSelection.dragging.to } : null; + let ins = { from: dropPos, insert: text }; + let changes = view.state.changes(del ? [del, ins] : ins); + view.focus(); + view.dispatch({ + changes, + selection: { anchor: changes.mapPos(dropPos, -1), head: changes.mapPos(dropPos, 1) }, + userEvent: del ? "move.drop" : "input.drop" + }); +} +handlers.drop = (view, event) => { + if (!event.dataTransfer) + return; + if (view.state.readOnly) + return event.preventDefault(); + let files = event.dataTransfer.files; + if (files && files.length) { // For a file drop, read the file's text. + event.preventDefault(); + let text = Array(files.length), read = 0; + let finishFile = () => { + if (++read == files.length) + dropText(view, event, text.filter(s => s != null).join(view.state.lineBreak), false); + }; + for (let i = 0; i < files.length; i++) { + let reader = new FileReader; + reader.onerror = finishFile; + reader.onload = () => { + if (!/[\x00-\x08\x0e-\x1f]{2}/.test(reader.result)) + text[i] = reader.result; + finishFile(); + }; + reader.readAsText(files[i]); + } + } + else { + dropText(view, event, event.dataTransfer.getData("Text"), true); + } +}; +handlers.paste = (view, event) => { + if (view.state.readOnly) + return event.preventDefault(); + view.observer.flush(); + let data = brokenClipboardAPI ? null : event.clipboardData; + if (data) { + doPaste(view, data.getData("text/plain")); + event.preventDefault(); + } + else { + capturePaste(view); + } +}; +function captureCopy(view, text) { + // The extra wrapper is somehow necessary on IE/Edge to prevent the + // content from being mangled when it is put onto the clipboard + let parent = view.dom.parentNode; + if (!parent) + return; + let target = parent.appendChild(document.createElement("textarea")); + target.style.cssText = "position: fixed; left: -10000px; top: 10px"; + target.value = text; + target.focus(); + target.selectionEnd = text.length; + target.selectionStart = 0; + setTimeout(() => { + target.remove(); + view.focus(); + }, 50); +} +function copiedRange(state) { + let content = [], ranges = [], linewise = false; + for (let range of state.selection.ranges) + if (!range.empty) { + content.push(state.sliceDoc(range.from, range.to)); + ranges.push(range); + } + if (!content.length) { + // Nothing selected, do a line-wise copy + let upto = -1; + for (let { from } of state.selection.ranges) { + let line = state.doc.lineAt(from); + if (line.number > upto) { + content.push(line.text); + ranges.push({ from: line.from, to: Math.min(state.doc.length, line.to + 1) }); + } + upto = line.number; + } + linewise = true; + } + return { text: content.join(state.lineBreak), ranges, linewise }; +} +let lastLinewiseCopy = null; +handlers.copy = handlers.cut = (view, event) => { + let { text, ranges, linewise } = copiedRange(view.state); + if (!text && !linewise) + return; + lastLinewiseCopy = linewise ? text : null; + let data = brokenClipboardAPI ? null : event.clipboardData; + if (data) { + event.preventDefault(); + data.clearData(); + data.setData("text/plain", text); + } + else { + captureCopy(view, text); + } + if (event.type == "cut" && !view.state.readOnly) + view.dispatch({ + changes: ranges, + scrollIntoView: true, + userEvent: "delete.cut" + }); +}; +function updateForFocusChange(view) { + setTimeout(() => { + if (view.hasFocus != view.inputState.notifiedFocused) + view.update([]); + }, 10); +} +handlers.focus = updateForFocusChange; +handlers.blur = view => { + view.observer.clearSelectionRange(); + updateForFocusChange(view); +}; +function forceClearComposition(view, rapid) { + if (view.docView.compositionDeco.size) { + view.inputState.rapidCompositionStart = rapid; + try { + view.update([]); + } + finally { + view.inputState.rapidCompositionStart = false; + } + } +} +handlers.compositionstart = handlers.compositionupdate = view => { + if (view.inputState.compositionFirstChange == null) + view.inputState.compositionFirstChange = true; + if (view.inputState.composing < 0) { + // FIXME possibly set a timeout to clear it again on Android + view.inputState.composing = 0; + if (view.docView.compositionDeco.size) { + view.observer.flush(); + forceClearComposition(view, true); + } + } +}; +handlers.compositionend = view => { + view.inputState.composing = -1; + view.inputState.compositionEndedAt = Date.now(); + view.inputState.compositionFirstChange = null; + setTimeout(() => { + if (view.inputState.composing < 0) + forceClearComposition(view, false); + }, 50); +}; +handlers.contextmenu = view => { + view.inputState.lastContextMenu = Date.now(); +}; +handlers.beforeinput = (view, event) => { + var _a; + // Because Chrome Android doesn't fire useful key events, use + // beforeinput to detect backspace (and possibly enter and delete, + // but those usually don't even seem to fire beforeinput events at + // the moment) and fake a key event for it. + // + // (preventDefault on beforeinput, though supported in the spec, + // seems to do nothing at all on Chrome). + let pending; + if (browser.chrome && browser.android && (pending = PendingKeys.find(key => key.inputType == event.inputType))) { + view.observer.delayAndroidKey(pending.key, pending.keyCode); + if (pending.key == "Backspace" || pending.key == "Delete") { + let startViewHeight = ((_a = window.visualViewport) === null || _a === void 0 ? void 0 : _a.height) || 0; + setTimeout(() => { + var _a; + // Backspacing near uneditable nodes on Chrome Android sometimes + // closes the virtual keyboard. This tries to crudely detect + // that and refocus to get it back. + if ((((_a = window.visualViewport) === null || _a === void 0 ? void 0 : _a.height) || 0) > startViewHeight + 10 && view.hasFocus) { + view.contentDOM.blur(); + view.focus(); + } + }, 100); + } + } +}; + +const wrappingWhiteSpace = ["pre-wrap", "normal", "pre-line", "break-spaces"]; +class HeightOracle { + constructor() { + this.doc = Text.empty; + this.lineWrapping = false; + this.heightSamples = {}; + this.lineHeight = 14; + this.charWidth = 7; + this.lineLength = 30; + // Used to track, during updateHeight, if any actual heights changed + this.heightChanged = false; + } + heightForGap(from, to) { + let lines = this.doc.lineAt(to).number - this.doc.lineAt(from).number + 1; + if (this.lineWrapping) + lines += Math.ceil(((to - from) - (lines * this.lineLength * 0.5)) / this.lineLength); + return this.lineHeight * lines; + } + heightForLine(length) { + if (!this.lineWrapping) + return this.lineHeight; + let lines = 1 + Math.max(0, Math.ceil((length - this.lineLength) / (this.lineLength - 5))); + return lines * this.lineHeight; + } + setDoc(doc) { this.doc = doc; return this; } + mustRefreshForWrapping(whiteSpace) { + return (wrappingWhiteSpace.indexOf(whiteSpace) > -1) != this.lineWrapping; + } + mustRefreshForHeights(lineHeights) { + let newHeight = false; + for (let i = 0; i < lineHeights.length; i++) { + let h = lineHeights[i]; + if (h < 0) { + i++; + } + else if (!this.heightSamples[Math.floor(h * 10)]) { // Round to .1 pixels + newHeight = true; + this.heightSamples[Math.floor(h * 10)] = true; + } + } + return newHeight; + } + refresh(whiteSpace, lineHeight, charWidth, lineLength, knownHeights) { + let lineWrapping = wrappingWhiteSpace.indexOf(whiteSpace) > -1; + let changed = Math.round(lineHeight) != Math.round(this.lineHeight) || this.lineWrapping != lineWrapping; + this.lineWrapping = lineWrapping; + this.lineHeight = lineHeight; + this.charWidth = charWidth; + this.lineLength = lineLength; + if (changed) { + this.heightSamples = {}; + for (let i = 0; i < knownHeights.length; i++) { + let h = knownHeights[i]; + if (h < 0) + i++; + else + this.heightSamples[Math.floor(h * 10)] = true; + } + } + return changed; + } +} +// This object is used by `updateHeight` to make DOM measurements +// arrive at the right nides. The `heights` array is a sequence of +// block heights, starting from position `from`. +class MeasuredHeights { + constructor(from, heights) { + this.from = from; + this.heights = heights; + this.index = 0; + } + get more() { return this.index < this.heights.length; } +} +/** +Record used to represent information about a block-level element +in the editor view. +*/ +class BlockInfo { + /** + @internal + */ + constructor( + /** + The start of the element in the document. + */ + from, + /** + The length of the element. + */ + length, + /** + The top position of the element (relative to the top of the + document). + */ + top, + /** + Its height. + */ + height, + /** + The type of element this is. When querying lines, this may be + an array of all the blocks that make up the line. + */ + type) { + this.from = from; + this.length = length; + this.top = top; + this.height = height; + this.type = type; + } + /** + The end of the element as a document position. + */ + get to() { return this.from + this.length; } + /** + The bottom position of the element. + */ + get bottom() { return this.top + this.height; } + /** + @internal + */ + join(other) { + let detail = (Array.isArray(this.type) ? this.type : [this]) + .concat(Array.isArray(other.type) ? other.type : [other]); + return new BlockInfo(this.from, this.length + other.length, this.top, this.height + other.height, detail); + } +} +var QueryType = /*@__PURE__*/(function (QueryType) { + QueryType[QueryType["ByPos"] = 0] = "ByPos"; + QueryType[QueryType["ByHeight"] = 1] = "ByHeight"; + QueryType[QueryType["ByPosNoHeight"] = 2] = "ByPosNoHeight"; +return QueryType})(QueryType || (QueryType = {})); +const Epsilon = 1e-3; +class HeightMap { + constructor(length, // The number of characters covered + height, // Height of this part of the document + flags = 2 /* Outdated */) { + this.length = length; + this.height = height; + this.flags = flags; + } + get outdated() { return (this.flags & 2 /* Outdated */) > 0; } + set outdated(value) { this.flags = (value ? 2 /* Outdated */ : 0) | (this.flags & ~2 /* Outdated */); } + setHeight(oracle, height) { + if (this.height != height) { + if (Math.abs(this.height - height) > Epsilon) + oracle.heightChanged = true; + this.height = height; + } + } + // Base case is to replace a leaf node, which simply builds a tree + // from the new nodes and returns that (HeightMapBranch and + // HeightMapGap override this to actually use from/to) + replace(_from, _to, nodes) { + return HeightMap.of(nodes); + } + // Again, these are base cases, and are overridden for branch and gap nodes. + decomposeLeft(_to, result) { result.push(this); } + decomposeRight(_from, result) { result.push(this); } + applyChanges(decorations, oldDoc, oracle, changes) { + let me = this; + for (let i = changes.length - 1; i >= 0; i--) { + let { fromA, toA, fromB, toB } = changes[i]; + let start = me.lineAt(fromA, QueryType.ByPosNoHeight, oldDoc, 0, 0); + let end = start.to >= toA ? start : me.lineAt(toA, QueryType.ByPosNoHeight, oldDoc, 0, 0); + toB += end.to - toA; + toA = end.to; + while (i > 0 && start.from <= changes[i - 1].toA) { + fromA = changes[i - 1].fromA; + fromB = changes[i - 1].fromB; + i--; + if (fromA < start.from) + start = me.lineAt(fromA, QueryType.ByPosNoHeight, oldDoc, 0, 0); + } + fromB += start.from - fromA; + fromA = start.from; + let nodes = NodeBuilder.build(oracle, decorations, fromB, toB); + me = me.replace(fromA, toA, nodes); + } + return me.updateHeight(oracle, 0); + } + static empty() { return new HeightMapText(0, 0); } + // nodes uses null values to indicate the position of line breaks. + // There are never line breaks at the start or end of the array, or + // two line breaks next to each other, and the array isn't allowed + // to be empty (same restrictions as return value from the builder). + static of(nodes) { + if (nodes.length == 1) + return nodes[0]; + let i = 0, j = nodes.length, before = 0, after = 0; + for (;;) { + if (i == j) { + if (before > after * 2) { + let split = nodes[i - 1]; + if (split.break) + nodes.splice(--i, 1, split.left, null, split.right); + else + nodes.splice(--i, 1, split.left, split.right); + j += 1 + split.break; + before -= split.size; + } + else if (after > before * 2) { + let split = nodes[j]; + if (split.break) + nodes.splice(j, 1, split.left, null, split.right); + else + nodes.splice(j, 1, split.left, split.right); + j += 2 + split.break; + after -= split.size; + } + else { + break; + } + } + else if (before < after) { + let next = nodes[i++]; + if (next) + before += next.size; + } + else { + let next = nodes[--j]; + if (next) + after += next.size; + } + } + let brk = 0; + if (nodes[i - 1] == null) { + brk = 1; + i--; + } + else if (nodes[i] == null) { + brk = 1; + j++; + } + return new HeightMapBranch(HeightMap.of(nodes.slice(0, i)), brk, HeightMap.of(nodes.slice(j))); + } +} +HeightMap.prototype.size = 1; +class HeightMapBlock extends HeightMap { + constructor(length, height, type) { + super(length, height); + this.type = type; + } + blockAt(_height, _doc, top, offset) { + return new BlockInfo(offset, this.length, top, this.height, this.type); + } + lineAt(_value, _type, doc, top, offset) { + return this.blockAt(0, doc, top, offset); + } + forEachLine(from, to, doc, top, offset, f) { + if (from <= offset + this.length && to >= offset) + f(this.blockAt(0, doc, top, offset)); + } + updateHeight(oracle, offset = 0, _force = false, measured) { + if (measured && measured.from <= offset && measured.more) + this.setHeight(oracle, measured.heights[measured.index++]); + this.outdated = false; + return this; + } + toString() { return `block(${this.length})`; } +} +class HeightMapText extends HeightMapBlock { + constructor(length, height) { + super(length, height, BlockType.Text); + this.collapsed = 0; // Amount of collapsed content in the line + this.widgetHeight = 0; // Maximum inline widget height + } + replace(_from, _to, nodes) { + let node = nodes[0]; + if (nodes.length == 1 && (node instanceof HeightMapText || node instanceof HeightMapGap && (node.flags & 4 /* SingleLine */)) && + Math.abs(this.length - node.length) < 10) { + if (node instanceof HeightMapGap) + node = new HeightMapText(node.length, this.height); + else + node.height = this.height; + if (!this.outdated) + node.outdated = false; + return node; + } + else { + return HeightMap.of(nodes); + } + } + updateHeight(oracle, offset = 0, force = false, measured) { + if (measured && measured.from <= offset && measured.more) + this.setHeight(oracle, measured.heights[measured.index++]); + else if (force || this.outdated) + this.setHeight(oracle, Math.max(this.widgetHeight, oracle.heightForLine(this.length - this.collapsed))); + this.outdated = false; + return this; + } + toString() { + return `line(${this.length}${this.collapsed ? -this.collapsed : ""}${this.widgetHeight ? ":" + this.widgetHeight : ""})`; + } +} +class HeightMapGap extends HeightMap { + constructor(length) { super(length, 0); } + lines(doc, offset) { + let firstLine = doc.lineAt(offset).number, lastLine = doc.lineAt(offset + this.length).number; + return { firstLine, lastLine, lineHeight: this.height / (lastLine - firstLine + 1) }; + } + blockAt(height, doc, top, offset) { + let { firstLine, lastLine, lineHeight } = this.lines(doc, offset); + let line = Math.max(0, Math.min(lastLine - firstLine, Math.floor((height - top) / lineHeight))); + let { from, length } = doc.line(firstLine + line); + return new BlockInfo(from, length, top + lineHeight * line, lineHeight, BlockType.Text); + } + lineAt(value, type, doc, top, offset) { + if (type == QueryType.ByHeight) + return this.blockAt(value, doc, top, offset); + if (type == QueryType.ByPosNoHeight) { + let { from, to } = doc.lineAt(value); + return new BlockInfo(from, to - from, 0, 0, BlockType.Text); + } + let { firstLine, lineHeight } = this.lines(doc, offset); + let { from, length, number } = doc.lineAt(value); + return new BlockInfo(from, length, top + lineHeight * (number - firstLine), lineHeight, BlockType.Text); + } + forEachLine(from, to, doc, top, offset, f) { + let { firstLine, lineHeight } = this.lines(doc, offset); + for (let pos = Math.max(from, offset), end = Math.min(offset + this.length, to); pos <= end;) { + let line = doc.lineAt(pos); + if (pos == from) + top += lineHeight * (line.number - firstLine); + f(new BlockInfo(line.from, line.length, top, lineHeight, BlockType.Text)); + top += lineHeight; + pos = line.to + 1; + } + } + replace(from, to, nodes) { + let after = this.length - to; + if (after > 0) { + let last = nodes[nodes.length - 1]; + if (last instanceof HeightMapGap) + nodes[nodes.length - 1] = new HeightMapGap(last.length + after); + else + nodes.push(null, new HeightMapGap(after - 1)); + } + if (from > 0) { + let first = nodes[0]; + if (first instanceof HeightMapGap) + nodes[0] = new HeightMapGap(from + first.length); + else + nodes.unshift(new HeightMapGap(from - 1), null); + } + return HeightMap.of(nodes); + } + decomposeLeft(to, result) { + result.push(new HeightMapGap(to - 1), null); + } + decomposeRight(from, result) { + result.push(null, new HeightMapGap(this.length - from - 1)); + } + updateHeight(oracle, offset = 0, force = false, measured) { + let end = offset + this.length; + if (measured && measured.from <= offset + this.length && measured.more) { + // Fill in part of this gap with measured lines. We know there + // can't be widgets or collapsed ranges in those lines, because + // they would already have been added to the heightmap (gaps + // only contain plain text). + let nodes = [], pos = Math.max(offset, measured.from), singleHeight = -1; + let wasChanged = oracle.heightChanged; + if (measured.from > offset) + nodes.push(new HeightMapGap(measured.from - offset - 1).updateHeight(oracle, offset)); + while (pos <= end && measured.more) { + let len = oracle.doc.lineAt(pos).length; + if (nodes.length) + nodes.push(null); + let height = measured.heights[measured.index++]; + if (singleHeight == -1) + singleHeight = height; + else if (Math.abs(height - singleHeight) >= Epsilon) + singleHeight = -2; + let line = new HeightMapText(len, height); + line.outdated = false; + nodes.push(line); + pos += len + 1; + } + if (pos <= end) + nodes.push(null, new HeightMapGap(end - pos).updateHeight(oracle, pos)); + let result = HeightMap.of(nodes); + oracle.heightChanged = wasChanged || singleHeight < 0 || Math.abs(result.height - this.height) >= Epsilon || + Math.abs(singleHeight - this.lines(oracle.doc, offset).lineHeight) >= Epsilon; + return result; + } + else if (force || this.outdated) { + this.setHeight(oracle, oracle.heightForGap(offset, offset + this.length)); + this.outdated = false; + } + return this; + } + toString() { return `gap(${this.length})`; } +} +class HeightMapBranch extends HeightMap { + constructor(left, brk, right) { + super(left.length + brk + right.length, left.height + right.height, brk | (left.outdated || right.outdated ? 2 /* Outdated */ : 0)); + this.left = left; + this.right = right; + this.size = left.size + right.size; + } + get break() { return this.flags & 1 /* Break */; } + blockAt(height, doc, top, offset) { + let mid = top + this.left.height; + return height < mid ? this.left.blockAt(height, doc, top, offset) + : this.right.blockAt(height, doc, mid, offset + this.left.length + this.break); + } + lineAt(value, type, doc, top, offset) { + let rightTop = top + this.left.height, rightOffset = offset + this.left.length + this.break; + let left = type == QueryType.ByHeight ? value < rightTop : value < rightOffset; + let base = left ? this.left.lineAt(value, type, doc, top, offset) + : this.right.lineAt(value, type, doc, rightTop, rightOffset); + if (this.break || (left ? base.to < rightOffset : base.from > rightOffset)) + return base; + let subQuery = type == QueryType.ByPosNoHeight ? QueryType.ByPosNoHeight : QueryType.ByPos; + if (left) + return base.join(this.right.lineAt(rightOffset, subQuery, doc, rightTop, rightOffset)); + else + return this.left.lineAt(rightOffset, subQuery, doc, top, offset).join(base); + } + forEachLine(from, to, doc, top, offset, f) { + let rightTop = top + this.left.height, rightOffset = offset + this.left.length + this.break; + if (this.break) { + if (from < rightOffset) + this.left.forEachLine(from, to, doc, top, offset, f); + if (to >= rightOffset) + this.right.forEachLine(from, to, doc, rightTop, rightOffset, f); + } + else { + let mid = this.lineAt(rightOffset, QueryType.ByPos, doc, top, offset); + if (from < mid.from) + this.left.forEachLine(from, mid.from - 1, doc, top, offset, f); + if (mid.to >= from && mid.from <= to) + f(mid); + if (to > mid.to) + this.right.forEachLine(mid.to + 1, to, doc, rightTop, rightOffset, f); + } + } + replace(from, to, nodes) { + let rightStart = this.left.length + this.break; + if (to < rightStart) + return this.balanced(this.left.replace(from, to, nodes), this.right); + if (from > this.left.length) + return this.balanced(this.left, this.right.replace(from - rightStart, to - rightStart, nodes)); + let result = []; + if (from > 0) + this.decomposeLeft(from, result); + let left = result.length; + for (let node of nodes) + result.push(node); + if (from > 0) + mergeGaps(result, left - 1); + if (to < this.length) { + let right = result.length; + this.decomposeRight(to, result); + mergeGaps(result, right); + } + return HeightMap.of(result); + } + decomposeLeft(to, result) { + let left = this.left.length; + if (to <= left) + return this.left.decomposeLeft(to, result); + result.push(this.left); + if (this.break) { + left++; + if (to >= left) + result.push(null); + } + if (to > left) + this.right.decomposeLeft(to - left, result); + } + decomposeRight(from, result) { + let left = this.left.length, right = left + this.break; + if (from >= right) + return this.right.decomposeRight(from - right, result); + if (from < left) + this.left.decomposeRight(from, result); + if (this.break && from < right) + result.push(null); + result.push(this.right); + } + balanced(left, right) { + if (left.size > 2 * right.size || right.size > 2 * left.size) + return HeightMap.of(this.break ? [left, null, right] : [left, right]); + this.left = left; + this.right = right; + this.height = left.height + right.height; + this.outdated = left.outdated || right.outdated; + this.size = left.size + right.size; + this.length = left.length + this.break + right.length; + return this; + } + updateHeight(oracle, offset = 0, force = false, measured) { + let { left, right } = this, rightStart = offset + left.length + this.break, rebalance = null; + if (measured && measured.from <= offset + left.length && measured.more) + rebalance = left = left.updateHeight(oracle, offset, force, measured); + else + left.updateHeight(oracle, offset, force); + if (measured && measured.from <= rightStart + right.length && measured.more) + rebalance = right = right.updateHeight(oracle, rightStart, force, measured); + else + right.updateHeight(oracle, rightStart, force); + if (rebalance) + return this.balanced(left, right); + this.height = this.left.height + this.right.height; + this.outdated = false; + return this; + } + toString() { return this.left + (this.break ? " " : "-") + this.right; } +} +function mergeGaps(nodes, around) { + let before, after; + if (nodes[around] == null && + (before = nodes[around - 1]) instanceof HeightMapGap && + (after = nodes[around + 1]) instanceof HeightMapGap) + nodes.splice(around - 1, 3, new HeightMapGap(before.length + 1 + after.length)); +} +const relevantWidgetHeight = 5; +class NodeBuilder { + constructor(pos, oracle) { + this.pos = pos; + this.oracle = oracle; + this.nodes = []; + this.lineStart = -1; + this.lineEnd = -1; + this.covering = null; + this.writtenTo = pos; + } + get isCovered() { + return this.covering && this.nodes[this.nodes.length - 1] == this.covering; + } + span(_from, to) { + if (this.lineStart > -1) { + let end = Math.min(to, this.lineEnd), last = this.nodes[this.nodes.length - 1]; + if (last instanceof HeightMapText) + last.length += end - this.pos; + else if (end > this.pos || !this.isCovered) + this.nodes.push(new HeightMapText(end - this.pos, -1)); + this.writtenTo = end; + if (to > end) { + this.nodes.push(null); + this.writtenTo++; + this.lineStart = -1; + } + } + this.pos = to; + } + point(from, to, deco) { + if (from < to || deco.heightRelevant) { + let height = deco.widget ? deco.widget.estimatedHeight : 0; + if (height < 0) + height = this.oracle.lineHeight; + let len = to - from; + if (deco.block) { + this.addBlock(new HeightMapBlock(len, height, deco.type)); + } + else if (len || height >= relevantWidgetHeight) { + this.addLineDeco(height, len); + } + } + else if (to > from) { + this.span(from, to); + } + if (this.lineEnd > -1 && this.lineEnd < this.pos) + this.lineEnd = this.oracle.doc.lineAt(this.pos).to; + } + enterLine() { + if (this.lineStart > -1) + return; + let { from, to } = this.oracle.doc.lineAt(this.pos); + this.lineStart = from; + this.lineEnd = to; + if (this.writtenTo < from) { + if (this.writtenTo < from - 1 || this.nodes[this.nodes.length - 1] == null) + this.nodes.push(this.blankContent(this.writtenTo, from - 1)); + this.nodes.push(null); + } + if (this.pos > from) + this.nodes.push(new HeightMapText(this.pos - from, -1)); + this.writtenTo = this.pos; + } + blankContent(from, to) { + let gap = new HeightMapGap(to - from); + if (this.oracle.doc.lineAt(from).to == to) + gap.flags |= 4 /* SingleLine */; + return gap; + } + ensureLine() { + this.enterLine(); + let last = this.nodes.length ? this.nodes[this.nodes.length - 1] : null; + if (last instanceof HeightMapText) + return last; + let line = new HeightMapText(0, -1); + this.nodes.push(line); + return line; + } + addBlock(block) { + this.enterLine(); + if (block.type == BlockType.WidgetAfter && !this.isCovered) + this.ensureLine(); + this.nodes.push(block); + this.writtenTo = this.pos = this.pos + block.length; + if (block.type != BlockType.WidgetBefore) + this.covering = block; + } + addLineDeco(height, length) { + let line = this.ensureLine(); + line.length += length; + line.collapsed += length; + line.widgetHeight = Math.max(line.widgetHeight, height); + this.writtenTo = this.pos = this.pos + length; + } + finish(from) { + let last = this.nodes.length == 0 ? null : this.nodes[this.nodes.length - 1]; + if (this.lineStart > -1 && !(last instanceof HeightMapText) && !this.isCovered) + this.nodes.push(new HeightMapText(0, -1)); + else if (this.writtenTo < this.pos || last == null) + this.nodes.push(this.blankContent(this.writtenTo, this.pos)); + let pos = from; + for (let node of this.nodes) { + if (node instanceof HeightMapText) + node.updateHeight(this.oracle, pos); + pos += node ? node.length : 1; + } + return this.nodes; + } + // Always called with a region that on both sides either stretches + // to a line break or the end of the document. + // The returned array uses null to indicate line breaks, but never + // starts or ends in a line break, or has multiple line breaks next + // to each other. + static build(oracle, decorations, from, to) { + let builder = new NodeBuilder(from, oracle); + RangeSet.spans(decorations, from, to, builder, 0); + return builder.finish(from); + } +} +function heightRelevantDecoChanges(a, b, diff) { + let comp = new DecorationComparator; + RangeSet.compare(a, b, diff, comp, 0); + return comp.changes; +} +class DecorationComparator { + constructor() { + this.changes = []; + } + compareRange() { } + comparePoint(from, to, a, b) { + if (from < to || a && a.heightRelevant || b && b.heightRelevant) + addRange(from, to, this.changes, 5); + } +} + +function visiblePixelRange(dom, paddingTop) { + let rect = dom.getBoundingClientRect(); + let left = Math.max(0, rect.left), right = Math.min(innerWidth, rect.right); + let top = Math.max(0, rect.top), bottom = Math.min(innerHeight, rect.bottom); + let body = dom.ownerDocument.body; + for (let parent = dom.parentNode; parent && parent != body;) { + if (parent.nodeType == 1) { + let elt = parent; + let style = window.getComputedStyle(elt); + if ((elt.scrollHeight > elt.clientHeight || elt.scrollWidth > elt.clientWidth) && + style.overflow != "visible") { + let parentRect = elt.getBoundingClientRect(); + left = Math.max(left, parentRect.left); + right = Math.min(right, parentRect.right); + top = Math.max(top, parentRect.top); + bottom = Math.min(bottom, parentRect.bottom); + } + parent = style.position == "absolute" || style.position == "fixed" ? elt.offsetParent : elt.parentNode; + } + else if (parent.nodeType == 11) { // Shadow root + parent = parent.host; + } + else { + break; + } + } + return { left: left - rect.left, right: Math.max(left, right) - rect.left, + top: top - (rect.top + paddingTop), bottom: Math.max(top, bottom) - (rect.top + paddingTop) }; +} +function fullPixelRange(dom, paddingTop) { + let rect = dom.getBoundingClientRect(); + return { left: 0, right: rect.right - rect.left, + top: paddingTop, bottom: rect.bottom - (rect.top + paddingTop) }; +} +// Line gaps are placeholder widgets used to hide pieces of overlong +// lines within the viewport, as a kludge to keep the editor +// responsive when a ridiculously long line is loaded into it. +class LineGap { + constructor(from, to, size) { + this.from = from; + this.to = to; + this.size = size; + } + static same(a, b) { + if (a.length != b.length) + return false; + for (let i = 0; i < a.length; i++) { + let gA = a[i], gB = b[i]; + if (gA.from != gB.from || gA.to != gB.to || gA.size != gB.size) + return false; + } + return true; + } + draw(wrapping) { + return Decoration.replace({ widget: new LineGapWidget(this.size, wrapping) }).range(this.from, this.to); + } +} +class LineGapWidget extends WidgetType { + constructor(size, vertical) { + super(); + this.size = size; + this.vertical = vertical; + } + eq(other) { return other.size == this.size && other.vertical == this.vertical; } + toDOM() { + let elt = document.createElement("div"); + if (this.vertical) { + elt.style.height = this.size + "px"; + } + else { + elt.style.width = this.size + "px"; + elt.style.height = "2px"; + elt.style.display = "inline-block"; + } + return elt; + } + get estimatedHeight() { return this.vertical ? this.size : -1; } +} +class ViewState { + constructor(state) { + this.state = state; + // These are contentDOM-local coordinates + this.pixelViewport = { left: 0, right: window.innerWidth, top: 0, bottom: 0 }; + this.inView = true; + this.paddingTop = 0; + this.paddingBottom = 0; + this.contentDOMWidth = 0; + this.contentDOMHeight = 0; + this.editorHeight = 0; + this.editorWidth = 0; + this.heightOracle = new HeightOracle; + // See VP.MaxDOMHeight + this.scaler = IdScaler; + this.scrollTarget = null; + // Briefly set to true when printing, to disable viewport limiting + this.printing = false; + // Flag set when editor content was redrawn, so that the next + // measure stage knows it must read DOM layout + this.mustMeasureContent = true; + this.defaultTextDirection = Direction.RTL; + this.visibleRanges = []; + // Cursor 'assoc' is only significant when the cursor is on a line + // wrap point, where it must stick to the character that it is + // associated with. Since browsers don't provide a reasonable + // interface to set or query this, when a selection is set that + // might cause this to be significant, this flag is set. The next + // measure phase will check whether the cursor is on a line-wrapping + // boundary and, if so, reset it to make sure it is positioned in + // the right place. + this.mustEnforceCursorAssoc = false; + this.stateDeco = state.facet(decorations).filter(d => typeof d != "function"); + this.heightMap = HeightMap.empty().applyChanges(this.stateDeco, Text.empty, this.heightOracle.setDoc(state.doc), [new ChangedRange(0, 0, 0, state.doc.length)]); + this.viewport = this.getViewport(0, null); + this.updateViewportLines(); + this.updateForViewport(); + this.lineGaps = this.ensureLineGaps([]); + this.lineGapDeco = Decoration.set(this.lineGaps.map(gap => gap.draw(false))); + this.computeVisibleRanges(); + } + updateForViewport() { + let viewports = [this.viewport], { main } = this.state.selection; + for (let i = 0; i <= 1; i++) { + let pos = i ? main.head : main.anchor; + if (!viewports.some(({ from, to }) => pos >= from && pos <= to)) { + let { from, to } = this.lineBlockAt(pos); + viewports.push(new Viewport(from, to)); + } + } + this.viewports = viewports.sort((a, b) => a.from - b.from); + this.scaler = this.heightMap.height <= 7000000 /* MaxDOMHeight */ ? IdScaler : + new BigScaler(this.heightOracle.doc, this.heightMap, this.viewports); + } + updateViewportLines() { + this.viewportLines = []; + this.heightMap.forEachLine(this.viewport.from, this.viewport.to, this.state.doc, 0, 0, block => { + this.viewportLines.push(this.scaler.scale == 1 ? block : scaleBlock(block, this.scaler)); + }); + } + update(update, scrollTarget = null) { + this.state = update.state; + let prevDeco = this.stateDeco; + this.stateDeco = this.state.facet(decorations).filter(d => typeof d != "function"); + let contentChanges = update.changedRanges; + let heightChanges = ChangedRange.extendWithRanges(contentChanges, heightRelevantDecoChanges(prevDeco, this.stateDeco, update ? update.changes : ChangeSet.empty(this.state.doc.length))); + let prevHeight = this.heightMap.height; + this.heightMap = this.heightMap.applyChanges(this.stateDeco, update.startState.doc, this.heightOracle.setDoc(this.state.doc), heightChanges); + if (this.heightMap.height != prevHeight) + update.flags |= 2 /* Height */; + let viewport = heightChanges.length ? this.mapViewport(this.viewport, update.changes) : this.viewport; + if (scrollTarget && (scrollTarget.range.head < viewport.from || scrollTarget.range.head > viewport.to) || + !this.viewportIsAppropriate(viewport)) + viewport = this.getViewport(0, scrollTarget); + let updateLines = !update.changes.empty || (update.flags & 2 /* Height */) || + viewport.from != this.viewport.from || viewport.to != this.viewport.to; + this.viewport = viewport; + this.updateForViewport(); + if (updateLines) + this.updateViewportLines(); + if (this.lineGaps.length || this.viewport.to - this.viewport.from > 4000 /* DoubleMargin */) + this.updateLineGaps(this.ensureLineGaps(this.mapLineGaps(this.lineGaps, update.changes))); + update.flags |= this.computeVisibleRanges(); + if (scrollTarget) + this.scrollTarget = scrollTarget; + if (!this.mustEnforceCursorAssoc && update.selectionSet && update.view.lineWrapping && + update.state.selection.main.empty && update.state.selection.main.assoc) + this.mustEnforceCursorAssoc = true; + } + measure(view) { + let dom = view.contentDOM, style = window.getComputedStyle(dom); + let oracle = this.heightOracle; + let whiteSpace = style.whiteSpace; + this.defaultTextDirection = style.direction == "rtl" ? Direction.RTL : Direction.LTR; + let refresh = this.heightOracle.mustRefreshForWrapping(whiteSpace); + let measureContent = refresh || this.mustMeasureContent || this.contentDOMHeight != dom.clientHeight; + this.contentDOMHeight = dom.clientHeight; + this.mustMeasureContent = false; + let result = 0, bias = 0; + // Vertical padding + let paddingTop = parseInt(style.paddingTop) || 0, paddingBottom = parseInt(style.paddingBottom) || 0; + if (this.paddingTop != paddingTop || this.paddingBottom != paddingBottom) { + this.paddingTop = paddingTop; + this.paddingBottom = paddingBottom; + result |= 8 /* Geometry */ | 2 /* Height */; + } + if (this.editorWidth != view.scrollDOM.clientWidth) { + if (oracle.lineWrapping) + measureContent = true; + this.editorWidth = view.scrollDOM.clientWidth; + result |= 8 /* Geometry */; + } + // Pixel viewport + let pixelViewport = (this.printing ? fullPixelRange : visiblePixelRange)(dom, this.paddingTop); + let dTop = pixelViewport.top - this.pixelViewport.top, dBottom = pixelViewport.bottom - this.pixelViewport.bottom; + this.pixelViewport = pixelViewport; + let inView = this.pixelViewport.bottom > this.pixelViewport.top && this.pixelViewport.right > this.pixelViewport.left; + if (inView != this.inView) { + this.inView = inView; + if (inView) + measureContent = true; + } + if (!this.inView) + return 0; + let contentWidth = dom.clientWidth; + if (this.contentDOMWidth != contentWidth || this.editorHeight != view.scrollDOM.clientHeight) { + this.contentDOMWidth = contentWidth; + this.editorHeight = view.scrollDOM.clientHeight; + result |= 8 /* Geometry */; + } + if (measureContent) { + let lineHeights = view.docView.measureVisibleLineHeights(this.viewport); + if (oracle.mustRefreshForHeights(lineHeights)) + refresh = true; + if (refresh || oracle.lineWrapping && Math.abs(contentWidth - this.contentDOMWidth) > oracle.charWidth) { + let { lineHeight, charWidth } = view.docView.measureTextSize(); + refresh = oracle.refresh(whiteSpace, lineHeight, charWidth, contentWidth / charWidth, lineHeights); + if (refresh) { + view.docView.minWidth = 0; + result |= 8 /* Geometry */; + } + } + if (dTop > 0 && dBottom > 0) + bias = Math.max(dTop, dBottom); + else if (dTop < 0 && dBottom < 0) + bias = Math.min(dTop, dBottom); + oracle.heightChanged = false; + for (let vp of this.viewports) { + let heights = vp.from == this.viewport.from ? lineHeights : view.docView.measureVisibleLineHeights(vp); + this.heightMap = this.heightMap.updateHeight(oracle, 0, refresh, new MeasuredHeights(vp.from, heights)); + } + if (oracle.heightChanged) + result |= 2 /* Height */; + } + let viewportChange = !this.viewportIsAppropriate(this.viewport, bias) || + this.scrollTarget && (this.scrollTarget.range.head < this.viewport.from || this.scrollTarget.range.head > this.viewport.to); + if (viewportChange) + this.viewport = this.getViewport(bias, this.scrollTarget); + this.updateForViewport(); + if ((result & 2 /* Height */) || viewportChange) + this.updateViewportLines(); + if (this.lineGaps.length || this.viewport.to - this.viewport.from > 4000 /* DoubleMargin */) + this.updateLineGaps(this.ensureLineGaps(refresh ? [] : this.lineGaps)); + result |= this.computeVisibleRanges(); + if (this.mustEnforceCursorAssoc) { + this.mustEnforceCursorAssoc = false; + // This is done in the read stage, because moving the selection + // to a line end is going to trigger a layout anyway, so it + // can't be a pure write. It should be rare that it does any + // writing. + view.docView.enforceCursorAssoc(); + } + return result; + } + get visibleTop() { return this.scaler.fromDOM(this.pixelViewport.top); } + get visibleBottom() { return this.scaler.fromDOM(this.pixelViewport.bottom); } + getViewport(bias, scrollTarget) { + // This will divide VP.Margin between the top and the + // bottom, depending on the bias (the change in viewport position + // since the last update). It'll hold a number between 0 and 1 + let marginTop = 0.5 - Math.max(-0.5, Math.min(0.5, bias / 1000 /* Margin */ / 2)); + let map = this.heightMap, doc = this.state.doc, { visibleTop, visibleBottom } = this; + let viewport = new Viewport(map.lineAt(visibleTop - marginTop * 1000 /* Margin */, QueryType.ByHeight, doc, 0, 0).from, map.lineAt(visibleBottom + (1 - marginTop) * 1000 /* Margin */, QueryType.ByHeight, doc, 0, 0).to); + // If scrollTarget is given, make sure the viewport includes that position + if (scrollTarget) { + let { head } = scrollTarget.range; + if (head < viewport.from || head > viewport.to) { + let viewHeight = Math.min(this.editorHeight, this.pixelViewport.bottom - this.pixelViewport.top); + let block = map.lineAt(head, QueryType.ByPos, doc, 0, 0), topPos; + if (scrollTarget.y == "center") + topPos = (block.top + block.bottom) / 2 - viewHeight / 2; + else if (scrollTarget.y == "start" || scrollTarget.y == "nearest" && head < viewport.from) + topPos = block.top; + else + topPos = block.bottom - viewHeight; + viewport = new Viewport(map.lineAt(topPos - 1000 /* Margin */ / 2, QueryType.ByHeight, doc, 0, 0).from, map.lineAt(topPos + viewHeight + 1000 /* Margin */ / 2, QueryType.ByHeight, doc, 0, 0).to); + } + } + return viewport; + } + mapViewport(viewport, changes) { + let from = changes.mapPos(viewport.from, -1), to = changes.mapPos(viewport.to, 1); + return new Viewport(this.heightMap.lineAt(from, QueryType.ByPos, this.state.doc, 0, 0).from, this.heightMap.lineAt(to, QueryType.ByPos, this.state.doc, 0, 0).to); + } + // Checks if a given viewport covers the visible part of the + // document and not too much beyond that. + viewportIsAppropriate({ from, to }, bias = 0) { + if (!this.inView) + return true; + let { top } = this.heightMap.lineAt(from, QueryType.ByPos, this.state.doc, 0, 0); + let { bottom } = this.heightMap.lineAt(to, QueryType.ByPos, this.state.doc, 0, 0); + let { visibleTop, visibleBottom } = this; + return (from == 0 || top <= visibleTop - Math.max(10 /* MinCoverMargin */, Math.min(-bias, 250 /* MaxCoverMargin */))) && + (to == this.state.doc.length || + bottom >= visibleBottom + Math.max(10 /* MinCoverMargin */, Math.min(bias, 250 /* MaxCoverMargin */))) && + (top > visibleTop - 2 * 1000 /* Margin */ && bottom < visibleBottom + 2 * 1000 /* Margin */); + } + mapLineGaps(gaps, changes) { + if (!gaps.length || changes.empty) + return gaps; + let mapped = []; + for (let gap of gaps) + if (!changes.touchesRange(gap.from, gap.to)) + mapped.push(new LineGap(changes.mapPos(gap.from), changes.mapPos(gap.to), gap.size)); + return mapped; + } + // Computes positions in the viewport where the start or end of a + // line should be hidden, trying to reuse existing line gaps when + // appropriate to avoid unneccesary redraws. + // Uses crude character-counting for the positioning and sizing, + // since actual DOM coordinates aren't always available and + // predictable. Relies on generous margins (see LG.Margin) to hide + // the artifacts this might produce from the user. + ensureLineGaps(current) { + let gaps = []; + // This won't work at all in predominantly right-to-left text. + if (this.defaultTextDirection != Direction.LTR) + return gaps; + for (let line of this.viewportLines) { + if (line.length < 4000 /* DoubleMargin */) + continue; + let structure = lineStructure(line.from, line.to, this.stateDeco); + if (structure.total < 4000 /* DoubleMargin */) + continue; + let viewFrom, viewTo; + if (this.heightOracle.lineWrapping) { + let marginHeight = (2000 /* Margin */ / this.heightOracle.lineLength) * this.heightOracle.lineHeight; + viewFrom = findPosition(structure, (this.visibleTop - line.top - marginHeight) / line.height); + viewTo = findPosition(structure, (this.visibleBottom - line.top + marginHeight) / line.height); + } + else { + let totalWidth = structure.total * this.heightOracle.charWidth; + let marginWidth = 2000 /* Margin */ * this.heightOracle.charWidth; + viewFrom = findPosition(structure, (this.pixelViewport.left - marginWidth) / totalWidth); + viewTo = findPosition(structure, (this.pixelViewport.right + marginWidth) / totalWidth); + } + let outside = []; + if (viewFrom > line.from) + outside.push({ from: line.from, to: viewFrom }); + if (viewTo < line.to) + outside.push({ from: viewTo, to: line.to }); + let sel = this.state.selection.main; + // Make sure the gaps don't cover a selection end + if (sel.from >= line.from && sel.from <= line.to) + cutRange(outside, sel.from - 10 /* SelectionMargin */, sel.from + 10 /* SelectionMargin */); + if (!sel.empty && sel.to >= line.from && sel.to <= line.to) + cutRange(outside, sel.to - 10 /* SelectionMargin */, sel.to + 10 /* SelectionMargin */); + for (let { from, to } of outside) + if (to - from > 1000 /* HalfMargin */) { + gaps.push(find(current, gap => gap.from >= line.from && gap.to <= line.to && + Math.abs(gap.from - from) < 1000 /* HalfMargin */ && Math.abs(gap.to - to) < 1000 /* HalfMargin */) || + new LineGap(from, to, this.gapSize(line, from, to, structure))); + } + } + return gaps; + } + gapSize(line, from, to, structure) { + let fraction = findFraction(structure, to) - findFraction(structure, from); + if (this.heightOracle.lineWrapping) { + return line.height * fraction; + } + else { + return structure.total * this.heightOracle.charWidth * fraction; + } + } + updateLineGaps(gaps) { + if (!LineGap.same(gaps, this.lineGaps)) { + this.lineGaps = gaps; + this.lineGapDeco = Decoration.set(gaps.map(gap => gap.draw(this.heightOracle.lineWrapping))); + } + } + computeVisibleRanges() { + let deco = this.stateDeco; + if (this.lineGaps.length) + deco = deco.concat(this.lineGapDeco); + let ranges = []; + RangeSet.spans(deco, this.viewport.from, this.viewport.to, { + span(from, to) { ranges.push({ from, to }); }, + point() { } + }, 20); + let changed = ranges.length != this.visibleRanges.length || + this.visibleRanges.some((r, i) => r.from != ranges[i].from || r.to != ranges[i].to); + this.visibleRanges = ranges; + return changed ? 4 /* Viewport */ : 0; + } + lineBlockAt(pos) { + return (pos >= this.viewport.from && pos <= this.viewport.to && this.viewportLines.find(b => b.from <= pos && b.to >= pos)) || + scaleBlock(this.heightMap.lineAt(pos, QueryType.ByPos, this.state.doc, 0, 0), this.scaler); + } + lineBlockAtHeight(height) { + return scaleBlock(this.heightMap.lineAt(this.scaler.fromDOM(height), QueryType.ByHeight, this.state.doc, 0, 0), this.scaler); + } + elementAtHeight(height) { + return scaleBlock(this.heightMap.blockAt(this.scaler.fromDOM(height), this.state.doc, 0, 0), this.scaler); + } + get docHeight() { + return this.scaler.toDOM(this.heightMap.height); + } + get contentHeight() { + return this.docHeight + this.paddingTop + this.paddingBottom; + } +} +class Viewport { + constructor(from, to) { + this.from = from; + this.to = to; + } +} +function lineStructure(from, to, stateDeco) { + let ranges = [], pos = from, total = 0; + RangeSet.spans(stateDeco, from, to, { + span() { }, + point(from, to) { + if (from > pos) { + ranges.push({ from: pos, to: from }); + total += from - pos; + } + pos = to; + } + }, 20); // We're only interested in collapsed ranges of a significant size + if (pos < to) { + ranges.push({ from: pos, to }); + total += to - pos; + } + return { total, ranges }; +} +function findPosition({ total, ranges }, ratio) { + if (ratio <= 0) + return ranges[0].from; + if (ratio >= 1) + return ranges[ranges.length - 1].to; + let dist = Math.floor(total * ratio); + for (let i = 0;; i++) { + let { from, to } = ranges[i], size = to - from; + if (dist <= size) + return from + dist; + dist -= size; + } +} +function findFraction(structure, pos) { + let counted = 0; + for (let { from, to } of structure.ranges) { + if (pos <= to) { + counted += pos - from; + break; + } + counted += to - from; + } + return counted / structure.total; +} +function cutRange(ranges, from, to) { + for (let i = 0; i < ranges.length; i++) { + let r = ranges[i]; + if (r.from < to && r.to > from) { + let pieces = []; + if (r.from < from) + pieces.push({ from: r.from, to: from }); + if (r.to > to) + pieces.push({ from: to, to: r.to }); + ranges.splice(i, 1, ...pieces); + i += pieces.length - 1; + } + } +} +function find(array, f) { + for (let val of array) + if (f(val)) + return val; + return undefined; +} +// Don't scale when the document height is within the range of what +// the DOM can handle. +const IdScaler = { + toDOM(n) { return n; }, + fromDOM(n) { return n; }, + scale: 1 +}; +// When the height is too big (> VP.MaxDOMHeight), scale down the +// regions outside the viewports so that the total height is +// VP.MaxDOMHeight. +class BigScaler { + constructor(doc, heightMap, viewports) { + let vpHeight = 0, base = 0, domBase = 0; + this.viewports = viewports.map(({ from, to }) => { + let top = heightMap.lineAt(from, QueryType.ByPos, doc, 0, 0).top; + let bottom = heightMap.lineAt(to, QueryType.ByPos, doc, 0, 0).bottom; + vpHeight += bottom - top; + return { from, to, top, bottom, domTop: 0, domBottom: 0 }; + }); + this.scale = (7000000 /* MaxDOMHeight */ - vpHeight) / (heightMap.height - vpHeight); + for (let obj of this.viewports) { + obj.domTop = domBase + (obj.top - base) * this.scale; + domBase = obj.domBottom = obj.domTop + (obj.bottom - obj.top); + base = obj.bottom; + } + } + toDOM(n) { + for (let i = 0, base = 0, domBase = 0;; i++) { + let vp = i < this.viewports.length ? this.viewports[i] : null; + if (!vp || n < vp.top) + return domBase + (n - base) * this.scale; + if (n <= vp.bottom) + return vp.domTop + (n - vp.top); + base = vp.bottom; + domBase = vp.domBottom; + } + } + fromDOM(n) { + for (let i = 0, base = 0, domBase = 0;; i++) { + let vp = i < this.viewports.length ? this.viewports[i] : null; + if (!vp || n < vp.domTop) + return base + (n - domBase) / this.scale; + if (n <= vp.domBottom) + return vp.top + (n - vp.domTop); + base = vp.bottom; + domBase = vp.domBottom; + } + } +} +function scaleBlock(block, scaler) { + if (scaler.scale == 1) + return block; + let bTop = scaler.toDOM(block.top), bBottom = scaler.toDOM(block.bottom); + return new BlockInfo(block.from, block.length, bTop, bBottom - bTop, Array.isArray(block.type) ? block.type.map(b => scaleBlock(b, scaler)) : block.type); +} + +const theme = /*@__PURE__*/Facet.define({ combine: strs => strs.join(" ") }); +const darkTheme = /*@__PURE__*/Facet.define({ combine: values => values.indexOf(true) > -1 }); +const baseThemeID = /*@__PURE__*/StyleModule.newName(), baseLightID = /*@__PURE__*/StyleModule.newName(), baseDarkID = /*@__PURE__*/StyleModule.newName(); +const lightDarkIDs = { "&light": "." + baseLightID, "&dark": "." + baseDarkID }; +function buildTheme(main, spec, scopes) { + return new StyleModule(spec, { + finish(sel) { + return /&/.test(sel) ? sel.replace(/&\w*/, m => { + if (m == "&") + return main; + if (!scopes || !scopes[m]) + throw new RangeError(`Unsupported selector: ${m}`); + return scopes[m]; + }) : main + " " + sel; + } + }); +} +const baseTheme$1 = /*@__PURE__*/buildTheme("." + baseThemeID, { + "&.cm-editor": { + position: "relative !important", + boxSizing: "border-box", + "&.cm-focused": { + // Provide a simple default outline to make sure a focused + // editor is visually distinct. Can't leave the default behavior + // because that will apply to the content element, which is + // inside the scrollable container and doesn't include the + // gutters. We also can't use an 'auto' outline, since those + // are, for some reason, drawn behind the element content, which + // will cause things like the active line background to cover + // the outline (#297). + outline: "1px dotted #212121" + }, + display: "flex !important", + flexDirection: "column" + }, + ".cm-scroller": { + display: "flex !important", + alignItems: "flex-start !important", + fontFamily: "monospace", + lineHeight: 1.4, + height: "100%", + overflowX: "auto", + position: "relative", + zIndex: 0 + }, + ".cm-content": { + margin: 0, + flexGrow: 2, + minHeight: "100%", + display: "block", + whiteSpace: "pre", + wordWrap: "normal", + boxSizing: "border-box", + padding: "4px 0", + outline: "none", + "&[contenteditable=true]": { + WebkitUserModify: "read-write-plaintext-only", + } + }, + ".cm-lineWrapping": { + whiteSpace_fallback: "pre-wrap", + whiteSpace: "break-spaces", + wordBreak: "break-word", + overflowWrap: "anywhere" + }, + "&light .cm-content": { caretColor: "black" }, + "&dark .cm-content": { caretColor: "white" }, + ".cm-line": { + display: "block", + padding: "0 2px 0 4px" + }, + ".cm-selectionLayer": { + zIndex: -1, + contain: "size style" + }, + ".cm-selectionBackground": { + position: "absolute", + }, + "&light .cm-selectionBackground": { + background: "#d9d9d9" + }, + "&dark .cm-selectionBackground": { + background: "#222" + }, + "&light.cm-focused .cm-selectionBackground": { + background: "#d7d4f0" + }, + "&dark.cm-focused .cm-selectionBackground": { + background: "#233" + }, + ".cm-cursorLayer": { + zIndex: 100, + contain: "size style", + pointerEvents: "none" + }, + "&.cm-focused .cm-cursorLayer": { + animation: "steps(1) cm-blink 1.2s infinite" + }, + // Two animations defined so that we can switch between them to + // restart the animation without forcing another style + // recomputation. + "@keyframes cm-blink": { "0%": {}, "50%": { visibility: "hidden" }, "100%": {} }, + "@keyframes cm-blink2": { "0%": {}, "50%": { visibility: "hidden" }, "100%": {} }, + ".cm-cursor, .cm-dropCursor": { + position: "absolute", + borderLeft: "1.2px solid black", + marginLeft: "-0.6px", + pointerEvents: "none", + }, + ".cm-cursor": { + display: "none" + }, + "&dark .cm-cursor": { + borderLeftColor: "#444" + }, + "&.cm-focused .cm-cursor": { + display: "block" + }, + "&light .cm-activeLine": { backgroundColor: "#f3f9ff" }, + "&dark .cm-activeLine": { backgroundColor: "#223039" }, + "&light .cm-specialChar": { color: "red" }, + "&dark .cm-specialChar": { color: "#f78" }, + ".cm-gutters": { + display: "flex", + height: "100%", + boxSizing: "border-box", + left: 0, + zIndex: 200 + }, + "&light .cm-gutters": { + backgroundColor: "#f5f5f5", + color: "#6c6c6c", + borderRight: "1px solid #ddd" + }, + "&dark .cm-gutters": { + backgroundColor: "#333338", + color: "#ccc" + }, + ".cm-gutter": { + display: "flex !important", + flexDirection: "column", + flexShrink: 0, + boxSizing: "border-box", + minHeight: "100%", + overflow: "hidden" + }, + ".cm-gutterElement": { + boxSizing: "border-box" + }, + ".cm-lineNumbers .cm-gutterElement": { + padding: "0 3px 0 5px", + minWidth: "20px", + textAlign: "right", + whiteSpace: "nowrap" + }, + "&light .cm-activeLineGutter": { + backgroundColor: "#e2f2ff" + }, + "&dark .cm-activeLineGutter": { + backgroundColor: "#222227" + }, + ".cm-panels": { + boxSizing: "border-box", + position: "sticky", + left: 0, + right: 0 + }, + "&light .cm-panels": { + backgroundColor: "#f5f5f5", + color: "black" + }, + "&light .cm-panels-top": { + borderBottom: "1px solid #ddd" + }, + "&light .cm-panels-bottom": { + borderTop: "1px solid #ddd" + }, + "&dark .cm-panels": { + backgroundColor: "#333338", + color: "white" + }, + ".cm-tab": { + display: "inline-block", + overflow: "hidden", + verticalAlign: "bottom" + }, + ".cm-widgetBuffer": { + verticalAlign: "text-top", + height: "1em", + display: "inline" + }, + ".cm-placeholder": { + color: "#888", + display: "inline-block", + verticalAlign: "top", + }, + ".cm-button": { + verticalAlign: "middle", + color: "inherit", + fontSize: "70%", + padding: ".2em 1em", + borderRadius: "1px" + }, + "&light .cm-button": { + backgroundImage: "linear-gradient(#eff1f5, #d9d9df)", + border: "1px solid #888", + "&:active": { + backgroundImage: "linear-gradient(#b4b4b4, #d0d3d6)" + } + }, + "&dark .cm-button": { + backgroundImage: "linear-gradient(#393939, #111)", + border: "1px solid #888", + "&:active": { + backgroundImage: "linear-gradient(#111, #333)" + } + }, + ".cm-textfield": { + verticalAlign: "middle", + color: "inherit", + fontSize: "70%", + border: "1px solid silver", + padding: ".2em .5em" + }, + "&light .cm-textfield": { + backgroundColor: "white" + }, + "&dark .cm-textfield": { + border: "1px solid #555", + backgroundColor: "inherit" + } +}, lightDarkIDs); + +const observeOptions = { + childList: true, + characterData: true, + subtree: true, + attributes: true, + characterDataOldValue: true +}; +// IE11 has very broken mutation observers, so we also listen to +// DOMCharacterDataModified there +const useCharData = browser.ie && browser.ie_version <= 11; +class DOMObserver { + constructor(view, onChange, onScrollChanged) { + this.view = view; + this.onChange = onChange; + this.onScrollChanged = onScrollChanged; + this.active = false; + // The known selection. Kept in our own object, as opposed to just + // directly accessing the selection because: + // - Safari doesn't report the right selection in shadow DOM + // - Reading from the selection forces a DOM layout + // - This way, we can ignore selectionchange events if we have + // already seen the 'new' selection + this.selectionRange = new DOMSelectionState; + // Set when a selection change is detected, cleared on flush + this.selectionChanged = false; + this.delayedFlush = -1; + this.resizeTimeout = -1; + this.queue = []; + this.delayedAndroidKey = null; + this.scrollTargets = []; + this.intersection = null; + this.resize = null; + this.intersecting = false; + this.gapIntersection = null; + this.gaps = []; + // Timeout for scheduling check of the parents that need scroll handlers + this.parentCheck = -1; + this.dom = view.contentDOM; + this.observer = new MutationObserver(mutations => { + for (let mut of mutations) + this.queue.push(mut); + // IE11 will sometimes (on typing over a selection or + // backspacing out a single character text node) call the + // observer callback before actually updating the DOM. + // + // Unrelatedly, iOS Safari will, when ending a composition, + // sometimes first clear it, deliver the mutations, and then + // reinsert the finished text. CodeMirror's handling of the + // deletion will prevent the reinsertion from happening, + // breaking composition. + if ((browser.ie && browser.ie_version <= 11 || browser.ios && view.composing) && + mutations.some(m => m.type == "childList" && m.removedNodes.length || + m.type == "characterData" && m.oldValue.length > m.target.nodeValue.length)) + this.flushSoon(); + else + this.flush(); + }); + if (useCharData) + this.onCharData = (event) => { + this.queue.push({ target: event.target, + type: "characterData", + oldValue: event.prevValue }); + this.flushSoon(); + }; + this.onSelectionChange = this.onSelectionChange.bind(this); + window.addEventListener("resize", this.onResize = this.onResize.bind(this)); + if (typeof ResizeObserver == "function") { + this.resize = new ResizeObserver(() => { + if (this.view.docView.lastUpdate < Date.now() - 75) + this.onResize(); + }); + this.resize.observe(view.scrollDOM); + } + window.addEventListener("beforeprint", this.onPrint = this.onPrint.bind(this)); + this.start(); + window.addEventListener("scroll", this.onScroll = this.onScroll.bind(this)); + if (typeof IntersectionObserver == "function") { + this.intersection = new IntersectionObserver(entries => { + if (this.parentCheck < 0) + this.parentCheck = setTimeout(this.listenForScroll.bind(this), 1000); + if (entries.length > 0 && (entries[entries.length - 1].intersectionRatio > 0) != this.intersecting) { + this.intersecting = !this.intersecting; + if (this.intersecting != this.view.inView) + this.onScrollChanged(document.createEvent("Event")); + } + }, {}); + this.intersection.observe(this.dom); + this.gapIntersection = new IntersectionObserver(entries => { + if (entries.length > 0 && entries[entries.length - 1].intersectionRatio > 0) + this.onScrollChanged(document.createEvent("Event")); + }, {}); + } + this.listenForScroll(); + this.readSelectionRange(); + this.dom.ownerDocument.addEventListener("selectionchange", this.onSelectionChange); + } + onScroll(e) { + if (this.intersecting) + this.flush(false); + this.onScrollChanged(e); + } + onResize() { + if (this.resizeTimeout < 0) + this.resizeTimeout = setTimeout(() => { + this.resizeTimeout = -1; + this.view.requestMeasure(); + }, 50); + } + onPrint() { + this.view.viewState.printing = true; + this.view.measure(); + setTimeout(() => { + this.view.viewState.printing = false; + this.view.requestMeasure(); + }, 500); + } + updateGaps(gaps) { + if (this.gapIntersection && (gaps.length != this.gaps.length || this.gaps.some((g, i) => g != gaps[i]))) { + this.gapIntersection.disconnect(); + for (let gap of gaps) + this.gapIntersection.observe(gap); + this.gaps = gaps; + } + } + onSelectionChange(event) { + if (!this.readSelectionRange() || this.delayedAndroidKey) + return; + let { view } = this, sel = this.selectionRange; + if (view.state.facet(editable) ? view.root.activeElement != this.dom : !hasSelection(view.dom, sel)) + return; + let context = sel.anchorNode && view.docView.nearest(sel.anchorNode); + if (context && context.ignoreEvent(event)) + return; + // Deletions on IE11 fire their events in the wrong order, giving + // us a selection change event before the DOM changes are + // reported. + // Chrome Android has a similar issue when backspacing out a + // selection (#645). + if ((browser.ie && browser.ie_version <= 11 || browser.android && browser.chrome) && !view.state.selection.main.empty && + // (Selection.isCollapsed isn't reliable on IE) + sel.focusNode && isEquivalentPosition(sel.focusNode, sel.focusOffset, sel.anchorNode, sel.anchorOffset)) + this.flushSoon(); + else + this.flush(false); + } + readSelectionRange() { + let { root } = this.view, domSel = getSelection(root); + // The Selection object is broken in shadow roots in Safari. See + // https://github.com/codemirror/codemirror.next/issues/414 + let range = browser.safari && root.nodeType == 11 && deepActiveElement() == this.view.contentDOM && + safariSelectionRangeHack(this.view) || domSel; + if (this.selectionRange.eq(range)) + return false; + this.selectionRange.setRange(range); + return this.selectionChanged = true; + } + setSelectionRange(anchor, head) { + this.selectionRange.set(anchor.node, anchor.offset, head.node, head.offset); + this.selectionChanged = false; + } + clearSelectionRange() { + this.selectionRange.set(null, 0, null, 0); + } + listenForScroll() { + this.parentCheck = -1; + let i = 0, changed = null; + for (let dom = this.dom; dom;) { + if (dom.nodeType == 1) { + if (!changed && i < this.scrollTargets.length && this.scrollTargets[i] == dom) + i++; + else if (!changed) + changed = this.scrollTargets.slice(0, i); + if (changed) + changed.push(dom); + dom = dom.assignedSlot || dom.parentNode; + } + else if (dom.nodeType == 11) { // Shadow root + dom = dom.host; + } + else { + break; + } + } + if (i < this.scrollTargets.length && !changed) + changed = this.scrollTargets.slice(0, i); + if (changed) { + for (let dom of this.scrollTargets) + dom.removeEventListener("scroll", this.onScroll); + for (let dom of this.scrollTargets = changed) + dom.addEventListener("scroll", this.onScroll); + } + } + ignore(f) { + if (!this.active) + return f(); + try { + this.stop(); + return f(); + } + finally { + this.start(); + this.clear(); + } + } + start() { + if (this.active) + return; + this.observer.observe(this.dom, observeOptions); + if (useCharData) + this.dom.addEventListener("DOMCharacterDataModified", this.onCharData); + this.active = true; + } + stop() { + if (!this.active) + return; + this.active = false; + this.observer.disconnect(); + if (useCharData) + this.dom.removeEventListener("DOMCharacterDataModified", this.onCharData); + } + // Throw away any pending changes + clear() { + this.processRecords(); + this.queue.length = 0; + this.selectionChanged = false; + } + // Chrome Android, especially in combination with GBoard, not only + // doesn't reliably fire regular key events, but also often + // surrounds the effect of enter or backspace with a bunch of + // composition events that, when interrupted, cause text duplication + // or other kinds of corruption. This hack makes the editor back off + // from handling DOM changes for a moment when such a key is + // detected (via beforeinput or keydown), and then tries to flush + // them or, if that has no effect, dispatches the given key. + delayAndroidKey(key, keyCode) { + if (!this.delayedAndroidKey) + requestAnimationFrame(() => { + let key = this.delayedAndroidKey; + this.delayedAndroidKey = null; + this.delayedFlush = -1; + if (!this.flush()) + dispatchKey(this.view.contentDOM, key.key, key.keyCode); + }); + // Since backspace beforeinput is sometimes signalled spuriously, + // Enter always takes precedence. + if (!this.delayedAndroidKey || key == "Enter") + this.delayedAndroidKey = { key, keyCode }; + } + flushSoon() { + if (this.delayedFlush < 0) + this.delayedFlush = window.setTimeout(() => { this.delayedFlush = -1; this.flush(); }, 20); + } + forceFlush() { + if (this.delayedFlush >= 0) { + window.clearTimeout(this.delayedFlush); + this.delayedFlush = -1; + this.flush(); + } + } + processRecords() { + let records = this.queue; + for (let mut of this.observer.takeRecords()) + records.push(mut); + if (records.length) + this.queue = []; + let from = -1, to = -1, typeOver = false; + for (let record of records) { + let range = this.readMutation(record); + if (!range) + continue; + if (range.typeOver) + typeOver = true; + if (from == -1) { + ({ from, to } = range); + } + else { + from = Math.min(range.from, from); + to = Math.max(range.to, to); + } + } + return { from, to, typeOver }; + } + // Apply pending changes, if any + flush(readSelection = true) { + // Completely hold off flushing when pending keys are set—the code + // managing those will make sure processRecords is called and the + // view is resynchronized after + if (this.delayedFlush >= 0 || this.delayedAndroidKey) + return; + if (readSelection) + this.readSelectionRange(); + let { from, to, typeOver } = this.processRecords(); + let newSel = this.selectionChanged && hasSelection(this.dom, this.selectionRange); + if (from < 0 && !newSel) + return; + this.selectionChanged = false; + let startState = this.view.state; + let handled = this.onChange(from, to, typeOver); + // The view wasn't updated + if (this.view.state == startState) + this.view.update([]); + return handled; + } + readMutation(rec) { + let cView = this.view.docView.nearest(rec.target); + if (!cView || cView.ignoreMutation(rec)) + return null; + cView.markDirty(rec.type == "attributes"); + if (rec.type == "attributes") + cView.dirty |= 4 /* Attrs */; + if (rec.type == "childList") { + let childBefore = findChild(cView, rec.previousSibling || rec.target.previousSibling, -1); + let childAfter = findChild(cView, rec.nextSibling || rec.target.nextSibling, 1); + return { from: childBefore ? cView.posAfter(childBefore) : cView.posAtStart, + to: childAfter ? cView.posBefore(childAfter) : cView.posAtEnd, typeOver: false }; + } + else if (rec.type == "characterData") { + return { from: cView.posAtStart, to: cView.posAtEnd, typeOver: rec.target.nodeValue == rec.oldValue }; + } + else { + return null; + } + } + destroy() { + var _a, _b, _c; + this.stop(); + (_a = this.intersection) === null || _a === void 0 ? void 0 : _a.disconnect(); + (_b = this.gapIntersection) === null || _b === void 0 ? void 0 : _b.disconnect(); + (_c = this.resize) === null || _c === void 0 ? void 0 : _c.disconnect(); + for (let dom of this.scrollTargets) + dom.removeEventListener("scroll", this.onScroll); + window.removeEventListener("scroll", this.onScroll); + window.removeEventListener("resize", this.onResize); + window.removeEventListener("beforeprint", this.onPrint); + this.dom.ownerDocument.removeEventListener("selectionchange", this.onSelectionChange); + clearTimeout(this.parentCheck); + clearTimeout(this.resizeTimeout); + } +} +function findChild(cView, dom, dir) { + while (dom) { + let curView = ContentView.get(dom); + if (curView && curView.parent == cView) + return curView; + let parent = dom.parentNode; + dom = parent != cView.dom ? parent : dir > 0 ? dom.nextSibling : dom.previousSibling; + } + return null; +} +// Used to work around a Safari Selection/shadow DOM bug (#414) +function safariSelectionRangeHack(view) { + let found = null; + // Because Safari (at least in 2018-2021) doesn't provide regular + // access to the selection inside a shadowroot, we have to perform a + // ridiculous hack to get at it—using `execCommand` to trigger a + // `beforeInput` event so that we can read the target range from the + // event. + function read(event) { + event.preventDefault(); + event.stopImmediatePropagation(); + found = event.getTargetRanges()[0]; + } + view.contentDOM.addEventListener("beforeinput", read, true); + document.execCommand("indent"); + view.contentDOM.removeEventListener("beforeinput", read, true); + if (!found) + return null; + let anchorNode = found.startContainer, anchorOffset = found.startOffset; + let focusNode = found.endContainer, focusOffset = found.endOffset; + let curAnchor = view.docView.domAtPos(view.state.selection.main.anchor); + // Since such a range doesn't distinguish between anchor and head, + // use a heuristic that flips it around if its end matches the + // current anchor. + if (isEquivalentPosition(curAnchor.node, curAnchor.offset, focusNode, focusOffset)) + [anchorNode, anchorOffset, focusNode, focusOffset] = [focusNode, focusOffset, anchorNode, anchorOffset]; + return { anchorNode, anchorOffset, focusNode, focusOffset }; +} + +function applyDOMChange(view, start, end, typeOver) { + let change, newSel; + let sel = view.state.selection.main; + if (start > -1) { + let bounds = view.docView.domBoundsAround(start, end, 0); + if (!bounds || view.state.readOnly) + return false; + let { from, to } = bounds; + let selPoints = view.docView.impreciseHead || view.docView.impreciseAnchor ? [] : selectionPoints(view); + let reader = new DOMReader(selPoints, view.state); + reader.readRange(bounds.startDOM, bounds.endDOM); + let preferredPos = sel.from, preferredSide = null; + // Prefer anchoring to end when Backspace is pressed (or, on + // Android, when something was deleted) + if (view.inputState.lastKeyCode === 8 && view.inputState.lastKeyTime > Date.now() - 100 || + browser.android && reader.text.length < to - from) { + preferredPos = sel.to; + preferredSide = "end"; + } + let diff = findDiff(view.state.doc.sliceString(from, to, LineBreakPlaceholder), reader.text, preferredPos - from, preferredSide); + if (diff) { + // Chrome inserts two newlines when pressing shift-enter at the + // end of a line. This drops one of those. + if (browser.chrome && view.inputState.lastKeyCode == 13 && + diff.toB == diff.from + 2 && reader.text.slice(diff.from, diff.toB) == LineBreakPlaceholder + LineBreakPlaceholder) + diff.toB--; + change = { from: from + diff.from, to: from + diff.toA, + insert: Text.of(reader.text.slice(diff.from, diff.toB).split(LineBreakPlaceholder)) }; + } + newSel = selectionFromPoints(selPoints, from); + } + else if (view.hasFocus || !view.state.facet(editable)) { + let domSel = view.observer.selectionRange; + let { impreciseHead: iHead, impreciseAnchor: iAnchor } = view.docView; + let head = iHead && iHead.node == domSel.focusNode && iHead.offset == domSel.focusOffset || + !contains(view.contentDOM, domSel.focusNode) + ? view.state.selection.main.head + : view.docView.posFromDOM(domSel.focusNode, domSel.focusOffset); + let anchor = iAnchor && iAnchor.node == domSel.anchorNode && iAnchor.offset == domSel.anchorOffset || + !contains(view.contentDOM, domSel.anchorNode) + ? view.state.selection.main.anchor + : view.docView.posFromDOM(domSel.anchorNode, domSel.anchorOffset); + if (head != sel.head || anchor != sel.anchor) + newSel = EditorSelection.single(anchor, head); + } + if (!change && !newSel) + return false; + // Heuristic to notice typing over a selected character + if (!change && typeOver && !sel.empty && newSel && newSel.main.empty) + change = { from: sel.from, to: sel.to, insert: view.state.doc.slice(sel.from, sel.to) }; + // If the change is inside the selection and covers most of it, + // assume it is a selection replace (with identical characters at + // the start/end not included in the diff) + else if (change && change.from >= sel.from && change.to <= sel.to && + (change.from != sel.from || change.to != sel.to) && + (sel.to - sel.from) - (change.to - change.from) <= 4) + change = { + from: sel.from, to: sel.to, + insert: view.state.doc.slice(sel.from, change.from).append(change.insert).append(view.state.doc.slice(change.to, sel.to)) + }; + // Detect insert-period-on-double-space Mac behavior, and transform + // it into a regular space insert. + else if ((browser.mac || browser.android) && change && change.from == change.to && change.from == sel.head - 1 && + change.insert.toString() == ".") + change = { from: sel.from, to: sel.to, insert: Text.of([" "]) }; + if (change) { + let startState = view.state; + if (browser.ios && view.inputState.flushIOSKey(view)) + return true; + // Android browsers don't fire reasonable key events for enter, + // backspace, or delete. So this detects changes that look like + // they're caused by those keys, and reinterprets them as key + // events. (Some of these keys are also handled by beforeinput + // events and the pendingAndroidKey mechanism, but that's not + // reliable in all situations.) + if (browser.android && + ((change.from == sel.from && change.to == sel.to && + change.insert.length == 1 && change.insert.lines == 2 && + dispatchKey(view.contentDOM, "Enter", 13)) || + (change.from == sel.from - 1 && change.to == sel.to && change.insert.length == 0 && + dispatchKey(view.contentDOM, "Backspace", 8)) || + (change.from == sel.from && change.to == sel.to + 1 && change.insert.length == 0 && + dispatchKey(view.contentDOM, "Delete", 46)))) + return true; + let text = change.insert.toString(); + if (view.state.facet(inputHandler).some(h => h(view, change.from, change.to, text))) + return true; + if (view.inputState.composing >= 0) + view.inputState.composing++; + let tr; + if (change.from >= sel.from && change.to <= sel.to && change.to - change.from >= (sel.to - sel.from) / 3 && + (!newSel || newSel.main.empty && newSel.main.from == change.from + change.insert.length) && + view.inputState.composing < 0) { + let before = sel.from < change.from ? startState.sliceDoc(sel.from, change.from) : ""; + let after = sel.to > change.to ? startState.sliceDoc(change.to, sel.to) : ""; + tr = startState.replaceSelection(view.state.toText(before + change.insert.sliceString(0, undefined, view.state.lineBreak) + after)); + } + else { + let changes = startState.changes(change); + let mainSel = newSel && !startState.selection.main.eq(newSel.main) && newSel.main.to <= changes.newLength + ? newSel.main : undefined; + // Try to apply a composition change to all cursors + if (startState.selection.ranges.length > 1 && view.inputState.composing >= 0 && + change.to <= sel.to && change.to >= sel.to - 10) { + let replaced = view.state.sliceDoc(change.from, change.to); + let compositionRange = compositionSurroundingNode(view) || view.state.doc.lineAt(sel.head); + let offset = sel.to - change.to, size = sel.to - sel.from; + tr = startState.changeByRange(range => { + if (range.from == sel.from && range.to == sel.to) + return { changes, range: mainSel || range.map(changes) }; + let to = range.to - offset, from = to - replaced.length; + if (range.to - range.from != size || view.state.sliceDoc(from, to) != replaced || + // Unfortunately, there's no way to make multiple + // changes in the same node work without aborting + // composition, so cursors in the composition range are + // ignored. + compositionRange && range.to >= compositionRange.from && range.from <= compositionRange.to) + return { range }; + let rangeChanges = startState.changes({ from, to, insert: change.insert }), selOff = range.to - sel.to; + return { + changes: rangeChanges, + range: !mainSel ? range.map(rangeChanges) : + EditorSelection.range(Math.max(0, mainSel.anchor + selOff), Math.max(0, mainSel.head + selOff)) + }; + }); + } + else { + tr = { + changes, + selection: mainSel && startState.selection.replaceRange(mainSel) + }; + } + } + let userEvent = "input.type"; + if (view.composing) { + userEvent += ".compose"; + if (view.inputState.compositionFirstChange) { + userEvent += ".start"; + view.inputState.compositionFirstChange = false; + } + } + view.dispatch(tr, { scrollIntoView: true, userEvent }); + return true; + } + else if (newSel && !newSel.main.eq(sel)) { + let scrollIntoView = false, userEvent = "select"; + if (view.inputState.lastSelectionTime > Date.now() - 50) { + if (view.inputState.lastSelectionOrigin == "select") + scrollIntoView = true; + userEvent = view.inputState.lastSelectionOrigin; + } + view.dispatch({ selection: newSel, scrollIntoView, userEvent }); + return true; + } + else { + return false; + } +} +function findDiff(a, b, preferredPos, preferredSide) { + let minLen = Math.min(a.length, b.length); + let from = 0; + while (from < minLen && a.charCodeAt(from) == b.charCodeAt(from)) + from++; + if (from == minLen && a.length == b.length) + return null; + let toA = a.length, toB = b.length; + while (toA > 0 && toB > 0 && a.charCodeAt(toA - 1) == b.charCodeAt(toB - 1)) { + toA--; + toB--; + } + if (preferredSide == "end") { + let adjust = Math.max(0, from - Math.min(toA, toB)); + preferredPos -= toA + adjust - from; + } + if (toA < from && a.length < b.length) { + let move = preferredPos <= from && preferredPos >= toA ? from - preferredPos : 0; + from -= move; + toB = from + (toB - toA); + toA = from; + } + else if (toB < from) { + let move = preferredPos <= from && preferredPos >= toB ? from - preferredPos : 0; + from -= move; + toA = from + (toA - toB); + toB = from; + } + return { from, toA, toB }; +} +function selectionPoints(view) { + let result = []; + if (view.root.activeElement != view.contentDOM) + return result; + let { anchorNode, anchorOffset, focusNode, focusOffset } = view.observer.selectionRange; + if (anchorNode) { + result.push(new DOMPoint(anchorNode, anchorOffset)); + if (focusNode != anchorNode || focusOffset != anchorOffset) + result.push(new DOMPoint(focusNode, focusOffset)); + } + return result; +} +function selectionFromPoints(points, base) { + if (points.length == 0) + return null; + let anchor = points[0].pos, head = points.length == 2 ? points[1].pos : anchor; + return anchor > -1 && head > -1 ? EditorSelection.single(anchor + base, head + base) : null; +} + +// The editor's update state machine looks something like this: +// +// Idle → Updating ⇆ Idle (unchecked) → Measuring → Idle +// ↑ ↓ +// Updating (measure) +// +// The difference between 'Idle' and 'Idle (unchecked)' lies in +// whether a layout check has been scheduled. A regular update through +// the `update` method updates the DOM in a write-only fashion, and +// relies on a check (scheduled with `requestAnimationFrame`) to make +// sure everything is where it should be and the viewport covers the +// visible code. That check continues to measure and then optionally +// update until it reaches a coherent state. +/** +An editor view represents the editor's user interface. It holds +the editable DOM surface, and possibly other elements such as the +line number gutter. It handles events and dispatches state +transactions for editing actions. +*/ +class EditorView { + /** + Construct a new view. You'll want to either provide a `parent` + option, or put `view.dom` into your document after creating a + view, so that the user can see the editor. + */ + constructor(config = {}) { + this.plugins = []; + this.pluginMap = new Map; + this.editorAttrs = {}; + this.contentAttrs = {}; + this.bidiCache = []; + this.destroyed = false; + /** + @internal + */ + this.updateState = 2 /* Updating */; + /** + @internal + */ + this.measureScheduled = -1; + /** + @internal + */ + this.measureRequests = []; + this.contentDOM = document.createElement("div"); + this.scrollDOM = document.createElement("div"); + this.scrollDOM.tabIndex = -1; + this.scrollDOM.className = "cm-scroller"; + this.scrollDOM.appendChild(this.contentDOM); + this.announceDOM = document.createElement("div"); + this.announceDOM.style.cssText = "position: absolute; top: -10000px"; + this.announceDOM.setAttribute("aria-live", "polite"); + this.dom = document.createElement("div"); + this.dom.appendChild(this.announceDOM); + this.dom.appendChild(this.scrollDOM); + this._dispatch = config.dispatch || ((tr) => this.update([tr])); + this.dispatch = this.dispatch.bind(this); + this.root = (config.root || getRoot(config.parent) || document); + this.viewState = new ViewState(config.state || EditorState.create(config)); + this.plugins = this.state.facet(viewPlugin).map(spec => new PluginInstance(spec)); + for (let plugin of this.plugins) + plugin.update(this); + this.observer = new DOMObserver(this, (from, to, typeOver) => { + return applyDOMChange(this, from, to, typeOver); + }, event => { + this.inputState.runScrollHandlers(this, event); + if (this.observer.intersecting) + this.measure(); + }); + this.inputState = new InputState(this); + this.inputState.ensureHandlers(this, this.plugins); + this.docView = new DocView(this); + this.mountStyles(); + this.updateAttrs(); + this.updateState = 0 /* Idle */; + this.requestMeasure(); + if (config.parent) + config.parent.appendChild(this.dom); + } + /** + The current editor state. + */ + get state() { return this.viewState.state; } + /** + To be able to display large documents without consuming too much + memory or overloading the browser, CodeMirror only draws the + code that is visible (plus a margin around it) to the DOM. This + property tells you the extent of the current drawn viewport, in + document positions. + */ + get viewport() { return this.viewState.viewport; } + /** + When there are, for example, large collapsed ranges in the + viewport, its size can be a lot bigger than the actual visible + content. Thus, if you are doing something like styling the + content in the viewport, it is preferable to only do so for + these ranges, which are the subset of the viewport that is + actually drawn. + */ + get visibleRanges() { return this.viewState.visibleRanges; } + /** + Returns false when the editor is entirely scrolled out of view + or otherwise hidden. + */ + get inView() { return this.viewState.inView; } + /** + Indicates whether the user is currently composing text via + [IME](https://en.wikipedia.org/wiki/Input_method), and at least + one change has been made in the current composition. + */ + get composing() { return this.inputState.composing > 0; } + /** + Indicates whether the user is currently in composing state. Note + that on some platforms, like Android, this will be the case a + lot, since just putting the cursor on a word starts a + composition there. + */ + get compositionStarted() { return this.inputState.composing >= 0; } + dispatch(...input) { + this._dispatch(input.length == 1 && input[0] instanceof Transaction ? input[0] + : this.state.update(...input)); + } + /** + Update the view for the given array of transactions. This will + update the visible document and selection to match the state + produced by the transactions, and notify view plugins of the + change. You should usually call + [`dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch) instead, which uses this + as a primitive. + */ + update(transactions) { + if (this.updateState != 0 /* Idle */) + throw new Error("Calls to EditorView.update are not allowed while an update is in progress"); + let redrawn = false, attrsChanged = false, update; + let state = this.state; + for (let tr of transactions) { + if (tr.startState != state) + throw new RangeError("Trying to update state with a transaction that doesn't start from the previous state."); + state = tr.state; + } + if (this.destroyed) { + this.viewState.state = state; + return; + } + this.observer.clear(); + // When the phrases change, redraw the editor + if (state.facet(EditorState.phrases) != this.state.facet(EditorState.phrases)) + return this.setState(state); + update = ViewUpdate.create(this, state, transactions); + let scrollTarget = this.viewState.scrollTarget; + try { + this.updateState = 2 /* Updating */; + for (let tr of transactions) { + if (scrollTarget) + scrollTarget = scrollTarget.map(tr.changes); + if (tr.scrollIntoView) { + let { main } = tr.state.selection; + scrollTarget = new ScrollTarget(main.empty ? main : EditorSelection.cursor(main.head, main.head > main.anchor ? -1 : 1)); + } + for (let e of tr.effects) + if (e.is(scrollIntoView)) + scrollTarget = e.value; + } + this.viewState.update(update, scrollTarget); + this.bidiCache = CachedOrder.update(this.bidiCache, update.changes); + if (!update.empty) { + this.updatePlugins(update); + this.inputState.update(update); + } + redrawn = this.docView.update(update); + if (this.state.facet(styleModule) != this.styleModules) + this.mountStyles(); + attrsChanged = this.updateAttrs(); + this.showAnnouncements(transactions); + this.docView.updateSelection(redrawn, transactions.some(tr => tr.isUserEvent("select.pointer"))); + } + finally { + this.updateState = 0 /* Idle */; + } + if (update.startState.facet(theme) != update.state.facet(theme)) + this.viewState.mustMeasureContent = true; + if (redrawn || attrsChanged || scrollTarget || this.viewState.mustEnforceCursorAssoc || this.viewState.mustMeasureContent) + this.requestMeasure(); + if (!update.empty) + for (let listener of this.state.facet(updateListener)) + listener(update); + } + /** + Reset the view to the given state. (This will cause the entire + document to be redrawn and all view plugins to be reinitialized, + so you should probably only use it when the new state isn't + derived from the old state. Otherwise, use + [`dispatch`](https://codemirror.net/6/docs/ref/#view.EditorView.dispatch) instead.) + */ + setState(newState) { + if (this.updateState != 0 /* Idle */) + throw new Error("Calls to EditorView.setState are not allowed while an update is in progress"); + if (this.destroyed) { + this.viewState.state = newState; + return; + } + this.updateState = 2 /* Updating */; + let hadFocus = this.hasFocus; + try { + for (let plugin of this.plugins) + plugin.destroy(this); + this.viewState = new ViewState(newState); + this.plugins = newState.facet(viewPlugin).map(spec => new PluginInstance(spec)); + this.pluginMap.clear(); + for (let plugin of this.plugins) + plugin.update(this); + this.docView = new DocView(this); + this.inputState.ensureHandlers(this, this.plugins); + this.mountStyles(); + this.updateAttrs(); + this.bidiCache = []; + } + finally { + this.updateState = 0 /* Idle */; + } + if (hadFocus) + this.focus(); + this.requestMeasure(); + } + updatePlugins(update) { + let prevSpecs = update.startState.facet(viewPlugin), specs = update.state.facet(viewPlugin); + if (prevSpecs != specs) { + let newPlugins = []; + for (let spec of specs) { + let found = prevSpecs.indexOf(spec); + if (found < 0) { + newPlugins.push(new PluginInstance(spec)); + } + else { + let plugin = this.plugins[found]; + plugin.mustUpdate = update; + newPlugins.push(plugin); + } + } + for (let plugin of this.plugins) + if (plugin.mustUpdate != update) + plugin.destroy(this); + this.plugins = newPlugins; + this.pluginMap.clear(); + this.inputState.ensureHandlers(this, this.plugins); + } + else { + for (let p of this.plugins) + p.mustUpdate = update; + } + for (let i = 0; i < this.plugins.length; i++) + this.plugins[i].update(this); + } + /** + @internal + */ + measure(flush = true) { + if (this.destroyed) + return; + if (this.measureScheduled > -1) + cancelAnimationFrame(this.measureScheduled); + this.measureScheduled = 0; // Prevent requestMeasure calls from scheduling another animation frame + if (flush) + this.observer.flush(); + let updated = null; + try { + for (let i = 0;; i++) { + this.updateState = 1 /* Measuring */; + let oldViewport = this.viewport; + let changed = this.viewState.measure(this); + if (!changed && !this.measureRequests.length && this.viewState.scrollTarget == null) + break; + if (i > 5) { + console.warn(this.measureRequests.length + ? "Measure loop restarted more than 5 times" + : "Viewport failed to stabilize"); + break; + } + let measuring = []; + // Only run measure requests in this cycle when the viewport didn't change + if (!(changed & 4 /* Viewport */)) + [this.measureRequests, measuring] = [measuring, this.measureRequests]; + let measured = measuring.map(m => { + try { + return m.read(this); + } + catch (e) { + logException(this.state, e); + return BadMeasure; + } + }); + let update = ViewUpdate.create(this, this.state, []), redrawn = false, scrolled = false; + update.flags |= changed; + if (!updated) + updated = update; + else + updated.flags |= changed; + this.updateState = 2 /* Updating */; + if (!update.empty) { + this.updatePlugins(update); + this.inputState.update(update); + this.updateAttrs(); + redrawn = this.docView.update(update); + } + for (let i = 0; i < measuring.length; i++) + if (measured[i] != BadMeasure) { + try { + let m = measuring[i]; + if (m.write) + m.write(measured[i], this); + } + catch (e) { + logException(this.state, e); + } + } + if (this.viewState.scrollTarget) { + this.docView.scrollIntoView(this.viewState.scrollTarget); + this.viewState.scrollTarget = null; + scrolled = true; + } + if (redrawn) + this.docView.updateSelection(true); + if (this.viewport.from == oldViewport.from && this.viewport.to == oldViewport.to && + !scrolled && this.measureRequests.length == 0) + break; + } + } + finally { + this.updateState = 0 /* Idle */; + this.measureScheduled = -1; + } + if (updated && !updated.empty) + for (let listener of this.state.facet(updateListener)) + listener(updated); + } + /** + Get the CSS classes for the currently active editor themes. + */ + get themeClasses() { + return baseThemeID + " " + + (this.state.facet(darkTheme) ? baseDarkID : baseLightID) + " " + + this.state.facet(theme); + } + updateAttrs() { + let editorAttrs = attrsFromFacet(this, editorAttributes, { + class: "cm-editor" + (this.hasFocus ? " cm-focused " : " ") + this.themeClasses + }); + let contentAttrs = { + spellcheck: "false", + autocorrect: "off", + autocapitalize: "off", + translate: "no", + contenteditable: !this.state.facet(editable) ? "false" : "true", + class: "cm-content", + style: `${browser.tabSize}: ${this.state.tabSize}`, + role: "textbox", + "aria-multiline": "true" + }; + if (this.state.readOnly) + contentAttrs["aria-readonly"] = "true"; + attrsFromFacet(this, contentAttributes, contentAttrs); + let changed = this.observer.ignore(() => { + let changedContent = updateAttrs(this.contentDOM, this.contentAttrs, contentAttrs); + let changedEditor = updateAttrs(this.dom, this.editorAttrs, editorAttrs); + return changedContent || changedEditor; + }); + this.editorAttrs = editorAttrs; + this.contentAttrs = contentAttrs; + return changed; + } + showAnnouncements(trs) { + let first = true; + for (let tr of trs) + for (let effect of tr.effects) + if (effect.is(EditorView.announce)) { + if (first) + this.announceDOM.textContent = ""; + first = false; + let div = this.announceDOM.appendChild(document.createElement("div")); + div.textContent = effect.value; + } + } + mountStyles() { + this.styleModules = this.state.facet(styleModule); + StyleModule.mount(this.root, this.styleModules.concat(baseTheme$1).reverse()); + } + readMeasured() { + if (this.updateState == 2 /* Updating */) + throw new Error("Reading the editor layout isn't allowed during an update"); + if (this.updateState == 0 /* Idle */ && this.measureScheduled > -1) + this.measure(false); + } + /** + Schedule a layout measurement, optionally providing callbacks to + do custom DOM measuring followed by a DOM write phase. Using + this is preferable reading DOM layout directly from, for + example, an event handler, because it'll make sure measuring and + drawing done by other components is synchronized, avoiding + unnecessary DOM layout computations. + */ + requestMeasure(request) { + if (this.measureScheduled < 0) + this.measureScheduled = requestAnimationFrame(() => this.measure()); + if (request) { + if (request.key != null) + for (let i = 0; i < this.measureRequests.length; i++) { + if (this.measureRequests[i].key === request.key) { + this.measureRequests[i] = request; + return; + } + } + this.measureRequests.push(request); + } + } + /** + Get the value of a specific plugin, if present. Note that + plugins that crash can be dropped from a view, so even when you + know you registered a given plugin, it is recommended to check + the return value of this method. + */ + plugin(plugin) { + let known = this.pluginMap.get(plugin); + if (known === undefined || known && known.spec != plugin) + this.pluginMap.set(plugin, known = this.plugins.find(p => p.spec == plugin) || null); + return known && known.update(this).value; + } + /** + The top position of the document, in screen coordinates. This + may be negative when the editor is scrolled down. Points + directly to the top of the first line, not above the padding. + */ + get documentTop() { + return this.contentDOM.getBoundingClientRect().top + this.viewState.paddingTop; + } + /** + Reports the padding above and below the document. + */ + get documentPadding() { + return { top: this.viewState.paddingTop, bottom: this.viewState.paddingBottom }; + } + /** + Find the text line or block widget at the given vertical + position (which is interpreted as relative to the [top of the + document](https://codemirror.net/6/docs/ref/#view.EditorView.documentTop) + */ + elementAtHeight(height) { + this.readMeasured(); + return this.viewState.elementAtHeight(height); + } + /** + Find the line block (see + [`lineBlockAt`](https://codemirror.net/6/docs/ref/#view.EditorView.lineBlockAt) at the given + height. + */ + lineBlockAtHeight(height) { + this.readMeasured(); + return this.viewState.lineBlockAtHeight(height); + } + /** + Get the extent and vertical position of all [line + blocks](https://codemirror.net/6/docs/ref/#view.EditorView.lineBlockAt) in the viewport. Positions + are relative to the [top of the + document](https://codemirror.net/6/docs/ref/#view.EditorView.documentTop); + */ + get viewportLineBlocks() { + return this.viewState.viewportLines; + } + /** + Find the line block around the given document position. A line + block is a range delimited on both sides by either a + non-[hidden](https://codemirror.net/6/docs/ref/#view.Decoration^replace) line breaks, or the + start/end of the document. It will usually just hold a line of + text, but may be broken into multiple textblocks by block + widgets. + */ + lineBlockAt(pos) { + return this.viewState.lineBlockAt(pos); + } + /** + The editor's total content height. + */ + get contentHeight() { + return this.viewState.contentHeight; + } + /** + Move a cursor position by [grapheme + cluster](https://codemirror.net/6/docs/ref/#state.findClusterBreak). `forward` determines whether + the motion is away from the line start, or towards it. In + bidirectional text, the line is traversed in visual order, using + the editor's [text direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection). + When the start position was the last one on the line, the + returned position will be across the line break. If there is no + further line, the original position is returned. + + By default, this method moves over a single cluster. The + optional `by` argument can be used to move across more. It will + be called with the first cluster as argument, and should return + a predicate that determines, for each subsequent cluster, + whether it should also be moved over. + */ + moveByChar(start, forward, by) { + return skipAtoms(this, start, moveByChar(this, start, forward, by)); + } + /** + Move a cursor position across the next group of either + [letters](https://codemirror.net/6/docs/ref/#state.EditorState.charCategorizer) or non-letter + non-whitespace characters. + */ + moveByGroup(start, forward) { + return skipAtoms(this, start, moveByChar(this, start, forward, initial => byGroup(this, start.head, initial))); + } + /** + Move to the next line boundary in the given direction. If + `includeWrap` is true, line wrapping is on, and there is a + further wrap point on the current line, the wrap point will be + returned. Otherwise this function will return the start or end + of the line. + */ + moveToLineBoundary(start, forward, includeWrap = true) { + return moveToLineBoundary(this, start, forward, includeWrap); + } + /** + Move a cursor position vertically. When `distance` isn't given, + it defaults to moving to the next line (including wrapped + lines). Otherwise, `distance` should provide a positive distance + in pixels. + + When `start` has a + [`goalColumn`](https://codemirror.net/6/docs/ref/#state.SelectionRange.goalColumn), the vertical + motion will use that as a target horizontal position. Otherwise, + the cursor's own horizontal position is used. The returned + cursor will have its goal column set to whichever column was + used. + */ + moveVertically(start, forward, distance) { + return skipAtoms(this, start, moveVertically(this, start, forward, distance)); + } + /** + Find the DOM parent node and offset (child offset if `node` is + an element, character offset when it is a text node) at the + given document position. + + Note that for positions that aren't currently in + `visibleRanges`, the resulting DOM position isn't necessarily + meaningful (it may just point before or after a placeholder + element). + */ + domAtPos(pos) { + return this.docView.domAtPos(pos); + } + /** + Find the document position at the given DOM node. Can be useful + for associating positions with DOM events. Will raise an error + when `node` isn't part of the editor content. + */ + posAtDOM(node, offset = 0) { + return this.docView.posFromDOM(node, offset); + } + posAtCoords(coords, precise = true) { + this.readMeasured(); + return posAtCoords(this, coords, precise); + } + /** + Get the screen coordinates at the given document position. + `side` determines whether the coordinates are based on the + element before (-1) or after (1) the position (if no element is + available on the given side, the method will transparently use + another strategy to get reasonable coordinates). + */ + coordsAtPos(pos, side = 1) { + this.readMeasured(); + let rect = this.docView.coordsAt(pos, side); + if (!rect || rect.left == rect.right) + return rect; + let line = this.state.doc.lineAt(pos), order = this.bidiSpans(line); + let span = order[BidiSpan.find(order, pos - line.from, -1, side)]; + return flattenRect(rect, (span.dir == Direction.LTR) == (side > 0)); + } + /** + The default width of a character in the editor. May not + accurately reflect the width of all characters (given variable + width fonts or styling of invididual ranges). + */ + get defaultCharacterWidth() { return this.viewState.heightOracle.charWidth; } + /** + The default height of a line in the editor. May not be accurate + for all lines. + */ + get defaultLineHeight() { return this.viewState.heightOracle.lineHeight; } + /** + The text direction + ([`direction`](https://developer.mozilla.org/en-US/docs/Web/CSS/direction) + CSS property) of the editor's content element. + */ + get textDirection() { return this.viewState.defaultTextDirection; } + /** + Find the text direction of the block at the given position, as + assigned by CSS. If + [`perLineTextDirection`](https://codemirror.net/6/docs/ref/#view.EditorView^perLineTextDirection) + isn't enabled, or the given position is outside of the viewport, + this will always return the same as + [`textDirection`](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection). Note that + this may trigger a DOM layout. + */ + textDirectionAt(pos) { + let perLine = this.state.facet(perLineTextDirection); + if (!perLine || pos < this.viewport.from || pos > this.viewport.to) + return this.textDirection; + this.readMeasured(); + return this.docView.textDirectionAt(pos); + } + /** + Whether this editor [wraps lines](https://codemirror.net/6/docs/ref/#view.EditorView.lineWrapping) + (as determined by the + [`white-space`](https://developer.mozilla.org/en-US/docs/Web/CSS/white-space) + CSS property of its content element). + */ + get lineWrapping() { return this.viewState.heightOracle.lineWrapping; } + /** + Returns the bidirectional text structure of the given line + (which should be in the current document) as an array of span + objects. The order of these spans matches the [text + direction](https://codemirror.net/6/docs/ref/#view.EditorView.textDirection)—if that is + left-to-right, the leftmost spans come first, otherwise the + rightmost spans come first. + */ + bidiSpans(line) { + if (line.length > MaxBidiLine) + return trivialOrder(line.length); + let dir = this.textDirectionAt(line.from); + for (let entry of this.bidiCache) + if (entry.from == line.from && entry.dir == dir) + return entry.order; + let order = computeOrder(line.text, dir); + this.bidiCache.push(new CachedOrder(line.from, line.to, dir, order)); + return order; + } + /** + Check whether the editor has focus. + */ + get hasFocus() { + var _a; + // Safari return false for hasFocus when the context menu is open + // or closing, which leads us to ignore selection changes from the + // context menu because it looks like the editor isn't focused. + // This kludges around that. + return (document.hasFocus() || browser.safari && ((_a = this.inputState) === null || _a === void 0 ? void 0 : _a.lastContextMenu) > Date.now() - 3e4) && + this.root.activeElement == this.contentDOM; + } + /** + Put focus on the editor. + */ + focus() { + this.observer.ignore(() => { + focusPreventScroll(this.contentDOM); + this.docView.updateSelection(); + }); + } + /** + Clean up this editor view, removing its element from the + document, unregistering event handlers, and notifying + plugins. The view instance can no longer be used after + calling this. + */ + destroy() { + for (let plugin of this.plugins) + plugin.destroy(this); + this.plugins = []; + this.inputState.destroy(); + this.dom.remove(); + this.observer.destroy(); + if (this.measureScheduled > -1) + cancelAnimationFrame(this.measureScheduled); + this.destroyed = true; + } + /** + Returns an effect that can be + [added](https://codemirror.net/6/docs/ref/#state.TransactionSpec.effects) to a transaction to + cause it to scroll the given position or range into view. + */ + static scrollIntoView(pos, options = {}) { + return scrollIntoView.of(new ScrollTarget(typeof pos == "number" ? EditorSelection.cursor(pos) : pos, options.y, options.x, options.yMargin, options.xMargin)); + } + /** + Returns an extension that can be used to add DOM event handlers. + The value should be an object mapping event names to handler + functions. For any given event, such functions are ordered by + extension precedence, and the first handler to return true will + be assumed to have handled that event, and no other handlers or + built-in behavior will be activated for it. These are registered + on the [content element](https://codemirror.net/6/docs/ref/#view.EditorView.contentDOM), except + for `scroll` handlers, which will be called any time the + editor's [scroll element](https://codemirror.net/6/docs/ref/#view.EditorView.scrollDOM) or one of + its parent nodes is scrolled. + */ + static domEventHandlers(handlers) { + return ViewPlugin.define(() => ({}), { eventHandlers: handlers }); + } + /** + Create a theme extension. The first argument can be a + [`style-mod`](https://github.com/marijnh/style-mod#documentation) + style spec providing the styles for the theme. These will be + prefixed with a generated class for the style. + + Because the selectors will be prefixed with a scope class, rule + that directly match the editor's [wrapper + element](https://codemirror.net/6/docs/ref/#view.EditorView.dom)—to which the scope class will be + added—need to be explicitly differentiated by adding an `&` to + the selector for that element—for example + `&.cm-focused`. + + When `dark` is set to true, the theme will be marked as dark, + which will cause the `&dark` rules from [base + themes](https://codemirror.net/6/docs/ref/#view.EditorView^baseTheme) to be used (as opposed to + `&light` when a light theme is active). + */ + static theme(spec, options) { + let prefix = StyleModule.newName(); + let result = [theme.of(prefix), styleModule.of(buildTheme(`.${prefix}`, spec))]; + if (options && options.dark) + result.push(darkTheme.of(true)); + return result; + } + /** + Create an extension that adds styles to the base theme. Like + with [`theme`](https://codemirror.net/6/docs/ref/#view.EditorView^theme), use `&` to indicate the + place of the editor wrapper element when directly targeting + that. You can also use `&dark` or `&light` instead to only + target editors with a dark or light theme. + */ + static baseTheme(spec) { + return Prec.lowest(styleModule.of(buildTheme("." + baseThemeID, spec, lightDarkIDs))); + } + /** + Retrieve an editor view instance from the view's DOM + representation. + */ + static findFromDOM(dom) { + var _a; + let content = dom.querySelector(".cm-content"); + let cView = content && ContentView.get(content) || ContentView.get(dom); + return ((_a = cView === null || cView === void 0 ? void 0 : cView.rootView) === null || _a === void 0 ? void 0 : _a.view) || null; + } +} +/** +Facet to add a [style +module](https://github.com/marijnh/style-mod#documentation) to +an editor view. The view will ensure that the module is +mounted in its [document +root](https://codemirror.net/6/docs/ref/#view.EditorView.constructor^config.root). +*/ +EditorView.styleModule = styleModule; +/** +An input handler can override the way changes to the editable +DOM content are handled. Handlers are passed the document +positions between which the change was found, and the new +content. When one returns true, no further input handlers are +called and the default behavior is prevented. +*/ +EditorView.inputHandler = inputHandler; +/** +By default, the editor assumes all its content has the same +[text direction](https://codemirror.net/6/docs/ref/#view.Direction). Configure this with a `true` +value to make it read the text direction of every (rendered) +line separately. +*/ +EditorView.perLineTextDirection = perLineTextDirection; +/** +Allows you to provide a function that should be called when the +library catches an exception from an extension (mostly from view +plugins, but may be used by other extensions to route exceptions +from user-code-provided callbacks). This is mostly useful for +debugging and logging. See [`logException`](https://codemirror.net/6/docs/ref/#view.logException). +*/ +EditorView.exceptionSink = exceptionSink; +/** +A facet that can be used to register a function to be called +every time the view updates. +*/ +EditorView.updateListener = updateListener; +/** +Facet that controls whether the editor content DOM is editable. +When its highest-precedence value is `false`, the element will +not have its `contenteditable` attribute set. (Note that this +doesn't affect API calls that change the editor content, even +when those are bound to keys or buttons. See the +[`readOnly`](https://codemirror.net/6/docs/ref/#state.EditorState.readOnly) facet for that.) +*/ +EditorView.editable = editable; +/** +Allows you to influence the way mouse selection happens. The +functions in this facet will be called for a `mousedown` event +on the editor, and can return an object that overrides the way a +selection is computed from that mouse click or drag. +*/ +EditorView.mouseSelectionStyle = mouseSelectionStyle; +/** +Facet used to configure whether a given selection drag event +should move or copy the selection. The given predicate will be +called with the `mousedown` event, and can return `true` when +the drag should move the content. +*/ +EditorView.dragMovesSelection = dragMovesSelection$1; +/** +Facet used to configure whether a given selecting click adds a +new range to the existing selection or replaces it entirely. The +default behavior is to check `event.metaKey` on macOS, and +`event.ctrlKey` elsewhere. +*/ +EditorView.clickAddsSelectionRange = clickAddsSelectionRange; +/** +A facet that determines which [decorations](https://codemirror.net/6/docs/ref/#view.Decoration) +are shown in the view. Decorations can be provided in two +ways—directly, or via a function that takes an editor view. + +Only decoration sets provided directly are allowed to influence +the editor's vertical layout structure. The ones provided as +functions are called _after_ the new viewport has been computed, +and thus **must not** introduce block widgets or replacing +decorations that cover line breaks. +*/ +EditorView.decorations = decorations; +/** +Used to provide ranges that should be treated as atoms as far as +cursor motion is concerned. This causes methods like +[`moveByChar`](https://codemirror.net/6/docs/ref/#view.EditorView.moveByChar) and +[`moveVertically`](https://codemirror.net/6/docs/ref/#view.EditorView.moveVertically) (and the +commands built on top of them) to skip across such regions when +a selection endpoint would enter them. This does _not_ prevent +direct programmatic [selection +updates](https://codemirror.net/6/docs/ref/#state.TransactionSpec.selection) from moving into such +regions. +*/ +EditorView.atomicRanges = atomicRanges; +/** +Facet that allows extensions to provide additional scroll +margins (space around the sides of the scrolling element that +should be considered invisible). This can be useful when the +plugin introduces elements that cover part of that element (for +example a horizontally fixed gutter). +*/ +EditorView.scrollMargins = scrollMargins; +/** +This facet records whether a dark theme is active. The extension +returned by [`theme`](https://codemirror.net/6/docs/ref/#view.EditorView^theme) automatically +includes an instance of this when the `dark` option is set to +true. +*/ +EditorView.darkTheme = darkTheme; +/** +Facet that provides additional DOM attributes for the editor's +editable DOM element. +*/ +EditorView.contentAttributes = contentAttributes; +/** +Facet that provides DOM attributes for the editor's outer +element. +*/ +EditorView.editorAttributes = editorAttributes; +/** +An extension that enables line wrapping in the editor (by +setting CSS `white-space` to `pre-wrap` in the content). +*/ +EditorView.lineWrapping = /*@__PURE__*/EditorView.contentAttributes.of({ "class": "cm-lineWrapping" }); +/** +State effect used to include screen reader announcements in a +transaction. These will be added to the DOM in a visually hidden +element with `aria-live="polite"` set, and should be used to +describe effects that are visually obvious but may not be +noticed by screen reader users (such as moving to the next +search match). +*/ +EditorView.announce = /*@__PURE__*/StateEffect.define(); +// Maximum line length for which we compute accurate bidi info +const MaxBidiLine = 4096; +const BadMeasure = {}; +class CachedOrder { + constructor(from, to, dir, order) { + this.from = from; + this.to = to; + this.dir = dir; + this.order = order; + } + static update(cache, changes) { + if (changes.empty) + return cache; + let result = [], lastDir = cache.length ? cache[cache.length - 1].dir : Direction.LTR; + for (let i = Math.max(0, cache.length - 10); i < cache.length; i++) { + let entry = cache[i]; + if (entry.dir == lastDir && !changes.touchesRange(entry.from, entry.to)) + result.push(new CachedOrder(changes.mapPos(entry.from, 1), changes.mapPos(entry.to, -1), entry.dir, entry.order)); + } + return result; + } +} +function attrsFromFacet(view, facet, base) { + for (let sources = view.state.facet(facet), i = sources.length - 1; i >= 0; i--) { + let source = sources[i], value = typeof source == "function" ? source(view) : source; + if (value) + combineAttrs(value, base); + } + return base; +} + +const currentPlatform = browser.mac ? "mac" : browser.windows ? "win" : browser.linux ? "linux" : "key"; +function normalizeKeyName(name, platform) { + const parts = name.split(/-(?!$)/); + let result = parts[parts.length - 1]; + if (result == "Space") + result = " "; + let alt, ctrl, shift, meta; + for (let i = 0; i < parts.length - 1; ++i) { + const mod = parts[i]; + if (/^(cmd|meta|m)$/i.test(mod)) + meta = true; + else if (/^a(lt)?$/i.test(mod)) + alt = true; + else if (/^(c|ctrl|control)$/i.test(mod)) + ctrl = true; + else if (/^s(hift)?$/i.test(mod)) + shift = true; + else if (/^mod$/i.test(mod)) { + if (platform == "mac") + meta = true; + else + ctrl = true; + } + else + throw new Error("Unrecognized modifier name: " + mod); + } + if (alt) + result = "Alt-" + result; + if (ctrl) + result = "Ctrl-" + result; + if (meta) + result = "Meta-" + result; + if (shift) + result = "Shift-" + result; + return result; +} +function modifiers(name, event, shift) { + if (event.altKey) + name = "Alt-" + name; + if (event.ctrlKey) + name = "Ctrl-" + name; + if (event.metaKey) + name = "Meta-" + name; + if (shift !== false && event.shiftKey) + name = "Shift-" + name; + return name; +} +const handleKeyEvents = /*@__PURE__*/EditorView.domEventHandlers({ + keydown(event, view) { + return runHandlers(getKeymap(view.state), event, view, "editor"); + } +}); +/** +Facet used for registering keymaps. + +You can add multiple keymaps to an editor. Their priorities +determine their precedence (the ones specified early or with high +priority get checked first). When a handler has returned `true` +for a given key, no further handlers are called. +*/ +const keymap = /*@__PURE__*/Facet.define({ enables: handleKeyEvents }); +const Keymaps = /*@__PURE__*/new WeakMap(); +// This is hidden behind an indirection, rather than directly computed +// by the facet, to keep internal types out of the facet's type. +function getKeymap(state) { + let bindings = state.facet(keymap); + let map = Keymaps.get(bindings); + if (!map) + Keymaps.set(bindings, map = buildKeymap(bindings.reduce((a, b) => a.concat(b), []))); + return map; +} +/** +Run the key handlers registered for a given scope. The event +object should be a `"keydown"` event. Returns true if any of the +handlers handled it. +*/ +function runScopeHandlers(view, event, scope) { + return runHandlers(getKeymap(view.state), event, view, scope); +} +let storedPrefix = null; +const PrefixTimeout = 4000; +function buildKeymap(bindings, platform = currentPlatform) { + let bound = Object.create(null); + let isPrefix = Object.create(null); + let checkPrefix = (name, is) => { + let current = isPrefix[name]; + if (current == null) + isPrefix[name] = is; + else if (current != is) + throw new Error("Key binding " + name + " is used both as a regular binding and as a multi-stroke prefix"); + }; + let add = (scope, key, command, preventDefault) => { + let scopeObj = bound[scope] || (bound[scope] = Object.create(null)); + let parts = key.split(/ (?!$)/).map(k => normalizeKeyName(k, platform)); + for (let i = 1; i < parts.length; i++) { + let prefix = parts.slice(0, i).join(" "); + checkPrefix(prefix, true); + if (!scopeObj[prefix]) + scopeObj[prefix] = { + preventDefault: true, + commands: [(view) => { + let ourObj = storedPrefix = { view, prefix, scope }; + setTimeout(() => { if (storedPrefix == ourObj) + storedPrefix = null; }, PrefixTimeout); + return true; + }] + }; + } + let full = parts.join(" "); + checkPrefix(full, false); + let binding = scopeObj[full] || (scopeObj[full] = { preventDefault: false, commands: [] }); + binding.commands.push(command); + if (preventDefault) + binding.preventDefault = true; + }; + for (let b of bindings) { + let name = b[platform] || b.key; + if (!name) + continue; + for (let scope of b.scope ? b.scope.split(" ") : ["editor"]) { + add(scope, name, b.run, b.preventDefault); + if (b.shift) + add(scope, "Shift-" + name, b.shift, b.preventDefault); + } + } + return bound; +} +function runHandlers(map, event, view, scope) { + let name = keyName(event), isChar = name.length == 1 && name != " "; + let prefix = "", fallthrough = false; + if (storedPrefix && storedPrefix.view == view && storedPrefix.scope == scope) { + prefix = storedPrefix.prefix + " "; + if (fallthrough = modifierCodes.indexOf(event.keyCode) < 0) + storedPrefix = null; + } + let runFor = (binding) => { + if (binding) { + for (let cmd of binding.commands) + if (cmd(view)) + return true; + if (binding.preventDefault) + fallthrough = true; + } + return false; + }; + let scopeObj = map[scope], baseName; + if (scopeObj) { + if (runFor(scopeObj[prefix + modifiers(name, event, !isChar)])) + return true; + if (isChar && (event.shiftKey || event.altKey || event.metaKey) && + (baseName = base[event.keyCode]) && baseName != name) { + if (runFor(scopeObj[prefix + modifiers(baseName, event, true)])) + return true; + } + else if (isChar && event.shiftKey) { + if (runFor(scopeObj[prefix + modifiers(name, event, true)])) + return true; + } + } + return fallthrough; +} + +const CanHidePrimary = !browser.ios; // FIXME test IE +const selectionConfig = /*@__PURE__*/Facet.define({ + combine(configs) { + return combineConfig(configs, { + cursorBlinkRate: 1200, + drawRangeCursor: true + }, { + cursorBlinkRate: (a, b) => Math.min(a, b), + drawRangeCursor: (a, b) => a || b + }); + } +}); +/** +Returns an extension that hides the browser's native selection and +cursor, replacing the selection with a background behind the text +(with the `cm-selectionBackground` class), and the +cursors with elements overlaid over the code (using +`cm-cursor-primary` and `cm-cursor-secondary`). + +This allows the editor to display secondary selection ranges, and +tends to produce a type of selection more in line with that users +expect in a text editor (the native selection styling will often +leave gaps between lines and won't fill the horizontal space after +a line when the selection continues past it). + +It does have a performance cost, in that it requires an extra DOM +layout cycle for many updates (the selection is drawn based on DOM +layout information that's only available after laying out the +content). +*/ +function drawSelection(config = {}) { + return [ + selectionConfig.of(config), + drawSelectionPlugin, + hideNativeSelection + ]; +} +class Piece { + constructor(left, top, width, height, className) { + this.left = left; + this.top = top; + this.width = width; + this.height = height; + this.className = className; + } + draw() { + let elt = document.createElement("div"); + elt.className = this.className; + this.adjust(elt); + return elt; + } + adjust(elt) { + elt.style.left = this.left + "px"; + elt.style.top = this.top + "px"; + if (this.width >= 0) + elt.style.width = this.width + "px"; + elt.style.height = this.height + "px"; + } + eq(p) { + return this.left == p.left && this.top == p.top && this.width == p.width && this.height == p.height && + this.className == p.className; + } +} +const drawSelectionPlugin = /*@__PURE__*/ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.rangePieces = []; + this.cursors = []; + this.measureReq = { read: this.readPos.bind(this), write: this.drawSel.bind(this) }; + this.selectionLayer = view.scrollDOM.appendChild(document.createElement("div")); + this.selectionLayer.className = "cm-selectionLayer"; + this.selectionLayer.setAttribute("aria-hidden", "true"); + this.cursorLayer = view.scrollDOM.appendChild(document.createElement("div")); + this.cursorLayer.className = "cm-cursorLayer"; + this.cursorLayer.setAttribute("aria-hidden", "true"); + view.requestMeasure(this.measureReq); + this.setBlinkRate(); + } + setBlinkRate() { + this.cursorLayer.style.animationDuration = this.view.state.facet(selectionConfig).cursorBlinkRate + "ms"; + } + update(update) { + let confChanged = update.startState.facet(selectionConfig) != update.state.facet(selectionConfig); + if (confChanged || update.selectionSet || update.geometryChanged || update.viewportChanged) + this.view.requestMeasure(this.measureReq); + if (update.transactions.some(tr => tr.scrollIntoView)) + this.cursorLayer.style.animationName = this.cursorLayer.style.animationName == "cm-blink" ? "cm-blink2" : "cm-blink"; + if (confChanged) + this.setBlinkRate(); + } + readPos() { + let { state } = this.view, conf = state.facet(selectionConfig); + let rangePieces = state.selection.ranges.map(r => r.empty ? [] : measureRange(this.view, r)).reduce((a, b) => a.concat(b)); + let cursors = []; + for (let r of state.selection.ranges) { + let prim = r == state.selection.main; + if (r.empty ? !prim || CanHidePrimary : conf.drawRangeCursor) { + let piece = measureCursor(this.view, r, prim); + if (piece) + cursors.push(piece); + } + } + return { rangePieces, cursors }; + } + drawSel({ rangePieces, cursors }) { + if (rangePieces.length != this.rangePieces.length || rangePieces.some((p, i) => !p.eq(this.rangePieces[i]))) { + this.selectionLayer.textContent = ""; + for (let p of rangePieces) + this.selectionLayer.appendChild(p.draw()); + this.rangePieces = rangePieces; + } + if (cursors.length != this.cursors.length || cursors.some((c, i) => !c.eq(this.cursors[i]))) { + let oldCursors = this.cursorLayer.children; + if (oldCursors.length !== cursors.length) { + this.cursorLayer.textContent = ""; + for (const c of cursors) + this.cursorLayer.appendChild(c.draw()); + } + else { + cursors.forEach((c, idx) => c.adjust(oldCursors[idx])); + } + this.cursors = cursors; + } + } + destroy() { + this.selectionLayer.remove(); + this.cursorLayer.remove(); + } +}); +const themeSpec = { + ".cm-line": { + "& ::selection": { backgroundColor: "transparent !important" }, + "&::selection": { backgroundColor: "transparent !important" } + } +}; +if (CanHidePrimary) + themeSpec[".cm-line"].caretColor = "transparent !important"; +const hideNativeSelection = /*@__PURE__*/Prec.highest(/*@__PURE__*/EditorView.theme(themeSpec)); +function getBase(view) { + let rect = view.scrollDOM.getBoundingClientRect(); + let left = view.textDirection == Direction.LTR ? rect.left : rect.right - view.scrollDOM.clientWidth; + return { left: left - view.scrollDOM.scrollLeft, top: rect.top - view.scrollDOM.scrollTop }; +} +function wrappedLine(view, pos, inside) { + let range = EditorSelection.cursor(pos); + return { from: Math.max(inside.from, view.moveToLineBoundary(range, false, true).from), + to: Math.min(inside.to, view.moveToLineBoundary(range, true, true).from), + type: BlockType.Text }; +} +function blockAt(view, pos) { + let line = view.lineBlockAt(pos); + if (Array.isArray(line.type)) + for (let l of line.type) { + if (l.to > pos || l.to == pos && (l.to == line.to || l.type == BlockType.Text)) + return l; + } + return line; +} +function measureRange(view, range) { + if (range.to <= view.viewport.from || range.from >= view.viewport.to) + return []; + let from = Math.max(range.from, view.viewport.from), to = Math.min(range.to, view.viewport.to); + let ltr = view.textDirection == Direction.LTR; + let content = view.contentDOM, contentRect = content.getBoundingClientRect(), base = getBase(view); + let lineStyle = window.getComputedStyle(content.firstChild); + let leftSide = contentRect.left + parseInt(lineStyle.paddingLeft) + Math.min(0, parseInt(lineStyle.textIndent)); + let rightSide = contentRect.right - parseInt(lineStyle.paddingRight); + let startBlock = blockAt(view, from), endBlock = blockAt(view, to); + let visualStart = startBlock.type == BlockType.Text ? startBlock : null; + let visualEnd = endBlock.type == BlockType.Text ? endBlock : null; + if (view.lineWrapping) { + if (visualStart) + visualStart = wrappedLine(view, from, visualStart); + if (visualEnd) + visualEnd = wrappedLine(view, to, visualEnd); + } + if (visualStart && visualEnd && visualStart.from == visualEnd.from) { + return pieces(drawForLine(range.from, range.to, visualStart)); + } + else { + let top = visualStart ? drawForLine(range.from, null, visualStart) : drawForWidget(startBlock, false); + let bottom = visualEnd ? drawForLine(null, range.to, visualEnd) : drawForWidget(endBlock, true); + let between = []; + if ((visualStart || startBlock).to < (visualEnd || endBlock).from - 1) + between.push(piece(leftSide, top.bottom, rightSide, bottom.top)); + else if (top.bottom < bottom.top && view.elementAtHeight((top.bottom + bottom.top) / 2).type == BlockType.Text) + top.bottom = bottom.top = (top.bottom + bottom.top) / 2; + return pieces(top).concat(between).concat(pieces(bottom)); + } + function piece(left, top, right, bottom) { + return new Piece(left - base.left, top - base.top - 0.01 /* Epsilon */, right - left, bottom - top + 0.01 /* Epsilon */, "cm-selectionBackground"); + } + function pieces({ top, bottom, horizontal }) { + let pieces = []; + for (let i = 0; i < horizontal.length; i += 2) + pieces.push(piece(horizontal[i], top, horizontal[i + 1], bottom)); + return pieces; + } + // Gets passed from/to in line-local positions + function drawForLine(from, to, line) { + let top = 1e9, bottom = -1e9, horizontal = []; + function addSpan(from, fromOpen, to, toOpen, dir) { + // Passing 2/-2 is a kludge to force the view to return + // coordinates on the proper side of block widgets, since + // normalizing the side there, though appropriate for most + // coordsAtPos queries, would break selection drawing. + let fromCoords = view.coordsAtPos(from, (from == line.to ? -2 : 2)); + let toCoords = view.coordsAtPos(to, (to == line.from ? 2 : -2)); + top = Math.min(fromCoords.top, toCoords.top, top); + bottom = Math.max(fromCoords.bottom, toCoords.bottom, bottom); + if (dir == Direction.LTR) + horizontal.push(ltr && fromOpen ? leftSide : fromCoords.left, ltr && toOpen ? rightSide : toCoords.right); + else + horizontal.push(!ltr && toOpen ? leftSide : toCoords.left, !ltr && fromOpen ? rightSide : fromCoords.right); + } + let start = from !== null && from !== void 0 ? from : line.from, end = to !== null && to !== void 0 ? to : line.to; + // Split the range by visible range and document line + for (let r of view.visibleRanges) + if (r.to > start && r.from < end) { + for (let pos = Math.max(r.from, start), endPos = Math.min(r.to, end);;) { + let docLine = view.state.doc.lineAt(pos); + for (let span of view.bidiSpans(docLine)) { + let spanFrom = span.from + docLine.from, spanTo = span.to + docLine.from; + if (spanFrom >= endPos) + break; + if (spanTo > pos) + addSpan(Math.max(spanFrom, pos), from == null && spanFrom <= start, Math.min(spanTo, endPos), to == null && spanTo >= end, span.dir); + } + pos = docLine.to + 1; + if (pos >= endPos) + break; + } + } + if (horizontal.length == 0) + addSpan(start, from == null, end, to == null, view.textDirection); + return { top, bottom, horizontal }; + } + function drawForWidget(block, top) { + let y = contentRect.top + (top ? block.top : block.bottom); + return { top: y, bottom: y, horizontal: [] }; + } +} +function measureCursor(view, cursor, primary) { + let pos = view.coordsAtPos(cursor.head, cursor.assoc || 1); + if (!pos) + return null; + let base = getBase(view); + return new Piece(pos.left - base.left, pos.top - base.top, -1, pos.bottom - pos.top, primary ? "cm-cursor cm-cursor-primary" : "cm-cursor cm-cursor-secondary"); +} + +const setDropCursorPos = /*@__PURE__*/StateEffect.define({ + map(pos, mapping) { return pos == null ? null : mapping.mapPos(pos); } +}); +const dropCursorPos = /*@__PURE__*/StateField.define({ + create() { return null; }, + update(pos, tr) { + if (pos != null) + pos = tr.changes.mapPos(pos); + return tr.effects.reduce((pos, e) => e.is(setDropCursorPos) ? e.value : pos, pos); + } +}); +const drawDropCursor = /*@__PURE__*/ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.cursor = null; + this.measureReq = { read: this.readPos.bind(this), write: this.drawCursor.bind(this) }; + } + update(update) { + var _a; + let cursorPos = update.state.field(dropCursorPos); + if (cursorPos == null) { + if (this.cursor != null) { + (_a = this.cursor) === null || _a === void 0 ? void 0 : _a.remove(); + this.cursor = null; + } + } + else { + if (!this.cursor) { + this.cursor = this.view.scrollDOM.appendChild(document.createElement("div")); + this.cursor.className = "cm-dropCursor"; + } + if (update.startState.field(dropCursorPos) != cursorPos || update.docChanged || update.geometryChanged) + this.view.requestMeasure(this.measureReq); + } + } + readPos() { + let pos = this.view.state.field(dropCursorPos); + let rect = pos != null && this.view.coordsAtPos(pos); + if (!rect) + return null; + let outer = this.view.scrollDOM.getBoundingClientRect(); + return { + left: rect.left - outer.left + this.view.scrollDOM.scrollLeft, + top: rect.top - outer.top + this.view.scrollDOM.scrollTop, + height: rect.bottom - rect.top + }; + } + drawCursor(pos) { + if (this.cursor) { + if (pos) { + this.cursor.style.left = pos.left + "px"; + this.cursor.style.top = pos.top + "px"; + this.cursor.style.height = pos.height + "px"; + } + else { + this.cursor.style.left = "-100000px"; + } + } + } + destroy() { + if (this.cursor) + this.cursor.remove(); + } + setDropPos(pos) { + if (this.view.state.field(dropCursorPos) != pos) + this.view.dispatch({ effects: setDropCursorPos.of(pos) }); + } +}, { + eventHandlers: { + dragover(event) { + this.setDropPos(this.view.posAtCoords({ x: event.clientX, y: event.clientY })); + }, + dragleave(event) { + if (event.target == this.view.contentDOM || !this.view.contentDOM.contains(event.relatedTarget)) + this.setDropPos(null); + }, + dragend() { + this.setDropPos(null); + }, + drop() { + this.setDropPos(null); + } + } +}); +/** +Draws a cursor at the current drop position when something is +dragged over the editor. +*/ +function dropCursor() { + return [dropCursorPos, drawDropCursor]; +} + +function iterMatches(doc, re, from, to, f) { + re.lastIndex = 0; + for (let cursor = doc.iterRange(from, to), pos = from, m; !cursor.next().done; pos += cursor.value.length) { + if (!cursor.lineBreak) + while (m = re.exec(cursor.value)) + f(pos + m.index, pos + m.index + m[0].length, m); + } +} +function matchRanges(view, maxLength) { + let visible = view.visibleRanges; + if (visible.length == 1 && visible[0].from == view.viewport.from && + visible[0].to == view.viewport.to) + return visible; + let result = []; + for (let { from, to } of visible) { + from = Math.max(view.state.doc.lineAt(from).from, from - maxLength); + to = Math.min(view.state.doc.lineAt(to).to, to + maxLength); + if (result.length && result[result.length - 1].to >= from) + result[result.length - 1].to = to; + else + result.push({ from, to }); + } + return result; +} +/** +Helper class used to make it easier to maintain decorations on +visible code that matches a given regular expression. To be used +in a [view plugin](https://codemirror.net/6/docs/ref/#view.ViewPlugin). Instances of this object +represent a matching configuration. +*/ +class MatchDecorator { + /** + Create a decorator. + */ + constructor(config) { + let { regexp, decoration, boundary, maxLength = 1000 } = config; + if (!regexp.global) + throw new RangeError("The regular expression given to MatchDecorator should have its 'g' flag set"); + this.regexp = regexp; + this.getDeco = typeof decoration == "function" ? decoration : () => decoration; + this.boundary = boundary; + this.maxLength = maxLength; + } + /** + Compute the full set of decorations for matches in the given + view's viewport. You'll want to call this when initializing your + plugin. + */ + createDeco(view) { + let build = new RangeSetBuilder(); + for (let { from, to } of matchRanges(view, this.maxLength)) + iterMatches(view.state.doc, this.regexp, from, to, (a, b, m) => build.add(a, b, this.getDeco(m, view, a))); + return build.finish(); + } + /** + Update a set of decorations for a view update. `deco` _must_ be + the set of decorations produced by _this_ `MatchDecorator` for + the view state before the update. + */ + updateDeco(update, deco) { + let changeFrom = 1e9, changeTo = -1; + if (update.docChanged) + update.changes.iterChanges((_f, _t, from, to) => { + if (to > update.view.viewport.from && from < update.view.viewport.to) { + changeFrom = Math.min(from, changeFrom); + changeTo = Math.max(to, changeTo); + } + }); + if (update.viewportChanged || changeTo - changeFrom > 1000) + return this.createDeco(update.view); + if (changeTo > -1) + return this.updateRange(update.view, deco.map(update.changes), changeFrom, changeTo); + return deco; + } + updateRange(view, deco, updateFrom, updateTo) { + for (let r of view.visibleRanges) { + let from = Math.max(r.from, updateFrom), to = Math.min(r.to, updateTo); + if (to > from) { + let fromLine = view.state.doc.lineAt(from), toLine = fromLine.to < to ? view.state.doc.lineAt(to) : fromLine; + let start = Math.max(r.from, fromLine.from), end = Math.min(r.to, toLine.to); + if (this.boundary) { + for (; from > fromLine.from; from--) + if (this.boundary.test(fromLine.text[from - 1 - fromLine.from])) { + start = from; + break; + } + for (; to < toLine.to; to++) + if (this.boundary.test(toLine.text[to - toLine.from])) { + end = to; + break; + } + } + let ranges = [], m; + if (fromLine == toLine) { + this.regexp.lastIndex = start - fromLine.from; + while ((m = this.regexp.exec(fromLine.text)) && m.index < end - fromLine.from) { + let pos = m.index + fromLine.from; + ranges.push(this.getDeco(m, view, pos).range(pos, pos + m[0].length)); + } + } + else { + iterMatches(view.state.doc, this.regexp, start, end, (from, to, m) => ranges.push(this.getDeco(m, view, from).range(from, to))); + } + deco = deco.update({ filterFrom: start, filterTo: end, filter: (from, to) => from < start || to > end, add: ranges }); + } + } + return deco; + } +} + +const UnicodeRegexpSupport = /x/.unicode != null ? "gu" : "g"; +const Specials = /*@__PURE__*/new RegExp("[\u0000-\u0008\u000a-\u001f\u007f-\u009f\u00ad\u061c\u200b\u200e\u200f\u2028\u2029\u202d\u202e\ufeff\ufff9-\ufffc]", UnicodeRegexpSupport); +const Names = { + 0: "null", + 7: "bell", + 8: "backspace", + 10: "newline", + 11: "vertical tab", + 13: "carriage return", + 27: "escape", + 8203: "zero width space", + 8204: "zero width non-joiner", + 8205: "zero width joiner", + 8206: "left-to-right mark", + 8207: "right-to-left mark", + 8232: "line separator", + 8237: "left-to-right override", + 8238: "right-to-left override", + 8233: "paragraph separator", + 65279: "zero width no-break space", + 65532: "object replacement" +}; +let _supportsTabSize = null; +function supportsTabSize() { + var _a; + if (_supportsTabSize == null && typeof document != "undefined" && document.body) { + let styles = document.body.style; + _supportsTabSize = ((_a = styles.tabSize) !== null && _a !== void 0 ? _a : styles.MozTabSize) != null; + } + return _supportsTabSize || false; +} +const specialCharConfig = /*@__PURE__*/Facet.define({ + combine(configs) { + let config = combineConfig(configs, { + render: null, + specialChars: Specials, + addSpecialChars: null + }); + if (config.replaceTabs = !supportsTabSize()) + config.specialChars = new RegExp("\t|" + config.specialChars.source, UnicodeRegexpSupport); + if (config.addSpecialChars) + config.specialChars = new RegExp(config.specialChars.source + "|" + config.addSpecialChars.source, UnicodeRegexpSupport); + return config; + } +}); +/** +Returns an extension that installs highlighting of special +characters. +*/ +function highlightSpecialChars( +/** +Configuration options. +*/ +config = {}) { + return [specialCharConfig.of(config), specialCharPlugin()]; +} +let _plugin = null; +function specialCharPlugin() { + return _plugin || (_plugin = ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.decorations = Decoration.none; + this.decorationCache = Object.create(null); + this.decorator = this.makeDecorator(view.state.facet(specialCharConfig)); + this.decorations = this.decorator.createDeco(view); + } + makeDecorator(conf) { + return new MatchDecorator({ + regexp: conf.specialChars, + decoration: (m, view, pos) => { + let { doc } = view.state; + let code = codePointAt(m[0], 0); + if (code == 9) { + let line = doc.lineAt(pos); + let size = view.state.tabSize, col = countColumn(line.text, size, pos - line.from); + return Decoration.replace({ widget: new TabWidget((size - (col % size)) * this.view.defaultCharacterWidth) }); + } + return this.decorationCache[code] || + (this.decorationCache[code] = Decoration.replace({ widget: new SpecialCharWidget(conf, code) })); + }, + boundary: conf.replaceTabs ? undefined : /[^]/ + }); + } + update(update) { + let conf = update.state.facet(specialCharConfig); + if (update.startState.facet(specialCharConfig) != conf) { + this.decorator = this.makeDecorator(conf); + this.decorations = this.decorator.createDeco(update.view); + } + else { + this.decorations = this.decorator.updateDeco(update, this.decorations); + } + } + }, { + decorations: v => v.decorations + })); +} +const DefaultPlaceholder = "\u2022"; +// Assigns placeholder characters from the Control Pictures block to +// ASCII control characters +function placeholder$1(code) { + if (code >= 32) + return DefaultPlaceholder; + if (code == 10) + return "\u2424"; + return String.fromCharCode(9216 + code); +} +class SpecialCharWidget extends WidgetType { + constructor(options, code) { + super(); + this.options = options; + this.code = code; + } + eq(other) { return other.code == this.code; } + toDOM(view) { + let ph = placeholder$1(this.code); + let desc = view.state.phrase("Control character") + " " + (Names[this.code] || "0x" + this.code.toString(16)); + let custom = this.options.render && this.options.render(this.code, desc, ph); + if (custom) + return custom; + let span = document.createElement("span"); + span.textContent = ph; + span.title = desc; + span.setAttribute("aria-label", desc); + span.className = "cm-specialChar"; + return span; + } + ignoreEvent() { return false; } +} +class TabWidget extends WidgetType { + constructor(width) { + super(); + this.width = width; + } + eq(other) { return other.width == this.width; } + toDOM() { + let span = document.createElement("span"); + span.textContent = "\t"; + span.className = "cm-tab"; + span.style.width = this.width + "px"; + return span; + } + ignoreEvent() { return false; } +} + +const plugin = /*@__PURE__*/ViewPlugin.fromClass(class { + constructor() { + this.height = 1000; + this.attrs = { style: "padding-bottom: 1000px" }; + } + update(update) { + let height = update.view.viewState.editorHeight - update.view.defaultLineHeight; + if (height != this.height) { + this.height = height; + this.attrs = { style: `padding-bottom: ${height}px` }; + } + } +}); +/** +Returns an extension that makes sure the content has a bottom +margin equivalent to the height of the editor, minus one line +height, so that every line in the document can be scrolled to the +top of the editor. + +This is only meaningful when the editor is scrollable, and should +not be enabled in editors that take the size of their content. +*/ +function scrollPastEnd() { + return [plugin, contentAttributes.of(view => { var _a; return ((_a = view.plugin(plugin)) === null || _a === void 0 ? void 0 : _a.attrs) || null; })]; +} + +/** +Mark lines that have a cursor on them with the `"cm-activeLine"` +DOM class. +*/ +function highlightActiveLine() { + return activeLineHighlighter; +} +const lineDeco = /*@__PURE__*/Decoration.line({ class: "cm-activeLine" }); +const activeLineHighlighter = /*@__PURE__*/ViewPlugin.fromClass(class { + constructor(view) { + this.decorations = this.getDeco(view); + } + update(update) { + if (update.docChanged || update.selectionSet) + this.decorations = this.getDeco(update.view); + } + getDeco(view) { + let lastLineStart = -1, deco = []; + for (let r of view.state.selection.ranges) { + if (!r.empty) + return Decoration.none; + let line = view.lineBlockAt(r.head); + if (line.from > lastLineStart) { + deco.push(lineDeco.range(line.from)); + lastLineStart = line.from; + } + } + return Decoration.set(deco); + } +}, { + decorations: v => v.decorations +}); + +class Placeholder extends WidgetType { + constructor(content) { + super(); + this.content = content; + } + toDOM() { + let wrap = document.createElement("span"); + wrap.className = "cm-placeholder"; + wrap.style.pointerEvents = "none"; + wrap.appendChild(typeof this.content == "string" ? document.createTextNode(this.content) : this.content); + if (typeof this.content == "string") + wrap.setAttribute("aria-label", "placeholder " + this.content); + else + wrap.setAttribute("aria-hidden", "true"); + return wrap; + } + ignoreEvent() { return false; } +} +/** +Extension that enables a placeholder—a piece of example content +to show when the editor is empty. +*/ +function placeholder(content) { + return ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.placeholder = Decoration.set([Decoration.widget({ widget: new Placeholder(content), side: 1 }).range(0)]); + } + get decorations() { return this.view.state.doc.length ? Decoration.none : this.placeholder; } + }, { decorations: v => v.decorations }); +} + +// Don't compute precise column positions for line offsets above this +// (since it could get expensive). Assume offset==column for them. +const MaxOff = 2000; +function rectangleFor(state, a, b) { + let startLine = Math.min(a.line, b.line), endLine = Math.max(a.line, b.line); + let ranges = []; + if (a.off > MaxOff || b.off > MaxOff || a.col < 0 || b.col < 0) { + let startOff = Math.min(a.off, b.off), endOff = Math.max(a.off, b.off); + for (let i = startLine; i <= endLine; i++) { + let line = state.doc.line(i); + if (line.length <= endOff) + ranges.push(EditorSelection.range(line.from + startOff, line.to + endOff)); + } + } + else { + let startCol = Math.min(a.col, b.col), endCol = Math.max(a.col, b.col); + for (let i = startLine; i <= endLine; i++) { + let line = state.doc.line(i); + let start = findColumn(line.text, startCol, state.tabSize, true); + if (start > -1) { + let end = findColumn(line.text, endCol, state.tabSize); + ranges.push(EditorSelection.range(line.from + start, line.from + end)); + } + } + } + return ranges; +} +function absoluteColumn(view, x) { + let ref = view.coordsAtPos(view.viewport.from); + return ref ? Math.round(Math.abs((ref.left - x) / view.defaultCharacterWidth)) : -1; +} +function getPos(view, event) { + let offset = view.posAtCoords({ x: event.clientX, y: event.clientY }, false); + let line = view.state.doc.lineAt(offset), off = offset - line.from; + let col = off > MaxOff ? -1 + : off == line.length ? absoluteColumn(view, event.clientX) + : countColumn(line.text, view.state.tabSize, offset - line.from); + return { line: line.number, col, off }; +} +function rectangleSelectionStyle(view, event) { + let start = getPos(view, event), startSel = view.state.selection; + if (!start) + return null; + return { + update(update) { + if (update.docChanged) { + let newStart = update.changes.mapPos(update.startState.doc.line(start.line).from); + let newLine = update.state.doc.lineAt(newStart); + start = { line: newLine.number, col: start.col, off: Math.min(start.off, newLine.length) }; + startSel = startSel.map(update.changes); + } + }, + get(event, _extend, multiple) { + let cur = getPos(view, event); + if (!cur) + return startSel; + let ranges = rectangleFor(view.state, start, cur); + if (!ranges.length) + return startSel; + if (multiple) + return EditorSelection.create(ranges.concat(startSel.ranges)); + else + return EditorSelection.create(ranges); + } + }; +} +/** +Create an extension that enables rectangular selections. By +default, it will react to left mouse drag with the Alt key held +down. When such a selection occurs, the text within the rectangle +that was dragged over will be selected, as one selection +[range](https://codemirror.net/6/docs/ref/#state.SelectionRange) per line. +*/ +function rectangularSelection(options) { + let filter = (options === null || options === void 0 ? void 0 : options.eventFilter) || (e => e.altKey && e.button == 0); + return EditorView.mouseSelectionStyle.of((view, event) => filter(event) ? rectangleSelectionStyle(view, event) : null); +} +const keys = { + Alt: [18, e => e.altKey], + Control: [17, e => e.ctrlKey], + Shift: [16, e => e.shiftKey], + Meta: [91, e => e.metaKey] +}; +const showCrosshair = { style: "cursor: crosshair" }; +/** +Returns an extension that turns the pointer cursor into a +crosshair when a given modifier key, defaulting to Alt, is held +down. Can serve as a visual hint that rectangular selection is +going to happen when paired with +[`rectangularSelection`](https://codemirror.net/6/docs/ref/#view.rectangularSelection). +*/ +function crosshairCursor(options = {}) { + let [code, getter] = keys[options.key || "Alt"]; + let plugin = ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.isDown = false; + } + set(isDown) { + if (this.isDown != isDown) { + this.isDown = isDown; + this.view.update([]); + } + } + }, { + eventHandlers: { + keydown(e) { + this.set(e.keyCode == code || getter(e)); + }, + keyup(e) { + if (e.keyCode == code || !getter(e)) + this.set(false); + } + } + }); + return [ + plugin, + EditorView.contentAttributes.of(view => { var _a; return ((_a = view.plugin(plugin)) === null || _a === void 0 ? void 0 : _a.isDown) ? showCrosshair : null; }) + ]; +} + +const Outside = "-10000px"; +class TooltipViewManager { + constructor(view, facet, createTooltipView) { + this.facet = facet; + this.createTooltipView = createTooltipView; + this.input = view.state.facet(facet); + this.tooltips = this.input.filter(t => t); + this.tooltipViews = this.tooltips.map(createTooltipView); + } + update(update) { + let input = update.state.facet(this.facet); + let tooltips = input.filter(x => x); + if (input === this.input) { + for (let t of this.tooltipViews) + if (t.update) + t.update(update); + return false; + } + let tooltipViews = []; + for (let i = 0; i < tooltips.length; i++) { + let tip = tooltips[i], known = -1; + if (!tip) + continue; + for (let i = 0; i < this.tooltips.length; i++) { + let other = this.tooltips[i]; + if (other && other.create == tip.create) + known = i; + } + if (known < 0) { + tooltipViews[i] = this.createTooltipView(tip); + } + else { + let tooltipView = tooltipViews[i] = this.tooltipViews[known]; + if (tooltipView.update) + tooltipView.update(update); + } + } + for (let t of this.tooltipViews) + if (tooltipViews.indexOf(t) < 0) + t.dom.remove(); + this.input = input; + this.tooltips = tooltips; + this.tooltipViews = tooltipViews; + return true; + } +} +/** +Creates an extension that configures tooltip behavior. +*/ +function tooltips(config = {}) { + return tooltipConfig.of(config); +} +function windowSpace() { + return { top: 0, left: 0, bottom: innerHeight, right: innerWidth }; +} +const tooltipConfig = /*@__PURE__*/Facet.define({ + combine: values => { + var _a, _b, _c; + return ({ + position: browser.ios ? "absolute" : ((_a = values.find(conf => conf.position)) === null || _a === void 0 ? void 0 : _a.position) || "fixed", + parent: ((_b = values.find(conf => conf.parent)) === null || _b === void 0 ? void 0 : _b.parent) || null, + tooltipSpace: ((_c = values.find(conf => conf.tooltipSpace)) === null || _c === void 0 ? void 0 : _c.tooltipSpace) || windowSpace, + }); + } +}); +const tooltipPlugin = /*@__PURE__*/ViewPlugin.fromClass(class { + constructor(view) { + var _a; + this.view = view; + this.inView = true; + this.lastTransaction = 0; + this.measureTimeout = -1; + let config = view.state.facet(tooltipConfig); + this.position = config.position; + this.parent = config.parent; + this.classes = view.themeClasses; + this.createContainer(); + this.measureReq = { read: this.readMeasure.bind(this), write: this.writeMeasure.bind(this), key: this }; + this.manager = new TooltipViewManager(view, showTooltip, t => this.createTooltip(t)); + this.intersectionObserver = typeof IntersectionObserver == "function" ? new IntersectionObserver(entries => { + if (Date.now() > this.lastTransaction - 50 && + entries.length > 0 && entries[entries.length - 1].intersectionRatio < 1) + this.measureSoon(); + }, { threshold: [1] }) : null; + this.observeIntersection(); + (_a = view.dom.ownerDocument.defaultView) === null || _a === void 0 ? void 0 : _a.addEventListener("resize", this.measureSoon = this.measureSoon.bind(this)); + this.maybeMeasure(); + } + createContainer() { + if (this.parent) { + this.container = document.createElement("div"); + this.container.style.position = "relative"; + this.container.className = this.view.themeClasses; + this.parent.appendChild(this.container); + } + else { + this.container = this.view.dom; + } + } + observeIntersection() { + if (this.intersectionObserver) { + this.intersectionObserver.disconnect(); + for (let tooltip of this.manager.tooltipViews) + this.intersectionObserver.observe(tooltip.dom); + } + } + measureSoon() { + if (this.measureTimeout < 0) + this.measureTimeout = setTimeout(() => { + this.measureTimeout = -1; + this.maybeMeasure(); + }, 50); + } + update(update) { + if (update.transactions.length) + this.lastTransaction = Date.now(); + let updated = this.manager.update(update); + if (updated) + this.observeIntersection(); + let shouldMeasure = updated || update.geometryChanged; + let newConfig = update.state.facet(tooltipConfig); + if (newConfig.position != this.position) { + this.position = newConfig.position; + for (let t of this.manager.tooltipViews) + t.dom.style.position = this.position; + shouldMeasure = true; + } + if (newConfig.parent != this.parent) { + if (this.parent) + this.container.remove(); + this.parent = newConfig.parent; + this.createContainer(); + for (let t of this.manager.tooltipViews) + this.container.appendChild(t.dom); + shouldMeasure = true; + } + else if (this.parent && this.view.themeClasses != this.classes) { + this.classes = this.container.className = this.view.themeClasses; + } + if (shouldMeasure) + this.maybeMeasure(); + } + createTooltip(tooltip) { + let tooltipView = tooltip.create(this.view); + tooltipView.dom.classList.add("cm-tooltip"); + if (tooltip.arrow && !tooltipView.dom.querySelector(".cm-tooltip > .cm-tooltip-arrow")) { + let arrow = document.createElement("div"); + arrow.className = "cm-tooltip-arrow"; + tooltipView.dom.appendChild(arrow); + } + tooltipView.dom.style.position = this.position; + tooltipView.dom.style.top = Outside; + this.container.appendChild(tooltipView.dom); + if (tooltipView.mount) + tooltipView.mount(this.view); + return tooltipView; + } + destroy() { + var _a, _b; + (_a = this.view.dom.ownerDocument.defaultView) === null || _a === void 0 ? void 0 : _a.removeEventListener("resize", this.measureSoon); + for (let { dom } of this.manager.tooltipViews) + dom.remove(); + (_b = this.intersectionObserver) === null || _b === void 0 ? void 0 : _b.disconnect(); + clearTimeout(this.measureTimeout); + } + readMeasure() { + let editor = this.view.dom.getBoundingClientRect(); + return { + editor, + parent: this.parent ? this.container.getBoundingClientRect() : editor, + pos: this.manager.tooltips.map((t, i) => { + let tv = this.manager.tooltipViews[i]; + return tv.getCoords ? tv.getCoords(t.pos) : this.view.coordsAtPos(t.pos); + }), + size: this.manager.tooltipViews.map(({ dom }) => dom.getBoundingClientRect()), + space: this.view.state.facet(tooltipConfig).tooltipSpace(this.view), + }; + } + writeMeasure(measured) { + let { editor, space } = measured; + let others = []; + for (let i = 0; i < this.manager.tooltips.length; i++) { + let tooltip = this.manager.tooltips[i], tView = this.manager.tooltipViews[i], { dom } = tView; + let pos = measured.pos[i], size = measured.size[i]; + // Hide tooltips that are outside of the editor. + if (!pos || pos.bottom <= Math.max(editor.top, space.top) || + pos.top >= Math.min(editor.bottom, space.bottom) || + pos.right < Math.max(editor.left, space.left) - .1 || + pos.left > Math.min(editor.right, space.right) + .1) { + dom.style.top = Outside; + continue; + } + let arrow = tooltip.arrow ? tView.dom.querySelector(".cm-tooltip-arrow") : null; + let arrowHeight = arrow ? 7 /* Size */ : 0; + let width = size.right - size.left, height = size.bottom - size.top; + let offset = tView.offset || noOffset, ltr = this.view.textDirection == Direction.LTR; + let left = size.width > space.right - space.left ? (ltr ? space.left : space.right - size.width) + : ltr ? Math.min(pos.left - (arrow ? 14 /* Offset */ : 0) + offset.x, space.right - width) + : Math.max(space.left, pos.left - width + (arrow ? 14 /* Offset */ : 0) - offset.x); + let above = !!tooltip.above; + if (!tooltip.strictSide && (above + ? pos.top - (size.bottom - size.top) - offset.y < space.top + : pos.bottom + (size.bottom - size.top) + offset.y > space.bottom) && + above == (space.bottom - pos.bottom > pos.top - space.top)) + above = !above; + let top = above ? pos.top - height - arrowHeight - offset.y : pos.bottom + arrowHeight + offset.y; + let right = left + width; + if (tView.overlap !== true) + for (let r of others) + if (r.left < right && r.right > left && r.top < top + height && r.bottom > top) + top = above ? r.top - height - 2 - arrowHeight : r.bottom + arrowHeight + 2; + if (this.position == "absolute") { + dom.style.top = (top - measured.parent.top) + "px"; + dom.style.left = (left - measured.parent.left) + "px"; + } + else { + dom.style.top = top + "px"; + dom.style.left = left + "px"; + } + if (arrow) + arrow.style.left = `${pos.left + (ltr ? offset.x : -offset.x) - (left + 14 /* Offset */ - 7 /* Size */)}px`; + if (tView.overlap !== true) + others.push({ left, top, right, bottom: top + height }); + dom.classList.toggle("cm-tooltip-above", above); + dom.classList.toggle("cm-tooltip-below", !above); + if (tView.positioned) + tView.positioned(); + } + } + maybeMeasure() { + if (this.manager.tooltips.length) { + if (this.view.inView) + this.view.requestMeasure(this.measureReq); + if (this.inView != this.view.inView) { + this.inView = this.view.inView; + if (!this.inView) + for (let tv of this.manager.tooltipViews) + tv.dom.style.top = Outside; + } + } + } +}, { + eventHandlers: { + scroll() { this.maybeMeasure(); } + } +}); +const baseTheme = /*@__PURE__*/EditorView.baseTheme({ + ".cm-tooltip": { + zIndex: 100 + }, + "&light .cm-tooltip": { + border: "1px solid #bbb", + backgroundColor: "#f5f5f5" + }, + "&light .cm-tooltip-section:not(:first-child)": { + borderTop: "1px solid #bbb", + }, + "&dark .cm-tooltip": { + backgroundColor: "#333338", + color: "white" + }, + ".cm-tooltip-arrow": { + height: `${7 /* Size */}px`, + width: `${7 /* Size */ * 2}px`, + position: "absolute", + zIndex: -1, + overflow: "hidden", + "&:before, &:after": { + content: "''", + position: "absolute", + width: 0, + height: 0, + borderLeft: `${7 /* Size */}px solid transparent`, + borderRight: `${7 /* Size */}px solid transparent`, + }, + ".cm-tooltip-above &": { + bottom: `-${7 /* Size */}px`, + "&:before": { + borderTop: `${7 /* Size */}px solid #bbb`, + }, + "&:after": { + borderTop: `${7 /* Size */}px solid #f5f5f5`, + bottom: "1px" + } + }, + ".cm-tooltip-below &": { + top: `-${7 /* Size */}px`, + "&:before": { + borderBottom: `${7 /* Size */}px solid #bbb`, + }, + "&:after": { + borderBottom: `${7 /* Size */}px solid #f5f5f5`, + top: "1px" + } + }, + }, + "&dark .cm-tooltip .cm-tooltip-arrow": { + "&:before": { + borderTopColor: "#333338", + borderBottomColor: "#333338" + }, + "&:after": { + borderTopColor: "transparent", + borderBottomColor: "transparent" + } + } +}); +const noOffset = { x: 0, y: 0 }; +/** +Facet to which an extension can add a value to show a tooltip. +*/ +const showTooltip = /*@__PURE__*/Facet.define({ + enables: [tooltipPlugin, baseTheme] +}); +const showHoverTooltip = /*@__PURE__*/Facet.define(); +class HoverTooltipHost { + constructor(view) { + this.view = view; + this.mounted = false; + this.dom = document.createElement("div"); + this.dom.classList.add("cm-tooltip-hover"); + this.manager = new TooltipViewManager(view, showHoverTooltip, t => this.createHostedView(t)); + } + // Needs to be static so that host tooltip instances always match + static create(view) { + return new HoverTooltipHost(view); + } + createHostedView(tooltip) { + let hostedView = tooltip.create(this.view); + hostedView.dom.classList.add("cm-tooltip-section"); + this.dom.appendChild(hostedView.dom); + if (this.mounted && hostedView.mount) + hostedView.mount(this.view); + return hostedView; + } + mount(view) { + for (let hostedView of this.manager.tooltipViews) { + if (hostedView.mount) + hostedView.mount(view); + } + this.mounted = true; + } + positioned() { + for (let hostedView of this.manager.tooltipViews) { + if (hostedView.positioned) + hostedView.positioned(); + } + } + update(update) { + this.manager.update(update); + } +} +const showHoverTooltipHost = /*@__PURE__*/showTooltip.compute([showHoverTooltip], state => { + let tooltips = state.facet(showHoverTooltip).filter(t => t); + if (tooltips.length === 0) + return null; + return { + pos: Math.min(...tooltips.map(t => t.pos)), + end: Math.max(...tooltips.filter(t => t.end != null).map(t => t.end)), + create: HoverTooltipHost.create, + above: tooltips[0].above, + arrow: tooltips.some(t => t.arrow), + }; +}); +class HoverPlugin { + constructor(view, source, field, setHover, hoverTime) { + this.view = view; + this.source = source; + this.field = field; + this.setHover = setHover; + this.hoverTime = hoverTime; + this.hoverTimeout = -1; + this.restartTimeout = -1; + this.pending = null; + this.lastMove = { x: 0, y: 0, target: view.dom, time: 0 }; + this.checkHover = this.checkHover.bind(this); + view.dom.addEventListener("mouseleave", this.mouseleave = this.mouseleave.bind(this)); + view.dom.addEventListener("mousemove", this.mousemove = this.mousemove.bind(this)); + } + update() { + if (this.pending) { + this.pending = null; + clearTimeout(this.restartTimeout); + this.restartTimeout = setTimeout(() => this.startHover(), 20); + } + } + get active() { + return this.view.state.field(this.field); + } + checkHover() { + this.hoverTimeout = -1; + if (this.active) + return; + let hovered = Date.now() - this.lastMove.time; + if (hovered < this.hoverTime) + this.hoverTimeout = setTimeout(this.checkHover, this.hoverTime - hovered); + else + this.startHover(); + } + startHover() { + clearTimeout(this.restartTimeout); + let { lastMove } = this; + let pos = this.view.contentDOM.contains(lastMove.target) ? this.view.posAtCoords(lastMove) : null; + if (pos == null) + return; + let posCoords = this.view.coordsAtPos(pos); + if (posCoords == null || lastMove.y < posCoords.top || lastMove.y > posCoords.bottom || + lastMove.x < posCoords.left - this.view.defaultCharacterWidth || + lastMove.x > posCoords.right + this.view.defaultCharacterWidth) + return; + let bidi = this.view.bidiSpans(this.view.state.doc.lineAt(pos)).find(s => s.from <= pos && s.to >= pos); + let rtl = bidi && bidi.dir == Direction.RTL ? -1 : 1; + let open = this.source(this.view, pos, (lastMove.x < posCoords.left ? -rtl : rtl)); + if (open === null || open === void 0 ? void 0 : open.then) { + let pending = this.pending = { pos }; + open.then(result => { + if (this.pending == pending) { + this.pending = null; + if (result) + this.view.dispatch({ effects: this.setHover.of(result) }); + } + }, e => logException(this.view.state, e, "hover tooltip")); + } + else if (open) { + this.view.dispatch({ effects: this.setHover.of(open) }); + } + } + mousemove(event) { + var _a; + this.lastMove = { x: event.clientX, y: event.clientY, target: event.target, time: Date.now() }; + if (this.hoverTimeout < 0) + this.hoverTimeout = setTimeout(this.checkHover, this.hoverTime); + let tooltip = this.active; + if (tooltip && !isInTooltip(this.lastMove.target) || this.pending) { + let { pos } = tooltip || this.pending, end = (_a = tooltip === null || tooltip === void 0 ? void 0 : tooltip.end) !== null && _a !== void 0 ? _a : pos; + if ((pos == end ? this.view.posAtCoords(this.lastMove) != pos + : !isOverRange(this.view, pos, end, event.clientX, event.clientY, 6 /* MaxDist */))) { + this.view.dispatch({ effects: this.setHover.of(null) }); + this.pending = null; + } + } + } + mouseleave() { + clearTimeout(this.hoverTimeout); + this.hoverTimeout = -1; + if (this.active) + this.view.dispatch({ effects: this.setHover.of(null) }); + } + destroy() { + clearTimeout(this.hoverTimeout); + this.view.dom.removeEventListener("mouseleave", this.mouseleave); + this.view.dom.removeEventListener("mousemove", this.mousemove); + } +} +function isInTooltip(elt) { + for (let cur = elt; cur; cur = cur.parentNode) + if (cur.nodeType == 1 && cur.classList.contains("cm-tooltip")) + return true; + return false; +} +function isOverRange(view, from, to, x, y, margin) { + let range = document.createRange(); + let fromDOM = view.domAtPos(from), toDOM = view.domAtPos(to); + range.setEnd(toDOM.node, toDOM.offset); + range.setStart(fromDOM.node, fromDOM.offset); + let rects = range.getClientRects(); + range.detach(); + for (let i = 0; i < rects.length; i++) { + let rect = rects[i]; + let dist = Math.max(rect.top - y, y - rect.bottom, rect.left - x, x - rect.right); + if (dist <= margin) + return true; + } + return false; +} +/** +Set up a hover tooltip, which shows up when the pointer hovers +over ranges of text. The callback is called when the mouse hovers +over the document text. It should, if there is a tooltip +associated with position `pos`, return the tooltip description +(either directly or in a promise). The `side` argument indicates +on which side of the position the pointer is—it will be -1 if the +pointer is before the position, 1 if after the position. + +Note that all hover tooltips are hosted within a single tooltip +container element. This allows multiple tooltips over the same +range to be "merged" together without overlapping. +*/ +function hoverTooltip(source, options = {}) { + let setHover = StateEffect.define(); + let hoverState = StateField.define({ + create() { return null; }, + update(value, tr) { + if (value && (options.hideOnChange && (tr.docChanged || tr.selection) || + options.hideOn && options.hideOn(tr, value))) + return null; + if (value && tr.docChanged) { + let newPos = tr.changes.mapPos(value.pos, -1, MapMode.TrackDel); + if (newPos == null) + return null; + let copy = Object.assign(Object.create(null), value); + copy.pos = newPos; + if (value.end != null) + copy.end = tr.changes.mapPos(value.end); + value = copy; + } + for (let effect of tr.effects) { + if (effect.is(setHover)) + value = effect.value; + if (effect.is(closeHoverTooltipEffect)) + value = null; + } + return value; + }, + provide: f => showHoverTooltip.from(f) + }); + return [ + hoverState, + ViewPlugin.define(view => new HoverPlugin(view, source, hoverState, setHover, options.hoverTime || 300 /* Time */)), + showHoverTooltipHost + ]; +} +/** +Get the active tooltip view for a given tooltip, if available. +*/ +function getTooltip(view, tooltip) { + let plugin = view.plugin(tooltipPlugin); + if (!plugin) + return null; + let found = plugin.manager.tooltips.indexOf(tooltip); + return found < 0 ? null : plugin.manager.tooltipViews[found]; +} +/** +Returns true if any hover tooltips are currently active. +*/ +function hasHoverTooltips(state) { + return state.facet(showHoverTooltip).some(x => x); +} +const closeHoverTooltipEffect = /*@__PURE__*/StateEffect.define(); +/** +Transaction effect that closes all hover tooltips. +*/ +const closeHoverTooltips = /*@__PURE__*/closeHoverTooltipEffect.of(null); +/** +Tell the tooltip extension to recompute the position of the active +tooltips. This can be useful when something happens (such as a +re-positioning or CSS change affecting the editor) that could +invalidate the existing tooltip positions. +*/ +function repositionTooltips(view) { + var _a; + (_a = view.plugin(tooltipPlugin)) === null || _a === void 0 ? void 0 : _a.maybeMeasure(); +} + +const panelConfig = /*@__PURE__*/Facet.define({ + combine(configs) { + let topContainer, bottomContainer; + for (let c of configs) { + topContainer = topContainer || c.topContainer; + bottomContainer = bottomContainer || c.bottomContainer; + } + return { topContainer, bottomContainer }; + } +}); +/** +Configures the panel-managing extension. +*/ +function panels(config) { + return config ? [panelConfig.of(config)] : []; +} +/** +Get the active panel created by the given constructor, if any. +This can be useful when you need access to your panels' DOM +structure. +*/ +function getPanel(view, panel) { + let plugin = view.plugin(panelPlugin); + let index = plugin ? plugin.specs.indexOf(panel) : -1; + return index > -1 ? plugin.panels[index] : null; +} +const panelPlugin = /*@__PURE__*/ViewPlugin.fromClass(class { + constructor(view) { + this.input = view.state.facet(showPanel); + this.specs = this.input.filter(s => s); + this.panels = this.specs.map(spec => spec(view)); + let conf = view.state.facet(panelConfig); + this.top = new PanelGroup(view, true, conf.topContainer); + this.bottom = new PanelGroup(view, false, conf.bottomContainer); + this.top.sync(this.panels.filter(p => p.top)); + this.bottom.sync(this.panels.filter(p => !p.top)); + for (let p of this.panels) { + p.dom.classList.add("cm-panel"); + if (p.mount) + p.mount(); + } + } + update(update) { + let conf = update.state.facet(panelConfig); + if (this.top.container != conf.topContainer) { + this.top.sync([]); + this.top = new PanelGroup(update.view, true, conf.topContainer); + } + if (this.bottom.container != conf.bottomContainer) { + this.bottom.sync([]); + this.bottom = new PanelGroup(update.view, false, conf.bottomContainer); + } + this.top.syncClasses(); + this.bottom.syncClasses(); + let input = update.state.facet(showPanel); + if (input != this.input) { + let specs = input.filter(x => x); + let panels = [], top = [], bottom = [], mount = []; + for (let spec of specs) { + let known = this.specs.indexOf(spec), panel; + if (known < 0) { + panel = spec(update.view); + mount.push(panel); + } + else { + panel = this.panels[known]; + if (panel.update) + panel.update(update); + } + panels.push(panel); + (panel.top ? top : bottom).push(panel); + } + this.specs = specs; + this.panels = panels; + this.top.sync(top); + this.bottom.sync(bottom); + for (let p of mount) { + p.dom.classList.add("cm-panel"); + if (p.mount) + p.mount(); + } + } + else { + for (let p of this.panels) + if (p.update) + p.update(update); + } + } + destroy() { + this.top.sync([]); + this.bottom.sync([]); + } +}, { + provide: plugin => EditorView.scrollMargins.of(view => { + let value = view.plugin(plugin); + return value && { top: value.top.scrollMargin(), bottom: value.bottom.scrollMargin() }; + }) +}); +class PanelGroup { + constructor(view, top, container) { + this.view = view; + this.top = top; + this.container = container; + this.dom = undefined; + this.classes = ""; + this.panels = []; + this.syncClasses(); + } + sync(panels) { + for (let p of this.panels) + if (p.destroy && panels.indexOf(p) < 0) + p.destroy(); + this.panels = panels; + this.syncDOM(); + } + syncDOM() { + if (this.panels.length == 0) { + if (this.dom) { + this.dom.remove(); + this.dom = undefined; + } + return; + } + if (!this.dom) { + this.dom = document.createElement("div"); + this.dom.className = this.top ? "cm-panels cm-panels-top" : "cm-panels cm-panels-bottom"; + this.dom.style[this.top ? "top" : "bottom"] = "0"; + let parent = this.container || this.view.dom; + parent.insertBefore(this.dom, this.top ? parent.firstChild : null); + } + let curDOM = this.dom.firstChild; + for (let panel of this.panels) { + if (panel.dom.parentNode == this.dom) { + while (curDOM != panel.dom) + curDOM = rm(curDOM); + curDOM = curDOM.nextSibling; + } + else { + this.dom.insertBefore(panel.dom, curDOM); + } + } + while (curDOM) + curDOM = rm(curDOM); + } + scrollMargin() { + return !this.dom || this.container ? 0 + : Math.max(0, this.top ? + this.dom.getBoundingClientRect().bottom - Math.max(0, this.view.scrollDOM.getBoundingClientRect().top) : + Math.min(innerHeight, this.view.scrollDOM.getBoundingClientRect().bottom) - this.dom.getBoundingClientRect().top); + } + syncClasses() { + if (!this.container || this.classes == this.view.themeClasses) + return; + for (let cls of this.classes.split(" ")) + if (cls) + this.container.classList.remove(cls); + for (let cls of (this.classes = this.view.themeClasses).split(" ")) + if (cls) + this.container.classList.add(cls); + } +} +function rm(node) { + let next = node.nextSibling; + node.remove(); + return next; +} +/** +Opening a panel is done by providing a constructor function for +the panel through this facet. (The panel is closed again when its +constructor is no longer provided.) Values of `null` are ignored. +*/ +const showPanel = /*@__PURE__*/Facet.define({ + enables: panelPlugin +}); + +/** +A gutter marker represents a bit of information attached to a line +in a specific gutter. Your own custom markers have to extend this +class. +*/ +class GutterMarker extends RangeValue { + /** + @internal + */ + compare(other) { + return this == other || this.constructor == other.constructor && this.eq(other); + } + /** + Compare this marker to another marker of the same type. + */ + eq(other) { return false; } + /** + Called if the marker has a `toDOM` method and its representation + was removed from a gutter. + */ + destroy(dom) { } +} +GutterMarker.prototype.elementClass = ""; +GutterMarker.prototype.toDOM = undefined; +GutterMarker.prototype.mapMode = MapMode.TrackBefore; +GutterMarker.prototype.startSide = GutterMarker.prototype.endSide = -1; +GutterMarker.prototype.point = true; +/** +Facet used to add a class to all gutter elements for a given line. +Markers given to this facet should _only_ define an +[`elementclass`](https://codemirror.net/6/docs/ref/#view.GutterMarker.elementClass), not a +[`toDOM`](https://codemirror.net/6/docs/ref/#view.GutterMarker.toDOM) (or the marker will appear +in all gutters for the line). +*/ +const gutterLineClass = /*@__PURE__*/Facet.define(); +const defaults = { + class: "", + renderEmptyElements: false, + elementStyle: "", + markers: () => RangeSet.empty, + lineMarker: () => null, + lineMarkerChange: null, + initialSpacer: null, + updateSpacer: null, + domEventHandlers: {} +}; +const activeGutters = /*@__PURE__*/Facet.define(); +/** +Define an editor gutter. The order in which the gutters appear is +determined by their extension priority. +*/ +function gutter(config) { + return [gutters(), activeGutters.of(Object.assign(Object.assign({}, defaults), config))]; +} +const unfixGutters = /*@__PURE__*/Facet.define({ + combine: values => values.some(x => x) +}); +/** +The gutter-drawing plugin is automatically enabled when you add a +gutter, but you can use this function to explicitly configure it. + +Unless `fixed` is explicitly set to `false`, the gutters are +fixed, meaning they don't scroll along with the content +horizontally (except on Internet Explorer, which doesn't support +CSS [`position: +sticky`](https://developer.mozilla.org/en-US/docs/Web/CSS/position#sticky)). +*/ +function gutters(config) { + let result = [ + gutterView, + ]; + if (config && config.fixed === false) + result.push(unfixGutters.of(true)); + return result; +} +const gutterView = /*@__PURE__*/ViewPlugin.fromClass(class { + constructor(view) { + this.view = view; + this.prevViewport = view.viewport; + this.dom = document.createElement("div"); + this.dom.className = "cm-gutters"; + this.dom.setAttribute("aria-hidden", "true"); + this.dom.style.minHeight = this.view.contentHeight + "px"; + this.gutters = view.state.facet(activeGutters).map(conf => new SingleGutterView(view, conf)); + for (let gutter of this.gutters) + this.dom.appendChild(gutter.dom); + this.fixed = !view.state.facet(unfixGutters); + if (this.fixed) { + // FIXME IE11 fallback, which doesn't support position: sticky, + // by using position: relative + event handlers that realign the + // gutter (or just force fixed=false on IE11?) + this.dom.style.position = "sticky"; + } + this.syncGutters(false); + view.scrollDOM.insertBefore(this.dom, view.contentDOM); + } + update(update) { + if (this.updateGutters(update)) { + // Detach during sync when the viewport changed significantly + // (such as during scrolling), since for large updates that is + // faster. + let vpA = this.prevViewport, vpB = update.view.viewport; + let vpOverlap = Math.min(vpA.to, vpB.to) - Math.max(vpA.from, vpB.from); + this.syncGutters(vpOverlap < (vpB.to - vpB.from) * 0.8); + } + if (update.geometryChanged) + this.dom.style.minHeight = this.view.contentHeight + "px"; + if (this.view.state.facet(unfixGutters) != !this.fixed) { + this.fixed = !this.fixed; + this.dom.style.position = this.fixed ? "sticky" : ""; + } + this.prevViewport = update.view.viewport; + } + syncGutters(detach) { + let after = this.dom.nextSibling; + if (detach) + this.dom.remove(); + let lineClasses = RangeSet.iter(this.view.state.facet(gutterLineClass), this.view.viewport.from); + let classSet = []; + let contexts = this.gutters.map(gutter => new UpdateContext(gutter, this.view.viewport, -this.view.documentPadding.top)); + for (let line of this.view.viewportLineBlocks) { + let text; + if (Array.isArray(line.type)) { + for (let b of line.type) + if (b.type == BlockType.Text) { + text = b; + break; + } + } + else { + text = line.type == BlockType.Text ? line : undefined; + } + if (!text) + continue; + if (classSet.length) + classSet = []; + advanceCursor(lineClasses, classSet, line.from); + for (let cx of contexts) + cx.line(this.view, text, classSet); + } + for (let cx of contexts) + cx.finish(); + if (detach) + this.view.scrollDOM.insertBefore(this.dom, after); + } + updateGutters(update) { + let prev = update.startState.facet(activeGutters), cur = update.state.facet(activeGutters); + let change = update.docChanged || update.heightChanged || update.viewportChanged || + !RangeSet.eq(update.startState.facet(gutterLineClass), update.state.facet(gutterLineClass), update.view.viewport.from, update.view.viewport.to); + if (prev == cur) { + for (let gutter of this.gutters) + if (gutter.update(update)) + change = true; + } + else { + change = true; + let gutters = []; + for (let conf of cur) { + let known = prev.indexOf(conf); + if (known < 0) { + gutters.push(new SingleGutterView(this.view, conf)); + } + else { + this.gutters[known].update(update); + gutters.push(this.gutters[known]); + } + } + for (let g of this.gutters) { + g.dom.remove(); + if (gutters.indexOf(g) < 0) + g.destroy(); + } + for (let g of gutters) + this.dom.appendChild(g.dom); + this.gutters = gutters; + } + return change; + } + destroy() { + for (let view of this.gutters) + view.destroy(); + this.dom.remove(); + } +}, { + provide: plugin => EditorView.scrollMargins.of(view => { + let value = view.plugin(plugin); + if (!value || value.gutters.length == 0 || !value.fixed) + return null; + return view.textDirection == Direction.LTR ? { left: value.dom.offsetWidth } : { right: value.dom.offsetWidth }; + }) +}); +function asArray(val) { return (Array.isArray(val) ? val : [val]); } +function advanceCursor(cursor, collect, pos) { + while (cursor.value && cursor.from <= pos) { + if (cursor.from == pos) + collect.push(cursor.value); + cursor.next(); + } +} +class UpdateContext { + constructor(gutter, viewport, height) { + this.gutter = gutter; + this.height = height; + this.localMarkers = []; + this.i = 0; + this.cursor = RangeSet.iter(gutter.markers, viewport.from); + } + line(view, line, extraMarkers) { + if (this.localMarkers.length) + this.localMarkers = []; + advanceCursor(this.cursor, this.localMarkers, line.from); + let localMarkers = extraMarkers.length ? this.localMarkers.concat(extraMarkers) : this.localMarkers; + let forLine = this.gutter.config.lineMarker(view, line, localMarkers); + if (forLine) + localMarkers.unshift(forLine); + let gutter = this.gutter; + if (localMarkers.length == 0 && !gutter.config.renderEmptyElements) + return; + let above = line.top - this.height; + if (this.i == gutter.elements.length) { + let newElt = new GutterElement(view, line.height, above, localMarkers); + gutter.elements.push(newElt); + gutter.dom.appendChild(newElt.dom); + } + else { + gutter.elements[this.i].update(view, line.height, above, localMarkers); + } + this.height = line.bottom; + this.i++; + } + finish() { + let gutter = this.gutter; + while (gutter.elements.length > this.i) { + let last = gutter.elements.pop(); + gutter.dom.removeChild(last.dom); + last.destroy(); + } + } +} +class SingleGutterView { + constructor(view, config) { + this.view = view; + this.config = config; + this.elements = []; + this.spacer = null; + this.dom = document.createElement("div"); + this.dom.className = "cm-gutter" + (this.config.class ? " " + this.config.class : ""); + for (let prop in config.domEventHandlers) { + this.dom.addEventListener(prop, (event) => { + let line = view.lineBlockAtHeight(event.clientY - view.documentTop); + if (config.domEventHandlers[prop](view, line, event)) + event.preventDefault(); + }); + } + this.markers = asArray(config.markers(view)); + if (config.initialSpacer) { + this.spacer = new GutterElement(view, 0, 0, [config.initialSpacer(view)]); + this.dom.appendChild(this.spacer.dom); + this.spacer.dom.style.cssText += "visibility: hidden; pointer-events: none"; + } + } + update(update) { + let prevMarkers = this.markers; + this.markers = asArray(this.config.markers(update.view)); + if (this.spacer && this.config.updateSpacer) { + let updated = this.config.updateSpacer(this.spacer.markers[0], update); + if (updated != this.spacer.markers[0]) + this.spacer.update(update.view, 0, 0, [updated]); + } + let vp = update.view.viewport; + return !RangeSet.eq(this.markers, prevMarkers, vp.from, vp.to) || + (this.config.lineMarkerChange ? this.config.lineMarkerChange(update) : false); + } + destroy() { + for (let elt of this.elements) + elt.destroy(); + } +} +class GutterElement { + constructor(view, height, above, markers) { + this.height = -1; + this.above = 0; + this.markers = []; + this.dom = document.createElement("div"); + this.dom.className = "cm-gutterElement"; + this.update(view, height, above, markers); + } + update(view, height, above, markers) { + if (this.height != height) + this.dom.style.height = (this.height = height) + "px"; + if (this.above != above) + this.dom.style.marginTop = (this.above = above) ? above + "px" : ""; + if (!sameMarkers(this.markers, markers)) + this.setMarkers(view, markers); + } + setMarkers(view, markers) { + let cls = "cm-gutterElement", domPos = this.dom.firstChild; + for (let iNew = 0, iOld = 0;;) { + let skipTo = iOld, marker = iNew < markers.length ? markers[iNew++] : null, matched = false; + if (marker) { + let c = marker.elementClass; + if (c) + cls += " " + c; + for (let i = iOld; i < this.markers.length; i++) + if (this.markers[i].compare(marker)) { + skipTo = i; + matched = true; + break; + } + } + else { + skipTo = this.markers.length; + } + while (iOld < skipTo) { + let next = this.markers[iOld++]; + if (next.toDOM) { + next.destroy(domPos); + let after = domPos.nextSibling; + domPos.remove(); + domPos = after; + } + } + if (!marker) + break; + if (marker.toDOM) { + if (matched) + domPos = domPos.nextSibling; + else + this.dom.insertBefore(marker.toDOM(view), domPos); + } + if (matched) + iOld++; + } + this.dom.className = cls; + this.markers = markers; + } + destroy() { + this.setMarkers(null, []); // First argument not used unless creating markers + } +} +function sameMarkers(a, b) { + if (a.length != b.length) + return false; + for (let i = 0; i < a.length; i++) + if (!a[i].compare(b[i])) + return false; + return true; +} +/** +Facet used to provide markers to the line number gutter. +*/ +const lineNumberMarkers = /*@__PURE__*/Facet.define(); +const lineNumberConfig = /*@__PURE__*/Facet.define({ + combine(values) { + return combineConfig(values, { formatNumber: String, domEventHandlers: {} }, { + domEventHandlers(a, b) { + let result = Object.assign({}, a); + for (let event in b) { + let exists = result[event], add = b[event]; + result[event] = exists ? (view, line, event) => exists(view, line, event) || add(view, line, event) : add; + } + return result; + } + }); + } +}); +class NumberMarker extends GutterMarker { + constructor(number) { + super(); + this.number = number; + } + eq(other) { return this.number == other.number; } + toDOM() { return document.createTextNode(this.number); } +} +function formatNumber(view, number) { + return view.state.facet(lineNumberConfig).formatNumber(number, view.state); +} +const lineNumberGutter = /*@__PURE__*/activeGutters.compute([lineNumberConfig], state => ({ + class: "cm-lineNumbers", + renderEmptyElements: false, + markers(view) { return view.state.facet(lineNumberMarkers); }, + lineMarker(view, line, others) { + if (others.some(m => m.toDOM)) + return null; + return new NumberMarker(formatNumber(view, view.state.doc.lineAt(line.from).number)); + }, + lineMarkerChange: update => update.startState.facet(lineNumberConfig) != update.state.facet(lineNumberConfig), + initialSpacer(view) { + return new NumberMarker(formatNumber(view, maxLineNumber(view.state.doc.lines))); + }, + updateSpacer(spacer, update) { + let max = formatNumber(update.view, maxLineNumber(update.view.state.doc.lines)); + return max == spacer.number ? spacer : new NumberMarker(max); + }, + domEventHandlers: state.facet(lineNumberConfig).domEventHandlers +})); +/** +Create a line number gutter extension. +*/ +function lineNumbers(config = {}) { + return [ + lineNumberConfig.of(config), + gutters(), + lineNumberGutter + ]; +} +function maxLineNumber(lines) { + let last = 9; + while (last < lines) + last = last * 10 + 9; + return last; +} +const activeLineGutterMarker = /*@__PURE__*/new class extends GutterMarker { + constructor() { + super(...arguments); + this.elementClass = "cm-activeLineGutter"; + } +}; +const activeLineGutterHighlighter = /*@__PURE__*/gutterLineClass.compute(["selection"], state => { + let marks = [], last = -1; + for (let range of state.selection.ranges) + if (range.empty) { + let linePos = state.doc.lineAt(range.head).from; + if (linePos > last) { + last = linePos; + marks.push(activeLineGutterMarker.range(linePos)); + } + } + return RangeSet.of(marks); +}); +/** +Returns an extension that adds a `cm-activeLineGutter` class to +all gutter elements on the [active +line](https://codemirror.net/6/docs/ref/#view.highlightActiveLine). +*/ +function highlightActiveLineGutter() { + return activeLineGutterHighlighter; +} + +/** +@internal +*/ +const __test = { HeightMap, HeightOracle, MeasuredHeights, QueryType, ChangedRange, computeOrder, moveVisually }; + +export { BidiSpan, BlockInfo, BlockType, Decoration, Direction, EditorView, GutterMarker, MatchDecorator, ViewPlugin, ViewUpdate, WidgetType, __test, closeHoverTooltips, crosshairCursor, drawSelection, dropCursor, getPanel, getTooltip, gutter, gutterLineClass, gutters, hasHoverTooltips, highlightActiveLine, highlightActiveLineGutter, highlightSpecialChars, hoverTooltip, keymap, lineNumberMarkers, lineNumbers, logException, panels, placeholder, rectangularSelection, repositionTooltips, runScopeHandlers, scrollPastEnd, showPanel, showTooltip, tooltips }; diff --git a/node_modules/@codemirror/view/package.json b/node_modules/@codemirror/view/package.json new file mode 100644 index 0000000000..0ba91d2120 --- /dev/null +++ b/node_modules/@codemirror/view/package.json @@ -0,0 +1,40 @@ +{ + "name": "@codemirror/view", + "version": "6.0.0", + "description": "DOM view component for the CodeMirror code editor", + "scripts": { + "test": "cm-runtests", + "prepare": "cm-buildhelper src/index.ts" + }, + "keywords": [ + "editor", + "code" + ], + "author": { + "name": "Marijn Haverbeke", + "email": "marijnh@gmail.com", + "url": "http://marijnhaverbeke.nl" + }, + "type": "module", + "main": "dist/index.cjs", + "exports": { + "import": "./dist/index.js", + "require": "./dist/index.cjs" + }, + "types": "dist/index.d.ts", + "module": "dist/index.js", + "sideEffects": false, + "license": "MIT", + "dependencies": { + "@codemirror/state": "^6.0.0", + "style-mod": "^4.0.0", + "w3c-keyname": "^2.2.4" + }, + "devDependencies": { + "@codemirror/buildhelper": "^0.1.6" + }, + "repository": { + "type": "git", + "url": "https://github.com/codemirror/view.git" + } +} diff --git a/node_modules/@lezer/common/LICENSE b/node_modules/@lezer/common/LICENSE new file mode 100644 index 0000000000..30a86e3d1e --- /dev/null +++ b/node_modules/@lezer/common/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (C) 2018 by Marijn Haverbeke and others + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/node_modules/@lezer/common/README.md b/node_modules/@lezer/common/README.md new file mode 100644 index 0000000000..aecc3a6596 --- /dev/null +++ b/node_modules/@lezer/common/README.md @@ -0,0 +1,14 @@ +# @lezer/common + +[ [**WEBSITE**](http://lezer.codemirror.net) | [**ISSUES**](https://github.com/lezer-parser/lezer/issues) | [**FORUM**](https://discuss.codemirror.net/c/lezer) | [**CHANGELOG**](https://github.com/lezer-parser/common/blob/master/CHANGELOG.md) ] + +[Lezer](https://lezer.codemirror.net/) is an incremental parser system +intended for use in an editor or similar system. + +@lezer/common provides the syntax tree data structure and parser +abstractions for Lezer parsers. + +Its programming interface is documented on [the +website](https://lezer.codemirror.net/docs/ref/#common). + +This code is licensed under an MIT license. diff --git a/node_modules/@lezer/common/dist/index.cjs b/node_modules/@lezer/common/dist/index.cjs new file mode 100644 index 0000000000..2c9c0338de --- /dev/null +++ b/node_modules/@lezer/common/dist/index.cjs @@ -0,0 +1,1830 @@ +'use strict'; + +Object.defineProperty(exports, '__esModule', { value: true }); + +// FIXME profile adding a per-Tree TreeNode cache, validating it by +// parent pointer +/// 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 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(" ") }); +/// 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; + } +} +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 /* Top */ : 0) | (spec.skipped ? 2 /* Skipped */ : 0) | + (spec.error ? 4 /* Error */ : 0) | (spec.name == null ? 8 /* 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 /* Top */) > 0; } + /// True when this node is produced by a skip rule. + get isSkipped() { return (this.flags & 2 /* Skipped */) > 0; } + /// Indicates whether this is an error node. + get isError() { return (this.flags & 4 /* 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 /* 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 /* 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); + newProps[add[0].id] = add[1]; + } + } + 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. +exports.IterMode = void 0; +(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"; +})(exports.IterMode || (exports.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 = this.prop(NodeProp.mounted); + 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. + 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; + } + /// 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; + for (let c = this.cursor((spec.mode || 0) | exports.IterMode.IncludeAnonymous);;) { + let entered = false; + if (c.from <= to && c.to >= from && (c.type.isAnonymous || enter(c) !== false)) { + if (c.firstChild()) + continue; + entered = true; + } + for (;;) { + if (entered && leave && !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 /* 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, to) { + let b = this.buffer; + let copy = new Uint16Array(endI - startI); + for (let i = startI, j = 0; i < endI;) { + copy[j++] = b[i++]; + copy[j++] = b[i++] - from; + copy[j++] = b[i++] - from; + copy[j++] = b[i++] - startI; + } + return new TreeBuffer(copy, to - from, this.set); + } +} +function checkSide(side, pos, from, to) { + switch (side) { + case -2 /* Before */: return from < pos; + case -1 /* AtOrBefore */: return to >= pos && from < pos; + case 0 /* Around */: return from < pos && to > pos; + case 1 /* AtOrAfter */: return from <= pos && to > pos; + case 2 /* After */: return to > pos; + case 4 /* DontCare */: return true; + } +} +function enterUnfinishedNodesBefore(node, pos) { + let scan = node.childBefore(pos); + 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; +} +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 : exports.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 TreeNode { + constructor(_tree, from, + // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay) + index, _parent) { + 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 & exports.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 & exports.IterMode.IncludeAnonymous) || (!next.type.isAnonymous || hasChild(next))) { + let mounted; + if (!(mode & exports.IterMode.IgnoreMounts) && + next.props && (mounted = next.prop(NodeProp.mounted)) && !mounted.overlay) + return new TreeNode(mounted.tree, start, i, parent); + let inner = new TreeNode(next, start, i, parent); + return (mode & exports.IterMode.IncludeAnonymous) || !inner.type.isAnonymous ? inner + : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side); + } + } + if ((mode & exports.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 /* DontCare */); } + get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* DontCare */); } + childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* After */); } + childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Before */); } + enter(pos, side, mode = 0) { + let mounted; + if (!(mode & exports.IterMode.IgnoreOverlays) && (mounted = this._tree.prop(NodeProp.mounted)) && 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 /* DontCare */) : null; + } + get prevSibling() { + return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* DontCare */) : null; + } + cursor(mode = 0) { return new TreeCursor(this, mode); } + get tree() { return this._tree; } + toTree() { return this._tree; } + resolve(pos, side = 0) { + return resolveNode(this, pos, side, false); + } + resolveInner(pos, side = 0) { + return resolveNode(this, pos, side, true); + } + enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); } + 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); + } + /// @internal + toString() { return this._tree.toString(); } + get node() { return this; } + matchContext(context) { return matchNodeContext(this, context); } +} +function getChildren(node, type, before, after) { + let cur = node.cursor(), result = []; + if (!cur.firstChild()) + return result; + if (before != null) + while (!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.parent; 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 { + constructor(context, _parent, index) { + this.context = context; + this._parent = _parent; + this.index = index; + this.type = context.buffer.set.types[context.buffer.buffer[index]]; + } + 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]; } + 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 /* DontCare */); } + get lastChild() { return this.child(-1, 0, 4 /* DontCare */); } + childAfter(pos) { return this.child(1, pos, 2 /* After */); } + childBefore(pos) { return this.child(-1, pos, -2 /* Before */); } + enter(pos, side, mode = 0) { + if (mode & exports.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 /* 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 /* DontCare */)); + } + cursor(mode = 0) { return new TreeCursor(this, mode); } + 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], to = buffer.buffer[this.index + 2]; + children.push(buffer.slice(startI, endI, from, to)); + positions.push(0); + } + return new Tree(this.type, children, positions, this.to - this.from); + } + resolve(pos, side = 0) { + return resolveNode(this, pos, side, false); + } + resolveInner(pos, side = 0) { + return resolveNode(this, pos, side, true); + } + enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); } + /// @internal + toString() { return this.context.buffer.childString(this.index); } + 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); + } + get node() { return this; } + matchContext(context) { return matchNodeContext(this, context); } +} +/// A tree cursor object focuses on a given node in a syntax tree, and +/// allows you to move to adjacent nodes. +class TreeCursor { + /// @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); + } + } + /// Shorthand for `.type.name`. + get name() { return this.type.name; } + 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; + } + 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 /* DontCare */); } + /// Move the cursor to this node's last child. + lastChild() { return this.enterChild(-1, 0, 4 /* DontCare */); } + /// Move the cursor to the first child that ends after `pos`. + childAfter(pos) { return this.enterChild(1, pos, 2 /* After */); } + /// Move to the last child that starts before `pos`. + childBefore(pos) { return this.enterChild(-1, pos, -2 /* 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 & exports.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 & exports.IterMode.IncludeAnonymous) ? this._tree._parent : this._tree.parent); + if (this.stack.length) + return this.yieldBuf(this.stack.pop()); + let parent = (this.mode & exports.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 /* 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 /* 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 /* 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 & exports.IterMode.IncludeAnonymous) || + child instanceof TreeBuffer || + !child.type.isAnonymous || + hasChild(child)) + return false; + } + } + return true; + } + move(dir, enter) { + if (enter && this.enterChild(dir, 0, 4 /* 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 traveral. 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 (this.nextSibling()) + break; + if (!depth) + return; + 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, 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.node, 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) { + let { id, start, end, size } = cursor; + let lookAheadAtStart = lookAhead; + while (size < 0) { + cursor.next(); + if (size == -1 /* Reuse */) { + let node = reused[id]; + children.push(node); + positions.push(start - parentStart); + return; + } + else if (size == -3 /* ContextChange */) { // Context change + contextHash = id; + return; + } + else if (size == -4 /* 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); + lastGroup = localChildren.length; + lastEnd = cursor.end; + } + cursor.next(); + } + else { + takeNode(start, endPos, localChildren, localPositions, localInRepeat); + } + } + if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length) + makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart); + localChildren.reverse(); + localPositions.reverse(); + if (localInRepeat > -1 && lastGroup > 0) { + let make = makeBalanced(type); + node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make); + } + else { + node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end); + } + } + children.push(node); + positions.push(startPos); + } + function makeBalanced(type) { + 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); + }; + } + function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead) { + 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)); + positions.push(from - base); + } + function makeTree(type, children, positions, length, lookAhead = 0, 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 /* ContextChange */) + 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 /* ContextChange */) { + contextHash = id; + } + else if (size == -4 /* LookAhead */) { + lookAhead = id; + } + return index; + } + let children = [], positions = []; + while (cursor.pos > 0) + takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1); + 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 /* 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 /* Start */ : 0) | (openEnd ? 2 /* 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 /* 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 /* 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, ranges) { + this.parser = parser; + this.parse = parse; + this.overlay = overlay; + this.target = target; + this.ranges = 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].ranges[0].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), exports.IterMode.IncludeAnonymous | exports.IterMode.IgnoreMounts); + scan: for (let nest, isCovered; this.stoppedAt == null || cursor.from < this.stoppedAt;) { + let enter = true, range; + 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 /* Full */; + } + else if (!cursor.type.isAnonymous && cursor.from < cursor.to && (nest = this.nest(cursor, this.input))) { + if (!cursor.tree) + materialize(cursor); + 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 || [new Range(cursor.from, cursor.to)]); + if (ranges.length) + this.inner.push(new InnerParse(nest.parser, nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges)); + 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) + 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) + 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)); + 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 /* Full */ : 1 /* Partial */; + } + return 0 /* 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], to = buf.buffer[endI - 2]; + nodes.push(buf.slice(startI, endI, from, to)); + 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, depth = 0; + // Scan up to the nearest tree + do { + cursor.parent(); + depth++; + } while (!cursor.tree); + // Find the index of the buffer in that tree + let i = 0, base = cursor.tree, off = 0; + for (;; i++) { + off = base.positions[i] + cursor.from; + if (off <= node.from && off + base.children[i].length >= node.to) + break; + } + let buf = base.children[i], b = buf.buffer; + // 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) { + let i = startI; + while (b[i + 2] + off <= node.from) + i = b[i + 3]; + let children = [], positions = []; + sliceBuf(buf, startI, i, children, positions, innerOffset); + let from = b[i + 1], to = b[i + 2]; + let isTarget = from + off == node.from && to + off == node.to && b[i] == node.type.id; + children.push(isTarget ? node.toTree() : split(i + 4, b[i + 3], buf.set.types[b[i]], from, to - from)); + positions.push(from - innerOffset); + sliceBuf(buf, b[i + 3], endI, children, positions, innerOffset); + return new Tree(type, children, positions, length); + } + base.children[i] = split(0, b.length, NodeType.none, 0, buf.length); + // Move the cursor back to the target node + for (let d = 0; d <= depth; d++) + cursor.childAfter(node.from); +} +class StructureCursor { + constructor(root, offset) { + this.offset = offset; + this.done = false; + this.cursor = root.cursor(exports.IterMode.IncludeAnonymous | exports.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, exports.IterMode.IgnoreOverlays | exports.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.to <= end)); + if (last) + break; + pos = changes[i].to; + } + } + else { + result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos, frag.to <= endPos)); + } + } + return result; +} + +exports.DefaultBufferLength = DefaultBufferLength; +exports.MountedTree = MountedTree; +exports.NodeProp = NodeProp; +exports.NodeSet = NodeSet; +exports.NodeType = NodeType; +exports.NodeWeakMap = NodeWeakMap; +exports.Parser = Parser; +exports.Tree = Tree; +exports.TreeBuffer = TreeBuffer; +exports.TreeCursor = TreeCursor; +exports.TreeFragment = TreeFragment; +exports.parseMixed = parseMixed; diff --git a/node_modules/@lezer/common/dist/index.d.ts b/node_modules/@lezer/common/dist/index.d.ts new file mode 100644 index 0000000000..ae487f9ddb --- /dev/null +++ b/node_modules/@lezer/common/dist/index.d.ts @@ -0,0 +1,3 @@ +export { DefaultBufferLength, NodeProp, MountedTree, NodePropSource, NodeType, NodeSet, Tree, TreeBuffer, SyntaxNode, SyntaxNodeRef, TreeCursor, BufferCursor, NodeWeakMap, IterMode } from "./tree"; +export { ChangedRange, TreeFragment, PartialParse, Parser, Input, ParseWrapper } from "./parse"; +export { NestedParse, parseMixed } from "./mix"; diff --git a/node_modules/@lezer/common/dist/index.es.js b/node_modules/@lezer/common/dist/index.es.js new file mode 100644 index 0000000000..c817453544 --- /dev/null +++ b/node_modules/@lezer/common/dist/index.es.js @@ -0,0 +1,1816 @@ +// FIXME profile adding a per-Tree TreeNode cache, validating it by +// parent pointer +/// The default maximum length of a `TreeBuffer` node (1024). +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 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(" ") }); +/// 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. +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; + } +} +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; + } + static define(spec) { + let props = spec.props && spec.props.length ? Object.create(null) : noProps; + let flags = (spec.top ? 1 /* Top */ : 0) | (spec.skipped ? 2 /* Skipped */ : 0) | + (spec.error ? 4 /* Error */ : 0) | (spec.name == null ? 8 /* 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 /* Top */) > 0; } + /// True when this node is produced by a skip rule. + get isSkipped() { return (this.flags & 2 /* Skipped */) > 0; } + /// Indicates whether this is an error node. + get isError() { return (this.flags & 4 /* 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 /* 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 /* 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 should 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); + newProps[add[0].id] = add[1]; + } + } + 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 = this.prop(NodeProp.mounted); + 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. + 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; + } + /// 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; + for (let c = this.cursor((spec.mode || 0) | IterMode.IncludeAnonymous);;) { + let entered = false; + if (c.from <= to && c.to >= from && (c.type.isAnonymous || enter(c) !== false)) { + if (c.firstChild()) + continue; + entered = true; + } + for (;;) { + if (entered && leave && !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 /* 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, to) { + let b = this.buffer; + let copy = new Uint16Array(endI - startI); + for (let i = startI, j = 0; i < endI;) { + copy[j++] = b[i++]; + copy[j++] = b[i++] - from; + copy[j++] = b[i++] - from; + copy[j++] = b[i++] - startI; + } + return new TreeBuffer(copy, to - from, this.set); + } +} +function checkSide(side, pos, from, to) { + switch (side) { + case -2 /* Before */: return from < pos; + case -1 /* AtOrBefore */: return to >= pos && from < pos; + case 0 /* Around */: return from < pos && to > pos; + case 1 /* AtOrAfter */: return from <= pos && to > pos; + case 2 /* After */: return to > pos; + case 4 /* DontCare */: return true; + } +} +function enterUnfinishedNodesBefore(node, pos) { + let scan = node.childBefore(pos); + 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; +} +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 TreeNode { + constructor(_tree, from, + // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay) + index, _parent) { + 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) && + next.props && (mounted = next.prop(NodeProp.mounted)) && !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 /* DontCare */); } + get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* DontCare */); } + childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* After */); } + childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Before */); } + enter(pos, side, mode = 0) { + let mounted; + if (!(mode & IterMode.IgnoreOverlays) && (mounted = this._tree.prop(NodeProp.mounted)) && 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 /* DontCare */) : null; + } + get prevSibling() { + return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* DontCare */) : null; + } + cursor(mode = 0) { return new TreeCursor(this, mode); } + get tree() { return this._tree; } + toTree() { return this._tree; } + resolve(pos, side = 0) { + return resolveNode(this, pos, side, false); + } + resolveInner(pos, side = 0) { + return resolveNode(this, pos, side, true); + } + enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); } + 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); + } + /// @internal + toString() { return this._tree.toString(); } + get node() { return this; } + matchContext(context) { return matchNodeContext(this, context); } +} +function getChildren(node, type, before, after) { + let cur = node.cursor(), result = []; + if (!cur.firstChild()) + return result; + if (before != null) + while (!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.parent; 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 { + constructor(context, _parent, index) { + this.context = context; + this._parent = _parent; + this.index = index; + this.type = context.buffer.set.types[context.buffer.buffer[index]]; + } + 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]; } + 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 /* DontCare */); } + get lastChild() { return this.child(-1, 0, 4 /* DontCare */); } + childAfter(pos) { return this.child(1, pos, 2 /* After */); } + childBefore(pos) { return this.child(-1, pos, -2 /* Before */); } + 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 /* 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 /* DontCare */)); + } + cursor(mode = 0) { return new TreeCursor(this, mode); } + 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], to = buffer.buffer[this.index + 2]; + children.push(buffer.slice(startI, endI, from, to)); + positions.push(0); + } + return new Tree(this.type, children, positions, this.to - this.from); + } + resolve(pos, side = 0) { + return resolveNode(this, pos, side, false); + } + resolveInner(pos, side = 0) { + return resolveNode(this, pos, side, true); + } + enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); } + /// @internal + toString() { return this.context.buffer.childString(this.index); } + 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); + } + get node() { return this; } + matchContext(context) { return matchNodeContext(this, context); } +} +/// A tree cursor object focuses on a given node in a syntax tree, and +/// allows you to move to adjacent nodes. +class TreeCursor { + /// @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); + } + } + /// Shorthand for `.type.name`. + get name() { return this.type.name; } + 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; + } + 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 /* DontCare */); } + /// Move the cursor to this node's last child. + lastChild() { return this.enterChild(-1, 0, 4 /* DontCare */); } + /// Move the cursor to the first child that ends after `pos`. + childAfter(pos) { return this.enterChild(1, pos, 2 /* After */); } + /// Move to the last child that starts before `pos`. + childBefore(pos) { return this.enterChild(-1, pos, -2 /* 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 /* 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 /* 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 /* 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 /* 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 traveral. 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 (this.nextSibling()) + break; + if (!depth) + return; + 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, 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.node, 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) { + let { id, start, end, size } = cursor; + let lookAheadAtStart = lookAhead; + while (size < 0) { + cursor.next(); + if (size == -1 /* Reuse */) { + let node = reused[id]; + children.push(node); + positions.push(start - parentStart); + return; + } + else if (size == -3 /* ContextChange */) { // Context change + contextHash = id; + return; + } + else if (size == -4 /* 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); + lastGroup = localChildren.length; + lastEnd = cursor.end; + } + cursor.next(); + } + else { + takeNode(start, endPos, localChildren, localPositions, localInRepeat); + } + } + if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length) + makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart); + localChildren.reverse(); + localPositions.reverse(); + if (localInRepeat > -1 && lastGroup > 0) { + let make = makeBalanced(type); + node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make); + } + else { + node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end); + } + } + children.push(node); + positions.push(startPos); + } + function makeBalanced(type) { + 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); + }; + } + function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead) { + 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)); + positions.push(from - base); + } + function makeTree(type, children, positions, length, lookAhead = 0, 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 /* ContextChange */) + 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 /* ContextChange */) { + contextHash = id; + } + else if (size == -4 /* LookAhead */) { + lookAhead = id; + } + return index; + } + let children = [], positions = []; + while (cursor.pos > 0) + takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1); + 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 /* 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. + 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 /* Start */ : 0) | (openEnd ? 2 /* 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 /* 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 /* 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. +/// +/// The nesting function is passed a cursor to provide context for a +/// node, but _should not_ move that cursor, only inspect its +/// properties and optionally access its +/// [node object](#common.TreeCursor.node). +function parseMixed(nest) { + return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges); +} +class InnerParse { + constructor(parser, parse, overlay, target, ranges) { + this.parser = parser; + this.parse = parse; + this.overlay = overlay; + this.target = target; + this.ranges = 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].ranges[0].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; this.stoppedAt == null || cursor.from < this.stoppedAt;) { + let enter = true, range; + 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 /* Full */; + } + else if (!cursor.type.isAnonymous && cursor.from < cursor.to && (nest = this.nest(cursor, this.input))) { + if (!cursor.tree) + materialize(cursor); + 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 || [new Range(cursor.from, cursor.to)]); + if (ranges.length) + this.inner.push(new InnerParse(nest.parser, nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges)); + 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) + 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) + 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)); + 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 /* Full */ : 1 /* Partial */; + } + return 0 /* 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], to = buf.buffer[endI - 2]; + nodes.push(buf.slice(startI, endI, from, to)); + 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, depth = 0; + // Scan up to the nearest tree + do { + cursor.parent(); + depth++; + } while (!cursor.tree); + // Find the index of the buffer in that tree + let i = 0, base = cursor.tree, off = 0; + for (;; i++) { + off = base.positions[i] + cursor.from; + if (off <= node.from && off + base.children[i].length >= node.to) + break; + } + let buf = base.children[i], b = buf.buffer; + // 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) { + let i = startI; + while (b[i + 2] + off <= node.from) + i = b[i + 3]; + let children = [], positions = []; + sliceBuf(buf, startI, i, children, positions, innerOffset); + let from = b[i + 1], to = b[i + 2]; + let isTarget = from + off == node.from && to + off == node.to && b[i] == node.type.id; + children.push(isTarget ? node.toTree() : split(i + 4, b[i + 3], buf.set.types[b[i]], from, to - from)); + positions.push(from - innerOffset); + sliceBuf(buf, b[i + 3], endI, children, positions, innerOffset); + return new Tree(type, children, positions, length); + } + base.children[i] = split(0, b.length, NodeType.none, 0, buf.length); + // Move the cursor back to the target node + for (let d = 0; d <= depth; d++) + cursor.childAfter(node.from); +} +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.to <= end)); + if (last) + break; + pos = changes[i].to; + } + } + else { + result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos, frag.to <= endPos)); + } + } + return result; +} + +export { DefaultBufferLength, IterMode, MountedTree, NodeProp, NodeSet, NodeType, NodeWeakMap, Parser, Tree, TreeBuffer, TreeCursor, TreeFragment, parseMixed }; diff --git a/node_modules/@lezer/common/dist/index.js b/node_modules/@lezer/common/dist/index.js new file mode 100644 index 0000000000..ec12f7b8b5 --- /dev/null +++ b/node_modules/@lezer/common/dist/index.js @@ -0,0 +1,1815 @@ +// FIXME profile adding a per-Tree TreeNode cache, validating it by +// parent pointer +/// 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 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(" ") }); +/// 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; + } +} +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 /* Top */ : 0) | (spec.skipped ? 2 /* Skipped */ : 0) | + (spec.error ? 4 /* Error */ : 0) | (spec.name == null ? 8 /* 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 /* Top */) > 0; } + /// True when this node is produced by a skip rule. + get isSkipped() { return (this.flags & 2 /* Skipped */) > 0; } + /// Indicates whether this is an error node. + get isError() { return (this.flags & 4 /* 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 /* 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 /* 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); + newProps[add[0].id] = add[1]; + } + } + 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 = this.prop(NodeProp.mounted); + 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. + 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; + } + /// 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; + for (let c = this.cursor((spec.mode || 0) | IterMode.IncludeAnonymous);;) { + let entered = false; + if (c.from <= to && c.to >= from && (c.type.isAnonymous || enter(c) !== false)) { + if (c.firstChild()) + continue; + entered = true; + } + for (;;) { + if (entered && leave && !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 /* 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, to) { + let b = this.buffer; + let copy = new Uint16Array(endI - startI); + for (let i = startI, j = 0; i < endI;) { + copy[j++] = b[i++]; + copy[j++] = b[i++] - from; + copy[j++] = b[i++] - from; + copy[j++] = b[i++] - startI; + } + return new TreeBuffer(copy, to - from, this.set); + } +} +function checkSide(side, pos, from, to) { + switch (side) { + case -2 /* Before */: return from < pos; + case -1 /* AtOrBefore */: return to >= pos && from < pos; + case 0 /* Around */: return from < pos && to > pos; + case 1 /* AtOrAfter */: return from <= pos && to > pos; + case 2 /* After */: return to > pos; + case 4 /* DontCare */: return true; + } +} +function enterUnfinishedNodesBefore(node, pos) { + let scan = node.childBefore(pos); + 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; +} +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 TreeNode { + constructor(_tree, from, + // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay) + index, _parent) { + 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) && + next.props && (mounted = next.prop(NodeProp.mounted)) && !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 /* DontCare */); } + get lastChild() { return this.nextChild(this._tree.children.length - 1, -1, 0, 4 /* DontCare */); } + childAfter(pos) { return this.nextChild(0, 1, pos, 2 /* After */); } + childBefore(pos) { return this.nextChild(this._tree.children.length - 1, -1, pos, -2 /* Before */); } + enter(pos, side, mode = 0) { + let mounted; + if (!(mode & IterMode.IgnoreOverlays) && (mounted = this._tree.prop(NodeProp.mounted)) && 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 /* DontCare */) : null; + } + get prevSibling() { + return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4 /* DontCare */) : null; + } + cursor(mode = 0) { return new TreeCursor(this, mode); } + get tree() { return this._tree; } + toTree() { return this._tree; } + resolve(pos, side = 0) { + return resolveNode(this, pos, side, false); + } + resolveInner(pos, side = 0) { + return resolveNode(this, pos, side, true); + } + enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); } + 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); + } + /// @internal + toString() { return this._tree.toString(); } + get node() { return this; } + matchContext(context) { return matchNodeContext(this, context); } +} +function getChildren(node, type, before, after) { + let cur = node.cursor(), result = []; + if (!cur.firstChild()) + return result; + if (before != null) + while (!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.parent; 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 { + constructor(context, _parent, index) { + this.context = context; + this._parent = _parent; + this.index = index; + this.type = context.buffer.set.types[context.buffer.buffer[index]]; + } + 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]; } + 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 /* DontCare */); } + get lastChild() { return this.child(-1, 0, 4 /* DontCare */); } + childAfter(pos) { return this.child(1, pos, 2 /* After */); } + childBefore(pos) { return this.child(-1, pos, -2 /* Before */); } + 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 /* 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 /* DontCare */)); + } + cursor(mode = 0) { return new TreeCursor(this, mode); } + 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], to = buffer.buffer[this.index + 2]; + children.push(buffer.slice(startI, endI, from, to)); + positions.push(0); + } + return new Tree(this.type, children, positions, this.to - this.from); + } + resolve(pos, side = 0) { + return resolveNode(this, pos, side, false); + } + resolveInner(pos, side = 0) { + return resolveNode(this, pos, side, true); + } + enterUnfinishedNodesBefore(pos) { return enterUnfinishedNodesBefore(this, pos); } + /// @internal + toString() { return this.context.buffer.childString(this.index); } + 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); + } + get node() { return this; } + matchContext(context) { return matchNodeContext(this, context); } +} +/// A tree cursor object focuses on a given node in a syntax tree, and +/// allows you to move to adjacent nodes. +class TreeCursor { + /// @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); + } + } + /// Shorthand for `.type.name`. + get name() { return this.type.name; } + 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; + } + 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 /* DontCare */); } + /// Move the cursor to this node's last child. + lastChild() { return this.enterChild(-1, 0, 4 /* DontCare */); } + /// Move the cursor to the first child that ends after `pos`. + childAfter(pos) { return this.enterChild(1, pos, 2 /* After */); } + /// Move to the last child that starts before `pos`. + childBefore(pos) { return this.enterChild(-1, pos, -2 /* 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 /* 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 /* 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 /* 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 /* 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 traveral. 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 (this.nextSibling()) + break; + if (!depth) + return; + 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, 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.node, 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) { + let { id, start, end, size } = cursor; + let lookAheadAtStart = lookAhead; + while (size < 0) { + cursor.next(); + if (size == -1 /* Reuse */) { + let node = reused[id]; + children.push(node); + positions.push(start - parentStart); + return; + } + else if (size == -3 /* ContextChange */) { // Context change + contextHash = id; + return; + } + else if (size == -4 /* 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); + lastGroup = localChildren.length; + lastEnd = cursor.end; + } + cursor.next(); + } + else { + takeNode(start, endPos, localChildren, localPositions, localInRepeat); + } + } + if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length) + makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart); + localChildren.reverse(); + localPositions.reverse(); + if (localInRepeat > -1 && lastGroup > 0) { + let make = makeBalanced(type); + node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make); + } + else { + node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end); + } + } + children.push(node); + positions.push(startPos); + } + function makeBalanced(type) { + 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); + }; + } + function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead) { + 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)); + positions.push(from - base); + } + function makeTree(type, children, positions, length, lookAhead = 0, 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 /* ContextChange */) + 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 /* ContextChange */) { + contextHash = id; + } + else if (size == -4 /* LookAhead */) { + lookAhead = id; + } + return index; + } + let children = [], positions = []; + while (cursor.pos > 0) + takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1); + 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 /* 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 /* Start */ : 0) | (openEnd ? 2 /* 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 /* 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 /* 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, ranges) { + this.parser = parser; + this.parse = parse; + this.overlay = overlay; + this.target = target; + this.ranges = 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].ranges[0].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; this.stoppedAt == null || cursor.from < this.stoppedAt;) { + let enter = true, range; + 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 /* Full */; + } + else if (!cursor.type.isAnonymous && cursor.from < cursor.to && (nest = this.nest(cursor, this.input))) { + if (!cursor.tree) + materialize(cursor); + 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 || [new Range(cursor.from, cursor.to)]); + if (ranges.length) + this.inner.push(new InnerParse(nest.parser, nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges)); + 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) + 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) + 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)); + 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 /* Full */ : 1 /* Partial */; + } + return 0 /* 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], to = buf.buffer[endI - 2]; + nodes.push(buf.slice(startI, endI, from, to)); + 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, depth = 0; + // Scan up to the nearest tree + do { + cursor.parent(); + depth++; + } while (!cursor.tree); + // Find the index of the buffer in that tree + let i = 0, base = cursor.tree, off = 0; + for (;; i++) { + off = base.positions[i] + cursor.from; + if (off <= node.from && off + base.children[i].length >= node.to) + break; + } + let buf = base.children[i], b = buf.buffer; + // 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) { + let i = startI; + while (b[i + 2] + off <= node.from) + i = b[i + 3]; + let children = [], positions = []; + sliceBuf(buf, startI, i, children, positions, innerOffset); + let from = b[i + 1], to = b[i + 2]; + let isTarget = from + off == node.from && to + off == node.to && b[i] == node.type.id; + children.push(isTarget ? node.toTree() : split(i + 4, b[i + 3], buf.set.types[b[i]], from, to - from)); + positions.push(from - innerOffset); + sliceBuf(buf, b[i + 3], endI, children, positions, innerOffset); + return new Tree(type, children, positions, length); + } + base.children[i] = split(0, b.length, NodeType.none, 0, buf.length); + // Move the cursor back to the target node + for (let d = 0; d <= depth; d++) + cursor.childAfter(node.from); +} +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.to <= end)); + if (last) + break; + pos = changes[i].to; + } + } + else { + result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos, frag.to <= endPos)); + } + } + return result; +} + +export { DefaultBufferLength, IterMode, MountedTree, NodeProp, NodeSet, NodeType, NodeWeakMap, Parser, Tree, TreeBuffer, TreeCursor, TreeFragment, parseMixed }; diff --git a/node_modules/@lezer/common/dist/mix.d.ts b/node_modules/@lezer/common/dist/mix.d.ts new file mode 100644 index 0000000000..fe9bb01b24 --- /dev/null +++ b/node_modules/@lezer/common/dist/mix.d.ts @@ -0,0 +1,13 @@ +import { SyntaxNodeRef } from "./tree"; +import { Input, Parser, ParseWrapper } from "./parse"; +export interface NestedParse { + parser: Parser; + overlay?: readonly { + from: number; + to: number; + }[] | ((node: SyntaxNodeRef) => { + from: number; + to: number; + } | boolean); +} +export declare function parseMixed(nest: (node: SyntaxNodeRef, input: Input) => NestedParse | null): ParseWrapper; diff --git a/node_modules/@lezer/common/dist/parse.d.ts b/node_modules/@lezer/common/dist/parse.d.ts new file mode 100644 index 0000000000..3bdbc67399 --- /dev/null +++ b/node_modules/@lezer/common/dist/parse.d.ts @@ -0,0 +1,48 @@ +import { Tree } from "./tree"; +export interface ChangedRange { + fromA: number; + toA: number; + fromB: number; + toB: number; +} +export declare class TreeFragment { + readonly from: number; + readonly to: number; + readonly tree: Tree; + readonly offset: number; + constructor(from: number, to: number, tree: Tree, offset: number, openStart?: boolean, openEnd?: boolean); + get openStart(): boolean; + get openEnd(): boolean; + static addTree(tree: Tree, fragments?: readonly TreeFragment[], partial?: boolean): TreeFragment[]; + static applyChanges(fragments: readonly TreeFragment[], changes: readonly ChangedRange[], minGap?: number): readonly TreeFragment[]; +} +export interface PartialParse { + advance(): Tree | null; + readonly parsedPos: number; + stopAt(pos: number): void; + readonly stoppedAt: number | null; +} +export declare abstract class Parser { + abstract createParse(input: Input, fragments: readonly TreeFragment[], ranges: readonly { + from: number; + to: number; + }[]): PartialParse; + startParse(input: Input | string, fragments?: readonly TreeFragment[], ranges?: readonly { + from: number; + to: number; + }[]): PartialParse; + parse(input: Input | string, fragments?: readonly TreeFragment[], ranges?: readonly { + from: number; + to: number; + }[]): Tree; +} +export interface Input { + readonly length: number; + chunk(from: number): string; + readonly lineChunks: boolean; + read(from: number, to: number): string; +} +export declare type ParseWrapper = (inner: PartialParse, input: Input, fragments: readonly TreeFragment[], ranges: readonly { + from: number; + to: number; +}[]) => PartialParse; diff --git a/node_modules/@lezer/common/dist/tree.d.ts b/node_modules/@lezer/common/dist/tree.d.ts new file mode 100644 index 0000000000..57113e3105 --- /dev/null +++ b/node_modules/@lezer/common/dist/tree.d.ts @@ -0,0 +1,262 @@ +import { Parser } from "./parse"; +export declare const DefaultBufferLength = 1024; +export declare class Range { + readonly from: number; + readonly to: number; + constructor(from: number, to: number); +} +export declare class NodeProp { + perNode: boolean; + deserialize: (str: string) => T; + constructor(config?: { + deserialize?: (str: string) => T; + perNode?: boolean; + }); + add(match: { + [selector: string]: T; + } | ((type: NodeType) => T | undefined)): NodePropSource; + static closedBy: NodeProp; + static openedBy: NodeProp; + static group: NodeProp; + static contextHash: NodeProp; + static lookAhead: NodeProp; + static mounted: NodeProp; +} +export declare class MountedTree { + readonly tree: Tree; + readonly overlay: readonly { + from: number; + to: number; + }[] | null; + readonly parser: Parser; + constructor(tree: Tree, overlay: readonly { + from: number; + to: number; + }[] | null, parser: Parser); +} +export declare type NodePropSource = (type: NodeType) => null | [NodeProp, any]; +export declare class NodeType { + readonly name: string; + readonly id: number; + static define(spec: { + id: number; + name?: string; + props?: readonly ([NodeProp, any] | NodePropSource)[]; + top?: boolean; + error?: boolean; + skipped?: boolean; + }): NodeType; + prop(prop: NodeProp): T | undefined; + get isTop(): boolean; + get isSkipped(): boolean; + get isError(): boolean; + get isAnonymous(): boolean; + is(name: string | number): boolean; + static none: NodeType; + static match(map: { + [selector: string]: T; + }): (node: NodeType) => T | undefined; +} +export declare class NodeSet { + readonly types: readonly NodeType[]; + constructor(types: readonly NodeType[]); + extend(...props: NodePropSource[]): NodeSet; +} +export declare enum IterMode { + ExcludeBuffers = 1, + IncludeAnonymous = 2, + IgnoreMounts = 4, + IgnoreOverlays = 8 +} +export declare class Tree { + readonly type: NodeType; + readonly children: readonly (Tree | TreeBuffer)[]; + readonly positions: readonly number[]; + readonly length: number; + constructor(type: NodeType, children: readonly (Tree | TreeBuffer)[], positions: readonly number[], length: number, props?: readonly [NodeProp | number, any][]); + static empty: Tree; + cursor(mode?: IterMode): TreeCursor; + cursorAt(pos: number, side?: -1 | 0 | 1, mode?: IterMode): TreeCursor; + get topNode(): SyntaxNode; + resolve(pos: number, side?: -1 | 0 | 1): SyntaxNode; + resolveInner(pos: number, side?: -1 | 0 | 1): SyntaxNode; + iterate(spec: { + enter(node: SyntaxNodeRef): boolean | void; + leave?(node: SyntaxNodeRef): void; + from?: number; + to?: number; + mode?: IterMode; + }): void; + prop(prop: NodeProp): T | undefined; + get propValues(): readonly [NodeProp | number, any][]; + balance(config?: { + makeTree?: (children: readonly (Tree | TreeBuffer)[], positions: readonly number[], length: number) => Tree; + }): Tree; + static build(data: BuildData): Tree; +} +declare type BuildData = { + buffer: BufferCursor | readonly number[]; + nodeSet: NodeSet; + topID: number; + start?: number; + bufferStart?: number; + length?: number; + maxBufferLength?: number; + reused?: readonly Tree[]; + minRepeatType?: number; +}; +export interface BufferCursor { + pos: number; + id: number; + start: number; + end: number; + size: number; + next(): void; + fork(): BufferCursor; +} +export declare class TreeBuffer { + readonly buffer: Uint16Array; + readonly length: number; + readonly set: NodeSet; + constructor(buffer: Uint16Array, length: number, set: NodeSet); +} +export interface SyntaxNodeRef { + readonly from: number; + readonly to: number; + readonly type: NodeType; + readonly name: string; + readonly tree: Tree | null; + readonly node: SyntaxNode; + matchContext(context: readonly string[]): boolean; +} +export interface SyntaxNode extends SyntaxNodeRef { + parent: SyntaxNode | null; + firstChild: SyntaxNode | null; + lastChild: SyntaxNode | null; + childAfter(pos: number): SyntaxNode | null; + childBefore(pos: number): SyntaxNode | null; + enter(pos: number, side: -1 | 0 | 1, mode?: IterMode): SyntaxNode | null; + nextSibling: SyntaxNode | null; + prevSibling: SyntaxNode | null; + cursor(mode?: IterMode): TreeCursor; + resolve(pos: number, side?: -1 | 0 | 1): SyntaxNode; + resolveInner(pos: number, side?: -1 | 0 | 1): SyntaxNode; + enterUnfinishedNodesBefore(pos: number): SyntaxNode; + toTree(): Tree; + getChild(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode | null; + getChildren(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode[]; + matchContext(context: readonly string[]): boolean; +} +declare const enum Side { + Before = -2, + AtOrBefore = -1, + Around = 0, + AtOrAfter = 1, + After = 2, + DontCare = 4 +} +export declare class TreeNode implements SyntaxNode { + readonly _tree: Tree; + readonly from: number; + readonly index: number; + readonly _parent: TreeNode | null; + constructor(_tree: Tree, from: number, index: number, _parent: TreeNode | null); + get type(): NodeType; + get name(): string; + get to(): number; + nextChild(i: number, dir: 1 | -1, pos: number, side: Side, mode?: IterMode): TreeNode | BufferNode | null; + get firstChild(): TreeNode | BufferNode; + get lastChild(): TreeNode | BufferNode; + childAfter(pos: number): TreeNode | BufferNode; + childBefore(pos: number): TreeNode | BufferNode; + enter(pos: number, side: -1 | 0 | 1, mode?: number): TreeNode | BufferNode; + nextSignificantParent(): TreeNode; + get parent(): TreeNode | null; + get nextSibling(): SyntaxNode | null; + get prevSibling(): SyntaxNode | null; + cursor(mode?: IterMode): TreeCursor; + get tree(): Tree; + toTree(): Tree; + resolve(pos: number, side?: -1 | 0 | 1): SyntaxNode; + resolveInner(pos: number, side?: -1 | 0 | 1): SyntaxNode; + enterUnfinishedNodesBefore(pos: number): SyntaxNode; + getChild(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode; + getChildren(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode[]; + get node(): this; + matchContext(context: readonly string[]): boolean; +} +declare class BufferContext { + readonly parent: TreeNode; + readonly buffer: TreeBuffer; + readonly index: number; + readonly start: number; + constructor(parent: TreeNode, buffer: TreeBuffer, index: number, start: number); +} +declare class BufferNode implements SyntaxNode { + readonly context: BufferContext; + readonly _parent: BufferNode | null; + readonly index: number; + type: NodeType; + get name(): string; + get from(): number; + get to(): number; + constructor(context: BufferContext, _parent: BufferNode | null, index: number); + child(dir: 1 | -1, pos: number, side: Side): BufferNode | null; + get firstChild(): BufferNode; + get lastChild(): BufferNode; + childAfter(pos: number): BufferNode; + childBefore(pos: number): BufferNode; + enter(pos: number, side: -1 | 0 | 1, mode?: IterMode): BufferNode; + get parent(): SyntaxNode | null; + externalSibling(dir: 1 | -1): TreeNode | BufferNode; + get nextSibling(): SyntaxNode | null; + get prevSibling(): SyntaxNode | null; + cursor(mode?: IterMode): TreeCursor; + get tree(): any; + toTree(): Tree; + resolve(pos: number, side?: -1 | 0 | 1): SyntaxNode; + resolveInner(pos: number, side?: -1 | 0 | 1): SyntaxNode; + enterUnfinishedNodesBefore(pos: number): SyntaxNode; + getChild(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode; + getChildren(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode[]; + get node(): this; + matchContext(context: readonly string[]): boolean; +} +export declare class TreeCursor implements SyntaxNodeRef { + type: NodeType; + get name(): string; + from: number; + to: number; + private stack; + private bufferNode; + private yieldNode; + private yieldBuf; + private yield; + firstChild(): boolean; + lastChild(): boolean; + childAfter(pos: number): boolean; + childBefore(pos: number): boolean; + enter(pos: number, side: -1 | 0 | 1, mode?: IterMode): boolean; + parent(): boolean; + nextSibling(): boolean; + prevSibling(): boolean; + private atLastNode; + private move; + next(enter?: boolean): boolean; + prev(enter?: boolean): boolean; + moveTo(pos: number, side?: -1 | 0 | 1): this; + get node(): SyntaxNode; + get tree(): Tree | null; + iterate(enter: (node: SyntaxNodeRef) => boolean | void, leave?: (node: SyntaxNodeRef) => void): void; + matchContext(context: readonly string[]): boolean; +} +export declare class NodeWeakMap { + private map; + private setBuffer; + private getBuffer; + set(node: SyntaxNode, value: T): void; + get(node: SyntaxNode): T | undefined; + cursorSet(cursor: TreeCursor, value: T): void; + cursorGet(cursor: TreeCursor): T | undefined; +} +export {}; diff --git a/node_modules/@lezer/common/package.json b/node_modules/@lezer/common/package.json new file mode 100644 index 0000000000..5d1e1886a1 --- /dev/null +++ b/node_modules/@lezer/common/package.json @@ -0,0 +1,36 @@ +{ + "name": "@lezer/common", + "version": "1.0.0", + "description": "Syntax tree data structure and parser interfaces for the lezer parser", + "main": "dist/index.cjs", + "type": "module", + "exports": { + "import": "./dist/index.js", + "require": "./dist/index.cjs" + }, + "module": "dist/index.js", + "types": "dist/index.d.ts", + "author": "Marijn Haverbeke ", + "license": "MIT", + "devDependencies": { + "ist": "^1.1.1", + "rollup": "^2.52.2", + "@rollup/plugin-commonjs": "^15.1.0", + "@rollup/plugin-node-resolve": "^9.0.0", + "rollup-plugin-typescript2": "^0.30.0", + "typescript": "^4.3.4", + "@types/mocha": "^5.2.6", + "ts-node": "^10.0.0", + "mocha": "^9.0.1" + }, + "files": ["dist"], + "repository": { + "type" : "git", + "url" : "https://github.com/lezer-parser/common.git" + }, + "scripts": { + "watch": "rollup -w -c rollup.config.js", + "prepare": "rollup -c rollup.config.js", + "test": "mocha" + } +} diff --git a/node_modules/@lezer/highlight/LICENSE b/node_modules/@lezer/highlight/LICENSE new file mode 100644 index 0000000000..30a86e3d1e --- /dev/null +++ b/node_modules/@lezer/highlight/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (C) 2018 by Marijn Haverbeke and others + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/node_modules/@lezer/highlight/README.md b/node_modules/@lezer/highlight/README.md new file mode 100644 index 0000000000..e6309ee214 --- /dev/null +++ b/node_modules/@lezer/highlight/README.md @@ -0,0 +1,14 @@ +# @lezer/highlight + +[ [**WEBSITE**](http://lezer.codemirror.net) | [**ISSUES**](https://github.com/lezer-parser/lezer/issues) | [**FORUM**](https://discuss.codemirror.net/c/lezer) | [**CHANGELOG**](https://github.com/lezer-parser/highlight/blob/master/CHANGELOG.md) ] + +[Lezer](https://lezer.codemirror.net/) is an incremental parser system +intended for use in an editor or similar system. + +@lezer/highlight provides a syntax highlighting framework for Lezer +parse trees. + +Its programming interface is documented on [the +website](https://lezer.codemirror.net/docs/ref/#highlight). + +This code is licensed under an MIT license. diff --git a/node_modules/@lezer/highlight/dist/highlight.d.ts b/node_modules/@lezer/highlight/dist/highlight.d.ts new file mode 100644 index 0000000000..11616e7001 --- /dev/null +++ b/node_modules/@lezer/highlight/dist/highlight.d.ts @@ -0,0 +1,108 @@ +import { Tree, NodeType } from "@lezer/common"; +export declare class Tag { + readonly set: Tag[]; + static define(parent?: Tag): Tag; + static defineModifier(): (tag: Tag) => Tag; +} +export declare function styleTags(spec: { + [selector: string]: Tag | readonly Tag[]; +}): import("@lezer/common").NodePropSource; +export interface Highlighter { + style(tags: readonly Tag[]): string | null; + scope?(node: NodeType): boolean; +} +export declare function tagHighlighter(tags: readonly { + tag: Tag | readonly Tag[]; + class: string; +}[], options?: { + scope?: (node: NodeType) => boolean; + all?: string; +}): Highlighter; +export declare function highlightTree(tree: Tree, highlighter: Highlighter | readonly Highlighter[], putStyle: (from: number, to: number, classes: string) => void, from?: number, to?: number): void; +export declare const tags: { + comment: Tag; + lineComment: Tag; + blockComment: Tag; + docComment: Tag; + name: Tag; + variableName: Tag; + typeName: Tag; + tagName: Tag; + propertyName: Tag; + attributeName: Tag; + className: Tag; + labelName: Tag; + namespace: Tag; + macroName: Tag; + literal: Tag; + string: Tag; + docString: Tag; + character: Tag; + attributeValue: Tag; + number: Tag; + integer: Tag; + float: Tag; + bool: Tag; + regexp: Tag; + escape: Tag; + color: Tag; + url: Tag; + keyword: Tag; + self: Tag; + null: Tag; + atom: Tag; + unit: Tag; + modifier: Tag; + operatorKeyword: Tag; + controlKeyword: Tag; + definitionKeyword: Tag; + moduleKeyword: Tag; + operator: Tag; + derefOperator: Tag; + arithmeticOperator: Tag; + logicOperator: Tag; + bitwiseOperator: Tag; + compareOperator: Tag; + updateOperator: Tag; + definitionOperator: Tag; + typeOperator: Tag; + controlOperator: Tag; + punctuation: Tag; + separator: Tag; + bracket: Tag; + angleBracket: Tag; + squareBracket: Tag; + paren: Tag; + brace: Tag; + content: Tag; + heading: Tag; + heading1: Tag; + heading2: Tag; + heading3: Tag; + heading4: Tag; + heading5: Tag; + heading6: Tag; + contentSeparator: Tag; + list: Tag; + quote: Tag; + emphasis: Tag; + strong: Tag; + link: Tag; + monospace: Tag; + strikethrough: Tag; + inserted: Tag; + deleted: Tag; + changed: Tag; + invalid: Tag; + meta: Tag; + documentMeta: Tag; + annotation: Tag; + processingInstruction: Tag; + definition: (tag: Tag) => Tag; + constant: (tag: Tag) => Tag; + function: (tag: Tag) => Tag; + standard: (tag: Tag) => Tag; + local: (tag: Tag) => Tag; + special: (tag: Tag) => Tag; +}; +export declare const classHighlighter: Highlighter; diff --git a/node_modules/@lezer/highlight/dist/index.cjs b/node_modules/@lezer/highlight/dist/index.cjs new file mode 100644 index 0000000000..856a0be074 --- /dev/null +++ b/node_modules/@lezer/highlight/dist/index.cjs @@ -0,0 +1,658 @@ +'use strict'; + +Object.defineProperty(exports, '__esModule', { value: true }); + +var common = require('@lezer/common'); + +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 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.set = set; + this.base = base; + this.modified = modified; + /// @internal + this.id = nextTagID++; + } + /// Define a new tag. If `parent` is given, the tag is treated as a + /// sub-tag of that parent, and + /// [highlighters](#highlight.tagHighlighter) that don't mention + /// this tag will try to fall back to the parent tag (or grandparent + /// tag, etc). + static define(parent) { + if (parent === null || parent === void 0 ? void 0 : parent.base) + throw new Error("Can not derive from a modified tag"); + let tag = new Tag([], 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() { + let mod = new Modifier; + 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() { + 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(set, base, mods); + for (let m of mods) + m.instances.push(tag); + let configs = permute(mods); + for (let parent of base.set) + 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 permute(array) { + let result = [array]; + for (let i = 0; i < array.length; i++) { + for (let a of permute(array.slice(0, i).concat(array.slice(i + 1)))) + result.push(a); + } + return result; +} +/// 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.withProps( +/// 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 /* Normal */, rest = part; + for (let pos = 0;;) { + if (rest == "..." && pos > 0 && pos + 3 == part.length) { + mode = 1 /* 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 /* 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 common.NodeProp(); +class Rule { + constructor(tags, mode, context, next) { + this.tags = tags; + this.mode = mode; + this.context = context; + this.next = next; + } + 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; } +} +/// 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: 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). +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); +} +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 = type.prop(ruleNodeProp), opaque = false; + while (rule) { + if (!rule.context || cursor.matchContext(rule.context)) { + let tagCls = highlightTags(highlighters, rule.tags); + if (tagCls) { + if (cls) + cls += " "; + cls += tagCls; + if (rule.mode == 1 /* Inherit */) + inheritedClass += (inheritedClass ? " " : "") + tagCls; + else if (rule.mode == 0 /* Opaque */) + opaque = true; + } + break; + } + rule = rule.next; + } + this.startSpan(cursor.from, cls); + if (opaque) + return; + let mounted = cursor.tree && cursor.tree.prop(common.NodeProp.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(to, 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), inheritedClass, innerHighlighters); + this.startSpan(pos, cls); + } + } + if (hasChild) + cursor.parent(); + } + else if (cursor.firstChild()) { + 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(); + } + } +} +const t = Tag.define; +const comment = t(), name = t(), typeName = t(name), propertyName = t(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, + /// The [name](#highlight.tags.name) of a variable. + variableName: t(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(name), + /// A label [name](#highlight.tags.name). + labelName: t(name), + /// A namespace [name](#highlight.tags.name). + namespace: t(name), + /// The [name](#highlight.tags.name) of a macro. + macroName: t(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 defines 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 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(), + /// [Modifier](#highlight.Tag^defineModifier) that indicates that + /// something is constant. Mostly expected to be used with + /// [variable names](#highlight.tags.variableName). + constant: Tag.defineModifier(), + /// [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(), + /// [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(), + /// [Modifier](#highlight.Tag^defineModifier) that indicates a given + /// [names](#highlight.tags.name) is local to some scope. + local: Tag.defineModifier(), + /// 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() +}; +/// 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" } +]); + +exports.Tag = Tag; +exports.classHighlighter = classHighlighter; +exports.highlightTree = highlightTree; +exports.styleTags = styleTags; +exports.tagHighlighter = tagHighlighter; +exports.tags = tags; diff --git a/node_modules/@lezer/highlight/dist/index.es.js b/node_modules/@lezer/highlight/dist/index.es.js new file mode 100644 index 0000000000..59f8ac6072 --- /dev/null +++ b/node_modules/@lezer/highlight/dist/index.es.js @@ -0,0 +1,649 @@ +import { NodeProp } from '@lezer/common'; + +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 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.set = set; + this.base = base; + this.modified = modified; + /// @internal + this.id = nextTagID++; + } + /// Define a new tag. If `parent` is given, the tag is treated as a + /// sub-tag of that parent, and + /// [highlighters](#highlight.tagHighlighter) that don't mention + /// this tag will try to fall back to the parent tag (or grandparent + /// tag, etc). + static define(parent) { + if (parent === null || parent === void 0 ? void 0 : parent.base) + throw new Error("Can not derive from a modified tag"); + let tag = new Tag([], 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() { + let mod = new Modifier; + 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() { + 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(set, base, mods); + for (let m of mods) + m.instances.push(tag); + let configs = permute(mods); + for (let parent of base.set) + 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 permute(array) { + let result = [array]; + for (let i = 0; i < array.length; i++) { + for (let a of permute(array.slice(0, i).concat(array.slice(i + 1)))) + result.push(a); + } + return result; +} +/// 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.withProps( +/// 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 /* Normal */, rest = part; + for (let pos = 0;;) { + if (rest == "..." && pos > 0 && pos + 3 == part.length) { + mode = 1 /* 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 /* 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 NodeProp(); +class Rule { + constructor(tags, mode, context, next) { + this.tags = tags; + this.mode = mode; + this.context = context; + this.next = next; + } + 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; } +} +/// 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: 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). +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); +} +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 = type.prop(ruleNodeProp), opaque = false; + while (rule) { + if (!rule.context || cursor.matchContext(rule.context)) { + let tagCls = highlightTags(highlighters, rule.tags); + if (tagCls) { + if (cls) + cls += " "; + cls += tagCls; + if (rule.mode == 1 /* Inherit */) + inheritedClass += (inheritedClass ? " " : "") + tagCls; + else if (rule.mode == 0 /* Opaque */) + opaque = true; + } + break; + } + rule = rule.next; + } + this.startSpan(cursor.from, cls); + if (opaque) + return; + let mounted = cursor.tree && cursor.tree.prop(NodeProp.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(to, 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), inheritedClass, innerHighlighters); + this.startSpan(pos, cls); + } + } + if (hasChild) + cursor.parent(); + } + else if (cursor.firstChild()) { + 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(); + } + } +} +const t = Tag.define; +const comment = t(), name = t(), typeName = t(name), propertyName = t(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, + /// The [name](#highlight.tags.name) of a variable. + variableName: t(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(name), + /// A label [name](#highlight.tags.name). + labelName: t(name), + /// A namespace [name](#highlight.tags.name). + namespace: t(name), + /// The [name](#highlight.tags.name) of a macro. + macroName: t(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 defines 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 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(), + /// [Modifier](#highlight.Tag^defineModifier) that indicates that + /// something is constant. Mostly expected to be used with + /// [variable names](#highlight.tags.variableName). + constant: Tag.defineModifier(), + /// [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(), + /// [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(), + /// [Modifier](#highlight.Tag^defineModifier) that indicates a given + /// [names](#highlight.tags.name) is local to some scope. + local: Tag.defineModifier(), + /// 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() +}; +/// 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" } +]); + +export { Tag, classHighlighter, highlightTags, highlightTree, styleTags, tagHighlighter, tags }; diff --git a/node_modules/@lezer/highlight/dist/index.js b/node_modules/@lezer/highlight/dist/index.js new file mode 100644 index 0000000000..1985a52d86 --- /dev/null +++ b/node_modules/@lezer/highlight/dist/index.js @@ -0,0 +1,649 @@ +import { NodeProp } from '@lezer/common'; + +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 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.set = set; + this.base = base; + this.modified = modified; + /// @internal + this.id = nextTagID++; + } + /// Define a new tag. If `parent` is given, the tag is treated as a + /// sub-tag of that parent, and + /// [highlighters](#highlight.tagHighlighter) that don't mention + /// this tag will try to fall back to the parent tag (or grandparent + /// tag, etc). + static define(parent) { + if (parent === null || parent === void 0 ? void 0 : parent.base) + throw new Error("Can not derive from a modified tag"); + let tag = new Tag([], 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() { + let mod = new Modifier; + 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() { + 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(set, base, mods); + for (let m of mods) + m.instances.push(tag); + let configs = permute(mods); + for (let parent of base.set) + 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 permute(array) { + let result = [array]; + for (let i = 0; i < array.length; i++) { + for (let a of permute(array.slice(0, i).concat(array.slice(i + 1)))) + result.push(a); + } + return result; +} +/// 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.withProps( +/// 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 /* Normal */, rest = part; + for (let pos = 0;;) { + if (rest == "..." && pos > 0 && pos + 3 == part.length) { + mode = 1 /* 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 /* 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 NodeProp(); +class Rule { + constructor(tags, mode, context, next) { + this.tags = tags; + this.mode = mode; + this.context = context; + this.next = next; + } + 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; } +} +/// 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: 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). +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); +} +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 = type.prop(ruleNodeProp), opaque = false; + while (rule) { + if (!rule.context || cursor.matchContext(rule.context)) { + let tagCls = highlightTags(highlighters, rule.tags); + if (tagCls) { + if (cls) + cls += " "; + cls += tagCls; + if (rule.mode == 1 /* Inherit */) + inheritedClass += (inheritedClass ? " " : "") + tagCls; + else if (rule.mode == 0 /* Opaque */) + opaque = true; + } + break; + } + rule = rule.next; + } + this.startSpan(cursor.from, cls); + if (opaque) + return; + let mounted = cursor.tree && cursor.tree.prop(NodeProp.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(to, 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), inheritedClass, innerHighlighters); + this.startSpan(pos, cls); + } + } + if (hasChild) + cursor.parent(); + } + else if (cursor.firstChild()) { + 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(); + } + } +} +const t = Tag.define; +const comment = t(), name = t(), typeName = t(name), propertyName = t(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, + /// The [name](#highlight.tags.name) of a variable. + variableName: t(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(name), + /// A label [name](#highlight.tags.name). + labelName: t(name), + /// A namespace [name](#highlight.tags.name). + namespace: t(name), + /// The [name](#highlight.tags.name) of a macro. + macroName: t(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 defines 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 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(), + /// [Modifier](#highlight.Tag^defineModifier) that indicates that + /// something is constant. Mostly expected to be used with + /// [variable names](#highlight.tags.variableName). + constant: Tag.defineModifier(), + /// [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(), + /// [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(), + /// [Modifier](#highlight.Tag^defineModifier) that indicates a given + /// [names](#highlight.tags.name) is local to some scope. + local: Tag.defineModifier(), + /// 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() +}; +/// 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" } +]); + +export { Tag, classHighlighter, highlightTree, styleTags, tagHighlighter, tags }; diff --git a/node_modules/@lezer/highlight/package.json b/node_modules/@lezer/highlight/package.json new file mode 100644 index 0000000000..31badeb321 --- /dev/null +++ b/node_modules/@lezer/highlight/package.json @@ -0,0 +1,34 @@ +{ + "name": "@lezer/highlight", + "version": "1.0.0", + "description": "Highlighting system for Lezer parse trees", + "main": "dist/index.cjs", + "type": "module", + "exports": { + "import": "./dist/index.js", + "require": "./dist/index.cjs" + }, + "module": "dist/index.js", + "types": "dist/highlight.d.ts", + "author": "Marijn Haverbeke ", + "license": "MIT", + "devDependencies": { + "rollup": "^2.52.2", + "@rollup/plugin-commonjs": "^15.1.0", + "@rollup/plugin-node-resolve": "^9.0.0", + "rollup-plugin-typescript2": "^0.30.0", + "typescript": "^4.3.4" + }, + "dependencies": { + "@lezer/common": "^1.0.0" + }, + "files": ["dist"], + "repository": { + "type" : "git", + "url" : "https://github.com/lezer-parser/highlight.git" + }, + "scripts": { + "watch": "rollup -w -c rollup.config.js", + "prepare": "rollup -c rollup.config.js" + } +} diff --git a/node_modules/@lezer/lr/LICENSE b/node_modules/@lezer/lr/LICENSE new file mode 100644 index 0000000000..30a86e3d1e --- /dev/null +++ b/node_modules/@lezer/lr/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (C) 2018 by Marijn Haverbeke and others + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. diff --git a/node_modules/@lezer/lr/README.md b/node_modules/@lezer/lr/README.md new file mode 100644 index 0000000000..9a326205cc --- /dev/null +++ b/node_modules/@lezer/lr/README.md @@ -0,0 +1,25 @@ +# @lezer/lr + +[ [**WEBSITE**](http://lezer.codemirror.net) | [**ISSUES**](https://github.com/lezer-parser/lezer/issues) | [**FORUM**](https://discuss.codemirror.net/c/lezer) | [**CHANGELOG**](https://github.com/lezer-parser/lr/blob/master/CHANGELOG.md) ] + +Lezer ("reader" in Dutch, pronounced pretty much as laser) is an +incremental GLR parser intended for use in an editor or similar +system, which needs to keep a representation of the program current +during changes and in the face of syntax errors. + +It prioritizes speed and compactness (both of parser table files and +of syntax tree) over having a highly usable parse tree—trees nodes are +just blobs with a start, end, tag, and set of child nodes, with no +further labeling of child nodes or extra metadata. + +This package contains the run-time LR parser library. It consumes +parsers generated by +[@lezer/generator](https://github.com/lezer-parser/generator). + +The parser programming interface is documented on [the +website](https://lezer.codemirror.net/docs/ref/#lr). + +The code is licensed under an MIT license. + +This project was hugely inspired by +[tree-sitter](http://tree-sitter.github.io/tree-sitter/). diff --git a/node_modules/@lezer/lr/dist/constants.d.ts b/node_modules/@lezer/lr/dist/constants.d.ts new file mode 100644 index 0000000000..e01d413dce --- /dev/null +++ b/node_modules/@lezer/lr/dist/constants.d.ts @@ -0,0 +1,45 @@ +export declare const enum Action { + ReduceFlag = 65536, + ValueMask = 65535, + ReduceDepthShift = 19, + RepeatFlag = 131072, + GotoFlag = 131072, + StayFlag = 262144 +} +export declare const enum StateFlag { + Skipped = 1, + Accepting = 2 +} +export declare const enum Specialize { + Specialize = 0, + Extend = 1 +} +export declare const enum Term { + Err = 0 +} +export declare const enum Seq { + End = 65535, + Done = 0, + Next = 1, + Other = 2 +} +export declare const enum ParseState { + Flags = 0, + Actions = 1, + Skip = 2, + TokenizerMask = 3, + DefaultReduce = 4, + ForcedReduce = 5, + Size = 6 +} +export declare const enum Encode { + BigValCode = 126, + BigVal = 65535, + Start = 32, + Gap1 = 34, + Gap2 = 92, + Base = 46 +} +export declare const enum File { + Version = 14 +} diff --git a/node_modules/@lezer/lr/dist/decode.d.ts b/node_modules/@lezer/lr/dist/decode.d.ts new file mode 100644 index 0000000000..5e34536205 --- /dev/null +++ b/node_modules/@lezer/lr/dist/decode.d.ts @@ -0,0 +1,5 @@ +export declare function decodeArray(input: string | T, Type?: { + new (n: number): T; +}): T; diff --git a/node_modules/@lezer/lr/dist/index.cjs b/node_modules/@lezer/lr/dist/index.cjs new file mode 100644 index 0000000000..385210c9e6 --- /dev/null +++ b/node_modules/@lezer/lr/dist/index.cjs @@ -0,0 +1,1600 @@ +'use strict'; + +Object.defineProperty(exports, '__esModule', { value: true }); + +var common = require('@lezer/common'); + +/// A parse stack. These are used internally by the parser to track +/// parsing progress. They also provide some properties and methods +/// that external code such as a tokenizer can use to get information +/// about the parse state. +class Stack { + /// @internal + constructor( + /// The parse that this stack is part of @internal + p, + /// Holds state, input pos, buffer index triplets for all but the + /// top state @internal + stack, + /// The current parse state @internal + state, + // The position at which the next reduce should take place. This + // can be less than `this.pos` when skipped expressions have been + // added to the stack (which should be moved outside of the next + // reduction) + /// @internal + reducePos, + /// The input position up to which this stack has parsed. + pos, + /// The dynamic score of the stack, including dynamic precedence + /// and error-recovery penalties + /// @internal + score, + // The output buffer. Holds (type, start, end, size) quads + // representing nodes created by the parser, where `size` is + // amount of buffer array entries covered by this node. + /// @internal + buffer, + // The base offset of the buffer. When stacks are split, the split + // instance shared the buffer history with its parent up to + // `bufferBase`, which is the absolute offset (including the + // offset of previous splits) into the buffer at which this stack + // starts writing. + /// @internal + bufferBase, + /// @internal + curContext, + /// @internal + lookAhead = 0, + // A parent stack from which this was split off, if any. This is + // set up so that it always points to a stack that has some + // additional buffer content, never to a stack with an equal + // `bufferBase`. + /// @internal + parent) { + this.p = p; + this.stack = stack; + this.state = state; + this.reducePos = reducePos; + this.pos = pos; + this.score = score; + this.buffer = buffer; + this.bufferBase = bufferBase; + this.curContext = curContext; + this.lookAhead = lookAhead; + this.parent = parent; + } + /// @internal + toString() { + return `[${this.stack.filter((_, i) => i % 3 == 0).concat(this.state)}]@${this.pos}${this.score ? "!" + this.score : ""}`; + } + // Start an empty stack + /// @internal + static start(p, state, pos = 0) { + let cx = p.parser.context; + return new Stack(p, [], state, pos, pos, 0, [], 0, cx ? new StackContext(cx, cx.start) : null, 0, null); + } + /// The stack's current [context](#lr.ContextTracker) value, if + /// any. Its type will depend on the context tracker's type + /// parameter, or it will be `null` if there is no context + /// tracker. + get context() { return this.curContext ? this.curContext.context : null; } + // Push a state onto the stack, tracking its start position as well + // as the buffer base at that point. + /// @internal + pushState(state, start) { + this.stack.push(this.state, start, this.bufferBase + this.buffer.length); + this.state = state; + } + // Apply a reduce action + /// @internal + reduce(action) { + let depth = action >> 19 /* ReduceDepthShift */, type = action & 65535 /* ValueMask */; + let { parser } = this.p; + let dPrec = parser.dynamicPrecedence(type); + if (dPrec) + this.score += dPrec; + if (depth == 0) { + this.pushState(parser.getGoto(this.state, type, true), this.reducePos); + // Zero-depth reductions are a special case—they add stuff to + // the stack without popping anything off. + if (type < parser.minRepeatTerm) + this.storeNode(type, this.reducePos, this.reducePos, 4, true); + this.reduceContext(type, this.reducePos); + return; + } + // Find the base index into `this.stack`, content after which will + // be dropped. Note that with `StayFlag` reductions we need to + // consume two extra frames (the dummy parent node for the skipped + // expression and the state that we'll be staying in, which should + // be moved to `this.state`). + let base = this.stack.length - ((depth - 1) * 3) - (action & 262144 /* StayFlag */ ? 6 : 0); + let start = this.stack[base - 2]; + let bufferBase = this.stack[base - 1], count = this.bufferBase + this.buffer.length - bufferBase; + // Store normal terms or `R -> R R` repeat reductions + if (type < parser.minRepeatTerm || (action & 131072 /* RepeatFlag */)) { + let pos = parser.stateFlag(this.state, 1 /* Skipped */) ? this.pos : this.reducePos; + this.storeNode(type, start, pos, count + 4, true); + } + if (action & 262144 /* StayFlag */) { + this.state = this.stack[base]; + } + else { + let baseStateID = this.stack[base - 3]; + this.state = parser.getGoto(baseStateID, type, true); + } + while (this.stack.length > base) + this.stack.pop(); + this.reduceContext(type, start); + } + // Shift a value into the buffer + /// @internal + storeNode(term, start, end, size = 4, isReduce = false) { + if (term == 0 /* Err */ && + (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) { + // Try to omit/merge adjacent error nodes + let cur = this, top = this.buffer.length; + if (top == 0 && cur.parent) { + top = cur.bufferBase - cur.parent.bufferBase; + cur = cur.parent; + } + if (top > 0 && cur.buffer[top - 4] == 0 /* Err */ && cur.buffer[top - 1] > -1) { + if (start == end) + return; + if (cur.buffer[top - 2] >= start) { + cur.buffer[top - 2] = end; + return; + } + } + } + if (!isReduce || this.pos == end) { // Simple case, just append + this.buffer.push(term, start, end, size); + } + else { // There may be skipped nodes that have to be moved forward + let index = this.buffer.length; + if (index > 0 && this.buffer[index - 4] != 0 /* Err */) + while (index > 0 && this.buffer[index - 2] > end) { + // Move this record forward + this.buffer[index] = this.buffer[index - 4]; + this.buffer[index + 1] = this.buffer[index - 3]; + this.buffer[index + 2] = this.buffer[index - 2]; + this.buffer[index + 3] = this.buffer[index - 1]; + index -= 4; + if (size > 4) + size -= 4; + } + this.buffer[index] = term; + this.buffer[index + 1] = start; + this.buffer[index + 2] = end; + this.buffer[index + 3] = size; + } + } + // Apply a shift action + /// @internal + shift(action, next, nextEnd) { + let start = this.pos; + if (action & 131072 /* GotoFlag */) { + this.pushState(action & 65535 /* ValueMask */, this.pos); + } + else if ((action & 262144 /* StayFlag */) == 0) { // Regular shift + let nextState = action, { parser } = this.p; + if (nextEnd > this.pos || next <= parser.maxNode) { + this.pos = nextEnd; + if (!parser.stateFlag(nextState, 1 /* Skipped */)) + this.reducePos = nextEnd; + } + this.pushState(nextState, start); + this.shiftContext(next, start); + if (next <= parser.maxNode) + this.buffer.push(next, start, nextEnd, 4); + } + else { // Shift-and-stay, which means this is a skipped token + this.pos = nextEnd; + this.shiftContext(next, start); + if (next <= this.p.parser.maxNode) + this.buffer.push(next, start, nextEnd, 4); + } + } + // Apply an action + /// @internal + apply(action, next, nextEnd) { + if (action & 65536 /* ReduceFlag */) + this.reduce(action); + else + this.shift(action, next, nextEnd); + } + // Add a prebuilt (reused) node into the buffer. + /// @internal + useNode(value, next) { + let index = this.p.reused.length - 1; + if (index < 0 || this.p.reused[index] != value) { + this.p.reused.push(value); + index++; + } + let start = this.pos; + this.reducePos = this.pos = start + value.length; + this.pushState(next, start); + this.buffer.push(index, start, this.reducePos, -1 /* size == -1 means this is a reused value */); + if (this.curContext) + this.updateContext(this.curContext.tracker.reuse(this.curContext.context, value, this, this.p.stream.reset(this.pos - value.length))); + } + // Split the stack. Due to the buffer sharing and the fact + // that `this.stack` tends to stay quite shallow, this isn't very + // expensive. + /// @internal + split() { + let parent = this; + let off = parent.buffer.length; + // Because the top of the buffer (after this.pos) may be mutated + // to reorder reductions and skipped tokens, and shared buffers + // should be immutable, this copies any outstanding skipped tokens + // to the new buffer, and puts the base pointer before them. + while (off > 0 && parent.buffer[off - 2] > parent.reducePos) + off -= 4; + let buffer = parent.buffer.slice(off), base = parent.bufferBase + off; + // Make sure parent points to an actual parent with content, if there is such a parent. + while (parent && base == parent.bufferBase) + parent = parent.parent; + return new Stack(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, buffer, base, this.curContext, this.lookAhead, parent); + } + // Try to recover from an error by 'deleting' (ignoring) one token. + /// @internal + recoverByDelete(next, nextEnd) { + let isNode = next <= this.p.parser.maxNode; + if (isNode) + this.storeNode(next, this.pos, nextEnd, 4); + this.storeNode(0 /* Err */, this.pos, nextEnd, isNode ? 8 : 4); + this.pos = this.reducePos = nextEnd; + this.score -= 190 /* Delete */; + } + /// Check if the given term would be able to be shifted (optionally + /// after some reductions) on this stack. This can be useful for + /// external tokenizers that want to make sure they only provide a + /// given token when it applies. + canShift(term) { + for (let sim = new SimulatedStack(this);;) { + let action = this.p.parser.stateSlot(sim.state, 4 /* DefaultReduce */) || this.p.parser.hasAction(sim.state, term); + if ((action & 65536 /* ReduceFlag */) == 0) + return true; + if (action == 0) + return false; + sim.reduce(action); + } + } + // Apply up to Recover.MaxNext recovery actions that conceptually + // inserts some missing token or rule. + /// @internal + recoverByInsert(next) { + if (this.stack.length >= 300 /* MaxInsertStackDepth */) + return []; + let nextStates = this.p.parser.nextStates(this.state); + if (nextStates.length > 4 /* MaxNext */ << 1 || this.stack.length >= 120 /* DampenInsertStackDepth */) { + let best = []; + for (let i = 0, s; i < nextStates.length; i += 2) { + if ((s = nextStates[i + 1]) != this.state && this.p.parser.hasAction(s, next)) + best.push(nextStates[i], s); + } + if (this.stack.length < 120 /* DampenInsertStackDepth */) + for (let i = 0; best.length < 4 /* MaxNext */ << 1 && i < nextStates.length; i += 2) { + let s = nextStates[i + 1]; + if (!best.some((v, i) => (i & 1) && v == s)) + best.push(nextStates[i], s); + } + nextStates = best; + } + let result = []; + for (let i = 0; i < nextStates.length && result.length < 4 /* MaxNext */; i += 2) { + let s = nextStates[i + 1]; + if (s == this.state) + continue; + let stack = this.split(); + stack.pushState(s, this.pos); + stack.storeNode(0 /* Err */, stack.pos, stack.pos, 4, true); + stack.shiftContext(nextStates[i], this.pos); + stack.score -= 200 /* Insert */; + result.push(stack); + } + return result; + } + // Force a reduce, if possible. Return false if that can't + // be done. + /// @internal + forceReduce() { + let reduce = this.p.parser.stateSlot(this.state, 5 /* ForcedReduce */); + if ((reduce & 65536 /* ReduceFlag */) == 0) + return false; + let { parser } = this.p; + if (!parser.validAction(this.state, reduce)) { + let depth = reduce >> 19 /* ReduceDepthShift */, term = reduce & 65535 /* ValueMask */; + let target = this.stack.length - depth * 3; + if (target < 0 || parser.getGoto(this.stack[target], term, false) < 0) + return false; + this.storeNode(0 /* Err */, this.reducePos, this.reducePos, 4, true); + this.score -= 100 /* Reduce */; + } + this.reducePos = this.pos; + this.reduce(reduce); + return true; + } + /// @internal + forceAll() { + while (!this.p.parser.stateFlag(this.state, 2 /* Accepting */)) { + if (!this.forceReduce()) { + this.storeNode(0 /* Err */, this.pos, this.pos, 4, true); + break; + } + } + return this; + } + /// Check whether this state has no further actions (assumed to be a direct descendant of the + /// top state, since any other states must be able to continue + /// somehow). @internal + get deadEnd() { + if (this.stack.length != 3) + return false; + let { parser } = this.p; + return parser.data[parser.stateSlot(this.state, 1 /* Actions */)] == 65535 /* End */ && + !parser.stateSlot(this.state, 4 /* DefaultReduce */); + } + /// Restart the stack (put it back in its start state). Only safe + /// when this.stack.length == 3 (state is directly below the top + /// state). @internal + restart() { + this.state = this.stack[0]; + this.stack.length = 0; + } + /// @internal + sameState(other) { + if (this.state != other.state || this.stack.length != other.stack.length) + return false; + for (let i = 0; i < this.stack.length; i += 3) + if (this.stack[i] != other.stack[i]) + return false; + return true; + } + /// Get the parser used by this stack. + get parser() { return this.p.parser; } + /// Test whether a given dialect (by numeric ID, as exported from + /// the terms file) is enabled. + dialectEnabled(dialectID) { return this.p.parser.dialect.flags[dialectID]; } + shiftContext(term, start) { + if (this.curContext) + this.updateContext(this.curContext.tracker.shift(this.curContext.context, term, this, this.p.stream.reset(start))); + } + reduceContext(term, start) { + if (this.curContext) + this.updateContext(this.curContext.tracker.reduce(this.curContext.context, term, this, this.p.stream.reset(start))); + } + /// @internal + emitContext() { + let last = this.buffer.length - 1; + if (last < 0 || this.buffer[last] != -3) + this.buffer.push(this.curContext.hash, this.reducePos, this.reducePos, -3); + } + /// @internal + emitLookAhead() { + let last = this.buffer.length - 1; + if (last < 0 || this.buffer[last] != -4) + this.buffer.push(this.lookAhead, this.reducePos, this.reducePos, -4); + } + updateContext(context) { + if (context != this.curContext.context) { + let newCx = new StackContext(this.curContext.tracker, context); + if (newCx.hash != this.curContext.hash) + this.emitContext(); + this.curContext = newCx; + } + } + /// @internal + setLookAhead(lookAhead) { + if (lookAhead > this.lookAhead) { + this.emitLookAhead(); + this.lookAhead = lookAhead; + } + } + /// @internal + close() { + if (this.curContext && this.curContext.tracker.strict) + this.emitContext(); + if (this.lookAhead > 0) + this.emitLookAhead(); + } +} +class StackContext { + constructor(tracker, context) { + this.tracker = tracker; + this.context = context; + this.hash = tracker.strict ? tracker.hash(context) : 0; + } +} +var Recover; +(function (Recover) { + Recover[Recover["Insert"] = 200] = "Insert"; + Recover[Recover["Delete"] = 190] = "Delete"; + Recover[Recover["Reduce"] = 100] = "Reduce"; + Recover[Recover["MaxNext"] = 4] = "MaxNext"; + Recover[Recover["MaxInsertStackDepth"] = 300] = "MaxInsertStackDepth"; + Recover[Recover["DampenInsertStackDepth"] = 120] = "DampenInsertStackDepth"; +})(Recover || (Recover = {})); +// Used to cheaply run some reductions to scan ahead without mutating +// an entire stack +class SimulatedStack { + constructor(start) { + this.start = start; + this.state = start.state; + this.stack = start.stack; + this.base = this.stack.length; + } + reduce(action) { + let term = action & 65535 /* ValueMask */, depth = action >> 19 /* ReduceDepthShift */; + if (depth == 0) { + if (this.stack == this.start.stack) + this.stack = this.stack.slice(); + this.stack.push(this.state, 0, 0); + this.base += 3; + } + else { + this.base -= (depth - 1) * 3; + } + let goto = this.start.p.parser.getGoto(this.stack[this.base - 3], term, true); + this.state = goto; + } +} +// This is given to `Tree.build` to build a buffer, and encapsulates +// the parent-stack-walking necessary to read the nodes. +class StackBufferCursor { + constructor(stack, pos, index) { + this.stack = stack; + this.pos = pos; + this.index = index; + this.buffer = stack.buffer; + if (this.index == 0) + this.maybeNext(); + } + static create(stack, pos = stack.bufferBase + stack.buffer.length) { + return new StackBufferCursor(stack, pos, pos - stack.bufferBase); + } + maybeNext() { + let next = this.stack.parent; + if (next != null) { + this.index = this.stack.bufferBase - next.bufferBase; + this.stack = next; + this.buffer = next.buffer; + } + } + 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]; } + next() { + this.index -= 4; + this.pos -= 4; + if (this.index == 0) + this.maybeNext(); + } + fork() { + return new StackBufferCursor(this.stack, this.pos, this.index); + } +} + +class CachedToken { + constructor() { + this.start = -1; + this.value = -1; + this.end = -1; + this.extended = -1; + this.lookAhead = 0; + this.mask = 0; + this.context = 0; + } +} +const nullToken = new CachedToken; +/// [Tokenizers](#lr.ExternalTokenizer) interact with the input +/// through this interface. It presents the input as a stream of +/// characters, tracking lookahead and hiding the complexity of +/// [ranges](#common.Parser.parse^ranges) from tokenizer code. +class InputStream { + /// @internal + constructor( + /// @internal + input, + /// @internal + ranges) { + this.input = input; + this.ranges = ranges; + /// @internal + this.chunk = ""; + /// @internal + this.chunkOff = 0; + /// Backup chunk + this.chunk2 = ""; + this.chunk2Pos = 0; + /// The character code of the next code unit in the input, or -1 + /// when the stream is at the end of the input. + this.next = -1; + /// @internal + this.token = nullToken; + this.rangeIndex = 0; + this.pos = this.chunkPos = ranges[0].from; + this.range = ranges[0]; + this.end = ranges[ranges.length - 1].to; + this.readNext(); + } + /// @internal + resolveOffset(offset, assoc) { + let range = this.range, index = this.rangeIndex; + let pos = this.pos + offset; + while (pos < range.from) { + if (!index) + return null; + let next = this.ranges[--index]; + pos -= range.from - next.to; + range = next; + } + while (assoc < 0 ? pos > range.to : pos >= range.to) { + if (index == this.ranges.length - 1) + return null; + let next = this.ranges[++index]; + pos += next.from - range.to; + range = next; + } + return pos; + } + /// Look at a code unit near the stream position. `.peek(0)` equals + /// `.next`, `.peek(-1)` gives you the previous character, and so + /// on. + /// + /// Note that looking around during tokenizing creates dependencies + /// on potentially far-away content, which may reduce the + /// effectiveness incremental parsing—when looking forward—or even + /// cause invalid reparses when looking backward more than 25 code + /// units, since the library does not track lookbehind. + peek(offset) { + let idx = this.chunkOff + offset, pos, result; + if (idx >= 0 && idx < this.chunk.length) { + pos = this.pos + offset; + result = this.chunk.charCodeAt(idx); + } + else { + let resolved = this.resolveOffset(offset, 1); + if (resolved == null) + return -1; + pos = resolved; + if (pos >= this.chunk2Pos && pos < this.chunk2Pos + this.chunk2.length) { + result = this.chunk2.charCodeAt(pos - this.chunk2Pos); + } + else { + let i = this.rangeIndex, range = this.range; + while (range.to <= pos) + range = this.ranges[++i]; + this.chunk2 = this.input.chunk(this.chunk2Pos = pos); + if (pos + this.chunk2.length > range.to) + this.chunk2 = this.chunk2.slice(0, range.to - pos); + result = this.chunk2.charCodeAt(0); + } + } + if (pos >= this.token.lookAhead) + this.token.lookAhead = pos + 1; + return result; + } + /// Accept a token. By default, the end of the token is set to the + /// current stream position, but you can pass an offset (relative to + /// the stream position) to change that. + acceptToken(token, endOffset = 0) { + let end = endOffset ? this.resolveOffset(endOffset, -1) : this.pos; + if (end == null || end < this.token.start) + throw new RangeError("Token end out of bounds"); + this.token.value = token; + this.token.end = end; + } + getChunk() { + if (this.pos >= this.chunk2Pos && this.pos < this.chunk2Pos + this.chunk2.length) { + let { chunk, chunkPos } = this; + this.chunk = this.chunk2; + this.chunkPos = this.chunk2Pos; + this.chunk2 = chunk; + this.chunk2Pos = chunkPos; + this.chunkOff = this.pos - this.chunkPos; + } + else { + this.chunk2 = this.chunk; + this.chunk2Pos = this.chunkPos; + let nextChunk = this.input.chunk(this.pos); + let end = this.pos + nextChunk.length; + this.chunk = end > this.range.to ? nextChunk.slice(0, this.range.to - this.pos) : nextChunk; + this.chunkPos = this.pos; + this.chunkOff = 0; + } + } + readNext() { + if (this.chunkOff >= this.chunk.length) { + this.getChunk(); + if (this.chunkOff == this.chunk.length) + return this.next = -1; + } + return this.next = this.chunk.charCodeAt(this.chunkOff); + } + /// Move the stream forward N (defaults to 1) code units. Returns + /// the new value of [`next`](#lr.InputStream.next). + advance(n = 1) { + this.chunkOff += n; + while (this.pos + n >= this.range.to) { + if (this.rangeIndex == this.ranges.length - 1) + return this.setDone(); + n -= this.range.to - this.pos; + this.range = this.ranges[++this.rangeIndex]; + this.pos = this.range.from; + } + this.pos += n; + if (this.pos >= this.token.lookAhead) + this.token.lookAhead = this.pos + 1; + return this.readNext(); + } + setDone() { + this.pos = this.chunkPos = this.end; + this.range = this.ranges[this.rangeIndex = this.ranges.length - 1]; + this.chunk = ""; + return this.next = -1; + } + /// @internal + reset(pos, token) { + if (token) { + this.token = token; + token.start = pos; + token.lookAhead = pos + 1; + token.value = token.extended = -1; + } + else { + this.token = nullToken; + } + if (this.pos != pos) { + this.pos = pos; + if (pos == this.end) { + this.setDone(); + return this; + } + while (pos < this.range.from) + this.range = this.ranges[--this.rangeIndex]; + while (pos >= this.range.to) + this.range = this.ranges[++this.rangeIndex]; + if (pos >= this.chunkPos && pos < this.chunkPos + this.chunk.length) { + this.chunkOff = pos - this.chunkPos; + } + else { + this.chunk = ""; + this.chunkOff = 0; + } + this.readNext(); + } + return this; + } + /// @internal + read(from, to) { + if (from >= this.chunkPos && to <= this.chunkPos + this.chunk.length) + return this.chunk.slice(from - this.chunkPos, to - this.chunkPos); + if (from >= this.chunk2Pos && to <= this.chunk2Pos + this.chunk2.length) + return this.chunk2.slice(from - this.chunk2Pos, to - this.chunk2Pos); + if (from >= this.range.from && to <= this.range.to) + return this.input.read(from, to); + let result = ""; + for (let r of this.ranges) { + if (r.from >= to) + break; + if (r.to > from) + result += this.input.read(Math.max(r.from, from), Math.min(r.to, to)); + } + return result; + } +} +/// @internal +class TokenGroup { + constructor(data, id) { + this.data = data; + this.id = id; + } + token(input, stack) { readToken(this.data, input, stack, this.id); } +} +TokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false; +/// `@external tokens` declarations in the grammar should resolve to +/// an instance of this class. +class ExternalTokenizer { + /// Create a tokenizer. The first argument is the function that, + /// given an input stream, scans for the types of tokens it + /// recognizes at the stream's position, and calls + /// [`acceptToken`](#lr.InputStream.acceptToken) when it finds + /// one. + constructor( + /// @internal + token, options = {}) { + this.token = token; + this.contextual = !!options.contextual; + this.fallback = !!options.fallback; + this.extend = !!options.extend; + } +} +// Tokenizer data is stored a big uint16 array containing, for each +// state: +// +// - A group bitmask, indicating what token groups are reachable from +// this state, so that paths that can only lead to tokens not in +// any of the current groups can be cut off early. +// +// - The position of the end of the state's sequence of accepting +// tokens +// +// - The number of outgoing edges for the state +// +// - The accepting tokens, as (token id, group mask) pairs +// +// - The outgoing edges, as (start character, end character, state +// index) triples, with end character being exclusive +// +// This function interprets that data, running through a stream as +// long as new states with the a matching group mask can be reached, +// and updating `token` when it matches a token. +function readToken(data, input, stack, group) { + let state = 0, groupMask = 1 << group, { parser } = stack.p, { dialect } = parser; + scan: for (;;) { + if ((groupMask & data[state]) == 0) + break; + let accEnd = data[state + 1]; + // Check whether this state can lead to a token in the current group + // Accept tokens in this state, possibly overwriting + // lower-precedence / shorter tokens + for (let i = state + 3; i < accEnd; i += 2) + if ((data[i + 1] & groupMask) > 0) { + let term = data[i]; + if (dialect.allows(term) && + (input.token.value == -1 || input.token.value == term || parser.overrides(term, input.token.value))) { + input.acceptToken(term); + break; + } + } + // Do a binary search on the state's edges + for (let next = input.next, low = 0, high = data[state + 2]; low < high;) { + let mid = (low + high) >> 1; + let index = accEnd + mid + (mid << 1); + let from = data[index], to = data[index + 1]; + if (next < from) + high = mid; + else if (next >= to) + low = mid + 1; + else { + state = data[index + 2]; + input.advance(); + continue scan; + } + } + break; + } +} + +// See lezer-generator/src/encode.ts for comments about the encoding +// used here +function decodeArray(input, Type = Uint16Array) { + if (typeof input != "string") + return input; + let array = null; + for (let pos = 0, out = 0; pos < input.length;) { + let value = 0; + for (;;) { + let next = input.charCodeAt(pos++), stop = false; + if (next == 126 /* BigValCode */) { + value = 65535 /* BigVal */; + break; + } + if (next >= 92 /* Gap2 */) + next--; + if (next >= 34 /* Gap1 */) + next--; + let digit = next - 32 /* Start */; + if (digit >= 46 /* Base */) { + digit -= 46 /* Base */; + stop = true; + } + value += digit; + if (stop) + break; + value *= 46 /* Base */; + } + if (array) + array[out++] = value; + else + array = new Type(value); + } + return array; +} + +// Environment variable used to control console output +const verbose = typeof process != "undefined" && process.env && /\bparse\b/.test(process.env.LOG); +let stackIDs = null; +var Safety; +(function (Safety) { + Safety[Safety["Margin"] = 25] = "Margin"; +})(Safety || (Safety = {})); +function cutAt(tree, pos, side) { + let cursor = tree.cursor(common.IterMode.IncludeAnonymous); + cursor.moveTo(pos); + for (;;) { + if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos))) + for (;;) { + if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError) + return side < 0 ? Math.max(0, Math.min(cursor.to - 1, pos - 25 /* Margin */)) + : Math.min(tree.length, Math.max(cursor.from + 1, pos + 25 /* Margin */)); + if (side < 0 ? cursor.prevSibling() : cursor.nextSibling()) + break; + if (!cursor.parent()) + return side < 0 ? 0 : tree.length; + } + } +} +class FragmentCursor { + constructor(fragments, nodeSet) { + this.fragments = fragments; + this.nodeSet = nodeSet; + this.i = 0; + this.fragment = null; + this.safeFrom = -1; + this.safeTo = -1; + this.trees = []; + this.start = []; + this.index = []; + this.nextFragment(); + } + nextFragment() { + let fr = this.fragment = this.i == this.fragments.length ? null : this.fragments[this.i++]; + if (fr) { + this.safeFrom = fr.openStart ? cutAt(fr.tree, fr.from + fr.offset, 1) - fr.offset : fr.from; + this.safeTo = fr.openEnd ? cutAt(fr.tree, fr.to + fr.offset, -1) - fr.offset : fr.to; + while (this.trees.length) { + this.trees.pop(); + this.start.pop(); + this.index.pop(); + } + this.trees.push(fr.tree); + this.start.push(-fr.offset); + this.index.push(0); + this.nextStart = this.safeFrom; + } + else { + this.nextStart = 1e9; + } + } + // `pos` must be >= any previously given `pos` for this cursor + nodeAt(pos) { + if (pos < this.nextStart) + return null; + while (this.fragment && this.safeTo <= pos) + this.nextFragment(); + if (!this.fragment) + return null; + for (;;) { + let last = this.trees.length - 1; + if (last < 0) { // End of tree + this.nextFragment(); + return null; + } + let top = this.trees[last], index = this.index[last]; + if (index == top.children.length) { + this.trees.pop(); + this.start.pop(); + this.index.pop(); + continue; + } + let next = top.children[index]; + let start = this.start[last] + top.positions[index]; + if (start > pos) { + this.nextStart = start; + return null; + } + if (next instanceof common.Tree) { + if (start == pos) { + if (start < this.safeFrom) + return null; + let end = start + next.length; + if (end <= this.safeTo) { + let lookAhead = next.prop(common.NodeProp.lookAhead); + if (!lookAhead || end + lookAhead < this.fragment.to) + return next; + } + } + this.index[last]++; + if (start + next.length >= Math.max(this.safeFrom, pos)) { // Enter this node + this.trees.push(next); + this.start.push(start); + this.index.push(0); + } + } + else { + this.index[last]++; + this.nextStart = start + next.length; + } + } + } +} +class TokenCache { + constructor(parser, stream) { + this.stream = stream; + this.tokens = []; + this.mainToken = null; + this.actions = []; + this.tokens = parser.tokenizers.map(_ => new CachedToken); + } + getActions(stack) { + let actionIndex = 0; + let main = null; + let { parser } = stack.p, { tokenizers } = parser; + let mask = parser.stateSlot(stack.state, 3 /* TokenizerMask */); + let context = stack.curContext ? stack.curContext.hash : 0; + let lookAhead = 0; + for (let i = 0; i < tokenizers.length; i++) { + if (((1 << i) & mask) == 0) + continue; + let tokenizer = tokenizers[i], token = this.tokens[i]; + if (main && !tokenizer.fallback) + continue; + if (tokenizer.contextual || token.start != stack.pos || token.mask != mask || token.context != context) { + this.updateCachedToken(token, tokenizer, stack); + token.mask = mask; + token.context = context; + } + if (token.lookAhead > token.end + 25 /* Margin */) + lookAhead = Math.max(token.lookAhead, lookAhead); + if (token.value != 0 /* Err */) { + let startIndex = actionIndex; + if (token.extended > -1) + actionIndex = this.addActions(stack, token.extended, token.end, actionIndex); + actionIndex = this.addActions(stack, token.value, token.end, actionIndex); + if (!tokenizer.extend) { + main = token; + if (actionIndex > startIndex) + break; + } + } + } + while (this.actions.length > actionIndex) + this.actions.pop(); + if (lookAhead) + stack.setLookAhead(lookAhead); + if (!main && stack.pos == this.stream.end) { + main = new CachedToken; + main.value = stack.p.parser.eofTerm; + main.start = main.end = stack.pos; + actionIndex = this.addActions(stack, main.value, main.end, actionIndex); + } + this.mainToken = main; + return this.actions; + } + getMainToken(stack) { + if (this.mainToken) + return this.mainToken; + let main = new CachedToken, { pos, p } = stack; + main.start = pos; + main.end = Math.min(pos + 1, p.stream.end); + main.value = pos == p.stream.end ? p.parser.eofTerm : 0 /* Err */; + return main; + } + updateCachedToken(token, tokenizer, stack) { + tokenizer.token(this.stream.reset(stack.pos, token), stack); + if (token.value > -1) { + let { parser } = stack.p; + for (let i = 0; i < parser.specialized.length; i++) + if (parser.specialized[i] == token.value) { + let result = parser.specializers[i](this.stream.read(token.start, token.end), stack); + if (result >= 0 && stack.p.parser.dialect.allows(result >> 1)) { + if ((result & 1) == 0 /* Specialize */) + token.value = result >> 1; + else + token.extended = result >> 1; + break; + } + } + } + else { + token.value = 0 /* Err */; + token.end = Math.min(stack.p.stream.end, stack.pos + 1); + } + } + putAction(action, token, end, index) { + // Don't add duplicate actions + for (let i = 0; i < index; i += 3) + if (this.actions[i] == action) + return index; + this.actions[index++] = action; + this.actions[index++] = token; + this.actions[index++] = end; + return index; + } + addActions(stack, token, end, index) { + let { state } = stack, { parser } = stack.p, { data } = parser; + for (let set = 0; set < 2; set++) { + for (let i = parser.stateSlot(state, set ? 2 /* Skip */ : 1 /* Actions */);; i += 3) { + if (data[i] == 65535 /* End */) { + if (data[i + 1] == 1 /* Next */) { + i = pair(data, i + 2); + } + else { + if (index == 0 && data[i + 1] == 2 /* Other */) + index = this.putAction(pair(data, i + 2), token, end, index); + break; + } + } + if (data[i] == token) + index = this.putAction(pair(data, i + 1), token, end, index); + } + } + return index; + } +} +var Rec; +(function (Rec) { + Rec[Rec["Distance"] = 5] = "Distance"; + Rec[Rec["MaxRemainingPerStep"] = 3] = "MaxRemainingPerStep"; + // When two stacks have been running independently long enough to + // add this many elements to their buffers, prune one. + Rec[Rec["MinBufferLengthPrune"] = 500] = "MinBufferLengthPrune"; + Rec[Rec["ForceReduceLimit"] = 10] = "ForceReduceLimit"; + // Once a stack reaches this depth (in .stack.length) force-reduce + // it back to CutTo to avoid creating trees that overflow the stack + // on recursive traversal. + Rec[Rec["CutDepth"] = 15000] = "CutDepth"; + Rec[Rec["CutTo"] = 9000] = "CutTo"; +})(Rec || (Rec = {})); +class Parse { + constructor(parser, input, fragments, ranges) { + this.parser = parser; + this.input = input; + this.ranges = ranges; + this.recovering = 0; + this.nextStackID = 0x2654; // ♔, ♕, ♖, ♗, ♘, ♙, ♠, ♡, ♢, ♣, ♤, ♥, ♦, ♧ + this.minStackPos = 0; + this.reused = []; + this.stoppedAt = null; + this.stream = new InputStream(input, ranges); + this.tokens = new TokenCache(parser, this.stream); + this.topTerm = parser.top[1]; + let { from } = ranges[0]; + this.stacks = [Stack.start(this, parser.top[0], from)]; + this.fragments = fragments.length && this.stream.end - from > parser.bufferLength * 4 + ? new FragmentCursor(fragments, parser.nodeSet) : null; + } + get parsedPos() { + return this.minStackPos; + } + // Move the parser forward. This will process all parse stacks at + // `this.pos` and try to advance them to a further position. If no + // stack for such a position is found, it'll start error-recovery. + // + // When the parse is finished, this will return a syntax tree. When + // not, it returns `null`. + advance() { + let stacks = this.stacks, pos = this.minStackPos; + // This will hold stacks beyond `pos`. + let newStacks = this.stacks = []; + let stopped, stoppedTokens; + // Keep advancing any stacks at `pos` until they either move + // forward or can't be advanced. Gather stacks that can't be + // advanced further in `stopped`. + for (let i = 0; i < stacks.length; i++) { + let stack = stacks[i]; + for (;;) { + this.tokens.mainToken = null; + if (stack.pos > pos) { + newStacks.push(stack); + } + else if (this.advanceStack(stack, newStacks, stacks)) { + continue; + } + else { + if (!stopped) { + stopped = []; + stoppedTokens = []; + } + stopped.push(stack); + let tok = this.tokens.getMainToken(stack); + stoppedTokens.push(tok.value, tok.end); + } + break; + } + } + if (!newStacks.length) { + let finished = stopped && findFinished(stopped); + if (finished) + return this.stackToTree(finished); + if (this.parser.strict) { + if (verbose && stopped) + console.log("Stuck with token " + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : "none")); + throw new SyntaxError("No parse at " + pos); + } + if (!this.recovering) + this.recovering = 5 /* Distance */; + } + if (this.recovering && stopped) { + let finished = this.stoppedAt != null && stopped[0].pos > this.stoppedAt ? stopped[0] + : this.runRecovery(stopped, stoppedTokens, newStacks); + if (finished) + return this.stackToTree(finished.forceAll()); + } + if (this.recovering) { + let maxRemaining = this.recovering == 1 ? 1 : this.recovering * 3 /* MaxRemainingPerStep */; + if (newStacks.length > maxRemaining) { + newStacks.sort((a, b) => b.score - a.score); + while (newStacks.length > maxRemaining) + newStacks.pop(); + } + if (newStacks.some(s => s.reducePos > pos)) + this.recovering--; + } + else if (newStacks.length > 1) { + // Prune stacks that are in the same state, or that have been + // running without splitting for a while, to avoid getting stuck + // with multiple successful stacks running endlessly on. + outer: for (let i = 0; i < newStacks.length - 1; i++) { + let stack = newStacks[i]; + for (let j = i + 1; j < newStacks.length; j++) { + let other = newStacks[j]; + if (stack.sameState(other) || + stack.buffer.length > 500 /* MinBufferLengthPrune */ && other.buffer.length > 500 /* MinBufferLengthPrune */) { + if (((stack.score - other.score) || (stack.buffer.length - other.buffer.length)) > 0) { + newStacks.splice(j--, 1); + } + else { + newStacks.splice(i--, 1); + continue outer; + } + } + } + } + } + this.minStackPos = newStacks[0].pos; + for (let i = 1; i < newStacks.length; i++) + if (newStacks[i].pos < this.minStackPos) + this.minStackPos = newStacks[i].pos; + return null; + } + stopAt(pos) { + if (this.stoppedAt != null && this.stoppedAt < pos) + throw new RangeError("Can't move stoppedAt forward"); + this.stoppedAt = pos; + } + // Returns an updated version of the given stack, or null if the + // stack can't advance normally. When `split` and `stacks` are + // given, stacks split off by ambiguous operations will be pushed to + // `split`, or added to `stacks` if they move `pos` forward. + advanceStack(stack, stacks, split) { + let start = stack.pos, { parser } = this; + let base = verbose ? this.stackID(stack) + " -> " : ""; + if (this.stoppedAt != null && start > this.stoppedAt) + return stack.forceReduce() ? stack : null; + if (this.fragments) { + let strictCx = stack.curContext && stack.curContext.tracker.strict, cxHash = strictCx ? stack.curContext.hash : 0; + for (let cached = this.fragments.nodeAt(start); cached;) { + let match = this.parser.nodeSet.types[cached.type.id] == cached.type ? parser.getGoto(stack.state, cached.type.id) : -1; + if (match > -1 && cached.length && (!strictCx || (cached.prop(common.NodeProp.contextHash) || 0) == cxHash)) { + stack.useNode(cached, match); + if (verbose) + console.log(base + this.stackID(stack) + ` (via reuse of ${parser.getName(cached.type.id)})`); + return true; + } + if (!(cached instanceof common.Tree) || cached.children.length == 0 || cached.positions[0] > 0) + break; + let inner = cached.children[0]; + if (inner instanceof common.Tree && cached.positions[0] == 0) + cached = inner; + else + break; + } + } + let defaultReduce = parser.stateSlot(stack.state, 4 /* DefaultReduce */); + if (defaultReduce > 0) { + stack.reduce(defaultReduce); + if (verbose) + console.log(base + this.stackID(stack) + ` (via always-reduce ${parser.getName(defaultReduce & 65535 /* ValueMask */)})`); + return true; + } + if (stack.stack.length >= 15000 /* CutDepth */) { + while (stack.stack.length > 9000 /* CutTo */ && stack.forceReduce()) { } + } + let actions = this.tokens.getActions(stack); + for (let i = 0; i < actions.length;) { + let action = actions[i++], term = actions[i++], end = actions[i++]; + let last = i == actions.length || !split; + let localStack = last ? stack : stack.split(); + localStack.apply(action, term, end); + if (verbose) + console.log(base + this.stackID(localStack) + ` (via ${(action & 65536 /* ReduceFlag */) == 0 ? "shift" + : `reduce of ${parser.getName(action & 65535 /* ValueMask */)}`} for ${parser.getName(term)} @ ${start}${localStack == stack ? "" : ", split"})`); + if (last) + return true; + else if (localStack.pos > start) + stacks.push(localStack); + else + split.push(localStack); + } + return false; + } + // Advance a given stack forward as far as it will go. Returns the + // (possibly updated) stack if it got stuck, or null if it moved + // forward and was given to `pushStackDedup`. + advanceFully(stack, newStacks) { + let pos = stack.pos; + for (;;) { + if (!this.advanceStack(stack, null, null)) + return false; + if (stack.pos > pos) { + pushStackDedup(stack, newStacks); + return true; + } + } + } + runRecovery(stacks, tokens, newStacks) { + let finished = null, restarted = false; + for (let i = 0; i < stacks.length; i++) { + let stack = stacks[i], token = tokens[i << 1], tokenEnd = tokens[(i << 1) + 1]; + let base = verbose ? this.stackID(stack) + " -> " : ""; + if (stack.deadEnd) { + if (restarted) + continue; + restarted = true; + stack.restart(); + if (verbose) + console.log(base + this.stackID(stack) + " (restarted)"); + let done = this.advanceFully(stack, newStacks); + if (done) + continue; + } + let force = stack.split(), forceBase = base; + for (let j = 0; force.forceReduce() && j < 10 /* ForceReduceLimit */; j++) { + if (verbose) + console.log(forceBase + this.stackID(force) + " (via force-reduce)"); + let done = this.advanceFully(force, newStacks); + if (done) + break; + if (verbose) + forceBase = this.stackID(force) + " -> "; + } + for (let insert of stack.recoverByInsert(token)) { + if (verbose) + console.log(base + this.stackID(insert) + " (via recover-insert)"); + this.advanceFully(insert, newStacks); + } + if (this.stream.end > stack.pos) { + if (tokenEnd == stack.pos) { + tokenEnd++; + token = 0 /* Err */; + } + stack.recoverByDelete(token, tokenEnd); + if (verbose) + console.log(base + this.stackID(stack) + ` (via recover-delete ${this.parser.getName(token)})`); + pushStackDedup(stack, newStacks); + } + else if (!finished || finished.score < stack.score) { + finished = stack; + } + } + return finished; + } + // Convert the stack's buffer to a syntax tree. + stackToTree(stack) { + stack.close(); + return common.Tree.build({ buffer: StackBufferCursor.create(stack), + nodeSet: this.parser.nodeSet, + topID: this.topTerm, + maxBufferLength: this.parser.bufferLength, + reused: this.reused, + start: this.ranges[0].from, + length: stack.pos - this.ranges[0].from, + minRepeatType: this.parser.minRepeatTerm }); + } + stackID(stack) { + let id = (stackIDs || (stackIDs = new WeakMap)).get(stack); + if (!id) + stackIDs.set(stack, id = String.fromCodePoint(this.nextStackID++)); + return id + stack; + } +} +function pushStackDedup(stack, newStacks) { + for (let i = 0; i < newStacks.length; i++) { + let other = newStacks[i]; + if (other.pos == stack.pos && other.sameState(stack)) { + if (newStacks[i].score < stack.score) + newStacks[i] = stack; + return; + } + } + newStacks.push(stack); +} +class Dialect { + constructor(source, flags, disabled) { + this.source = source; + this.flags = flags; + this.disabled = disabled; + } + allows(term) { return !this.disabled || this.disabled[term] == 0; } +} +const id = x => x; +/// Context trackers are used to track stateful context (such as +/// indentation in the Python grammar, or parent elements in the XML +/// grammar) needed by external tokenizers. You declare them in a +/// grammar file as `@context exportName from "module"`. +/// +/// Context values should be immutable, and can be updated (replaced) +/// on shift or reduce actions. +/// +/// The export used in a `@context` declaration should be of this +/// type. +class ContextTracker { + /// Define a context tracker. + constructor(spec) { + this.start = spec.start; + this.shift = spec.shift || id; + this.reduce = spec.reduce || id; + this.reuse = spec.reuse || id; + this.hash = spec.hash || (() => 0); + this.strict = spec.strict !== false; + } +} +/// Holds the parse tables for a given grammar, as generated by +/// `lezer-generator`, and provides [methods](#common.Parser) to parse +/// content with. +class LRParser extends common.Parser { + /// @internal + constructor(spec) { + super(); + /// @internal + this.wrappers = []; + if (spec.version != 14 /* Version */) + throw new RangeError(`Parser version (${spec.version}) doesn't match runtime version (${14 /* Version */})`); + let nodeNames = spec.nodeNames.split(" "); + this.minRepeatTerm = nodeNames.length; + for (let i = 0; i < spec.repeatNodeCount; i++) + nodeNames.push(""); + let topTerms = Object.keys(spec.topRules).map(r => spec.topRules[r][1]); + let nodeProps = []; + for (let i = 0; i < nodeNames.length; i++) + nodeProps.push([]); + function setProp(nodeID, prop, value) { + nodeProps[nodeID].push([prop, prop.deserialize(String(value))]); + } + if (spec.nodeProps) + for (let propSpec of spec.nodeProps) { + let prop = propSpec[0]; + if (typeof prop == "string") + prop = common.NodeProp[prop]; + for (let i = 1; i < propSpec.length;) { + let next = propSpec[i++]; + if (next >= 0) { + setProp(next, prop, propSpec[i++]); + } + else { + let value = propSpec[i + -next]; + for (let j = -next; j > 0; j--) + setProp(propSpec[i++], prop, value); + i++; + } + } + } + this.nodeSet = new common.NodeSet(nodeNames.map((name, i) => common.NodeType.define({ + name: i >= this.minRepeatTerm ? undefined : name, + id: i, + props: nodeProps[i], + top: topTerms.indexOf(i) > -1, + error: i == 0, + skipped: spec.skippedNodes && spec.skippedNodes.indexOf(i) > -1 + }))); + if (spec.propSources) + this.nodeSet = this.nodeSet.extend(...spec.propSources); + this.strict = false; + this.bufferLength = common.DefaultBufferLength; + let tokenArray = decodeArray(spec.tokenData); + this.context = spec.context; + this.specialized = new Uint16Array(spec.specialized ? spec.specialized.length : 0); + this.specializers = []; + if (spec.specialized) + for (let i = 0; i < spec.specialized.length; i++) { + this.specialized[i] = spec.specialized[i].term; + this.specializers[i] = spec.specialized[i].get; + } + this.states = decodeArray(spec.states, Uint32Array); + this.data = decodeArray(spec.stateData); + this.goto = decodeArray(spec.goto); + this.maxTerm = spec.maxTerm; + this.tokenizers = spec.tokenizers.map(value => typeof value == "number" ? new TokenGroup(tokenArray, value) : value); + this.topRules = spec.topRules; + this.dialects = spec.dialects || {}; + this.dynamicPrecedences = spec.dynamicPrecedences || null; + this.tokenPrecTable = spec.tokenPrec; + this.termNames = spec.termNames || null; + this.maxNode = this.nodeSet.types.length - 1; + this.dialect = this.parseDialect(); + this.top = this.topRules[Object.keys(this.topRules)[0]]; + } + createParse(input, fragments, ranges) { + let parse = new Parse(this, input, fragments, ranges); + for (let w of this.wrappers) + parse = w(parse, input, fragments, ranges); + return parse; + } + /// Get a goto table entry @internal + getGoto(state, term, loose = false) { + let table = this.goto; + if (term >= table[0]) + return -1; + for (let pos = table[term + 1];;) { + let groupTag = table[pos++], last = groupTag & 1; + let target = table[pos++]; + if (last && loose) + return target; + for (let end = pos + (groupTag >> 1); pos < end; pos++) + if (table[pos] == state) + return target; + if (last) + return -1; + } + } + /// Check if this state has an action for a given terminal @internal + hasAction(state, terminal) { + let data = this.data; + for (let set = 0; set < 2; set++) { + for (let i = this.stateSlot(state, set ? 2 /* Skip */ : 1 /* Actions */), next;; i += 3) { + if ((next = data[i]) == 65535 /* End */) { + if (data[i + 1] == 1 /* Next */) + next = data[i = pair(data, i + 2)]; + else if (data[i + 1] == 2 /* Other */) + return pair(data, i + 2); + else + break; + } + if (next == terminal || next == 0 /* Err */) + return pair(data, i + 1); + } + } + return 0; + } + /// @internal + stateSlot(state, slot) { + return this.states[(state * 6 /* Size */) + slot]; + } + /// @internal + stateFlag(state, flag) { + return (this.stateSlot(state, 0 /* Flags */) & flag) > 0; + } + /// @internal + validAction(state, action) { + if (action == this.stateSlot(state, 4 /* DefaultReduce */)) + return true; + for (let i = this.stateSlot(state, 1 /* Actions */);; i += 3) { + if (this.data[i] == 65535 /* End */) { + if (this.data[i + 1] == 1 /* Next */) + i = pair(this.data, i + 2); + else + return false; + } + if (action == pair(this.data, i + 1)) + return true; + } + } + /// Get the states that can follow this one through shift actions or + /// goto jumps. @internal + nextStates(state) { + let result = []; + for (let i = this.stateSlot(state, 1 /* Actions */);; i += 3) { + if (this.data[i] == 65535 /* End */) { + if (this.data[i + 1] == 1 /* Next */) + i = pair(this.data, i + 2); + else + break; + } + if ((this.data[i + 2] & (65536 /* ReduceFlag */ >> 16)) == 0) { + let value = this.data[i + 1]; + if (!result.some((v, i) => (i & 1) && v == value)) + result.push(this.data[i], value); + } + } + return result; + } + /// @internal + overrides(token, prev) { + let iPrev = findOffset(this.data, this.tokenPrecTable, prev); + return iPrev < 0 || findOffset(this.data, this.tokenPrecTable, token) < iPrev; + } + /// Configure the parser. Returns a new parser instance that has the + /// given settings modified. Settings not provided in `config` are + /// kept from the original parser. + configure(config) { + // Hideous reflection-based kludge to make it easy to create a + // slightly modified copy of a parser. + let copy = Object.assign(Object.create(LRParser.prototype), this); + if (config.props) + copy.nodeSet = this.nodeSet.extend(...config.props); + if (config.top) { + let info = this.topRules[config.top]; + if (!info) + throw new RangeError(`Invalid top rule name ${config.top}`); + copy.top = info; + } + if (config.tokenizers) + copy.tokenizers = this.tokenizers.map(t => { + let found = config.tokenizers.find(r => r.from == t); + return found ? found.to : t; + }); + if (config.contextTracker) + copy.context = config.contextTracker; + if (config.dialect) + copy.dialect = this.parseDialect(config.dialect); + if (config.strict != null) + copy.strict = config.strict; + if (config.wrap) + copy.wrappers = copy.wrappers.concat(config.wrap); + if (config.bufferLength != null) + copy.bufferLength = config.bufferLength; + return copy; + } + /// Tells you whether any [parse wrappers](#lr.ParserConfig.wrap) + /// are registered for this parser. + hasWrappers() { + return this.wrappers.length > 0; + } + /// Returns the name associated with a given term. This will only + /// work for all terms when the parser was generated with the + /// `--names` option. By default, only the names of tagged terms are + /// stored. + getName(term) { + return this.termNames ? this.termNames[term] : String(term <= this.maxNode && this.nodeSet.types[term].name || term); + } + /// The eof term id is always allocated directly after the node + /// types. @internal + get eofTerm() { return this.maxNode + 1; } + /// The type of top node produced by the parser. + get topNode() { return this.nodeSet.types[this.top[1]]; } + /// @internal + dynamicPrecedence(term) { + let prec = this.dynamicPrecedences; + return prec == null ? 0 : prec[term] || 0; + } + /// @internal + parseDialect(dialect) { + let values = Object.keys(this.dialects), flags = values.map(() => false); + if (dialect) + for (let part of dialect.split(" ")) { + let id = values.indexOf(part); + if (id >= 0) + flags[id] = true; + } + let disabled = null; + for (let i = 0; i < values.length; i++) + if (!flags[i]) { + for (let j = this.dialects[values[i]], id; (id = this.data[j++]) != 65535 /* End */;) + (disabled || (disabled = new Uint8Array(this.maxTerm + 1)))[id] = 1; + } + return new Dialect(dialect, flags, disabled); + } + /// (used by the output of the parser generator) @internal + static deserialize(spec) { + return new LRParser(spec); + } +} +function pair(data, off) { return data[off] | (data[off + 1] << 16); } +function findOffset(data, start, term) { + for (let i = start, next; (next = data[i]) != 65535 /* End */; i++) + if (next == term) + return i - start; + return -1; +} +function findFinished(stacks) { + let best = null; + for (let stack of stacks) { + let stopped = stack.p.stoppedAt; + if ((stack.pos == stack.p.stream.end || stopped != null && stack.pos > stopped) && + stack.p.parser.stateFlag(stack.state, 2 /* Accepting */) && + (!best || best.score < stack.score)) + best = stack; + } + return best; +} + +exports.ContextTracker = ContextTracker; +exports.ExternalTokenizer = ExternalTokenizer; +exports.InputStream = InputStream; +exports.LRParser = LRParser; +exports.Stack = Stack; diff --git a/node_modules/@lezer/lr/dist/index.d.ts b/node_modules/@lezer/lr/dist/index.d.ts new file mode 100644 index 0000000000..30fd6350dd --- /dev/null +++ b/node_modules/@lezer/lr/dist/index.d.ts @@ -0,0 +1,3 @@ +export { LRParser, ParserConfig, ContextTracker } from "./parse"; +export { InputStream, ExternalTokenizer } from "./token"; +export { Stack } from "./stack"; diff --git a/node_modules/@lezer/lr/dist/index.es.js b/node_modules/@lezer/lr/dist/index.es.js new file mode 100644 index 0000000000..156b328f13 --- /dev/null +++ b/node_modules/@lezer/lr/dist/index.es.js @@ -0,0 +1,1590 @@ +import { Parser, NodeSet, NodeType, DefaultBufferLength, NodeProp, Tree, IterMode } from '@lezer/common'; + +/// A parse stack. These are used internally by the parser to track +/// parsing progress. They also provide some properties and methods +/// that external code such as a tokenizer can use to get information +/// about the parse state. +class Stack { + /// @internal + constructor( + /// The parse that this stack is part of @internal + p, + /// Holds state, input pos, buffer index triplets for all but the + /// top state @internal + stack, + /// The current parse state @internal + state, + // The position at which the next reduce should take place. This + // can be less than `this.pos` when skipped expressions have been + // added to the stack (which should be moved outside of the next + // reduction) + /// @internal + reducePos, + /// The input position up to which this stack has parsed. + pos, + /// The dynamic score of the stack, including dynamic precedence + /// and error-recovery penalties + /// @internal + score, + // The output buffer. Holds (type, start, end, size) quads + // representing nodes created by the parser, where `size` is + // amount of buffer array entries covered by this node. + /// @internal + buffer, + // The base offset of the buffer. When stacks are split, the split + // instance shared the buffer history with its parent up to + // `bufferBase`, which is the absolute offset (including the + // offset of previous splits) into the buffer at which this stack + // starts writing. + /// @internal + bufferBase, + /// @internal + curContext, + /// @internal + lookAhead = 0, + // A parent stack from which this was split off, if any. This is + // set up so that it always points to a stack that has some + // additional buffer content, never to a stack with an equal + // `bufferBase`. + /// @internal + parent) { + this.p = p; + this.stack = stack; + this.state = state; + this.reducePos = reducePos; + this.pos = pos; + this.score = score; + this.buffer = buffer; + this.bufferBase = bufferBase; + this.curContext = curContext; + this.lookAhead = lookAhead; + this.parent = parent; + } + /// @internal + toString() { + return `[${this.stack.filter((_, i) => i % 3 == 0).concat(this.state)}]@${this.pos}${this.score ? "!" + this.score : ""}`; + } + // Start an empty stack + /// @internal + static start(p, state, pos = 0) { + let cx = p.parser.context; + return new Stack(p, [], state, pos, pos, 0, [], 0, cx ? new StackContext(cx, cx.start) : null, 0, null); + } + /// The stack's current [context](#lr.ContextTracker) value, if + /// any. Its type will depend on the context tracker's type + /// parameter, or it will be `null` if there is no context + /// tracker. + get context() { return this.curContext ? this.curContext.context : null; } + // Push a state onto the stack, tracking its start position as well + // as the buffer base at that point. + /// @internal + pushState(state, start) { + this.stack.push(this.state, start, this.bufferBase + this.buffer.length); + this.state = state; + } + // Apply a reduce action + /// @internal + reduce(action) { + let depth = action >> 19 /* ReduceDepthShift */, type = action & 65535 /* ValueMask */; + let { parser } = this.p; + let dPrec = parser.dynamicPrecedence(type); + if (dPrec) + this.score += dPrec; + if (depth == 0) { + this.pushState(parser.getGoto(this.state, type, true), this.reducePos); + // Zero-depth reductions are a special case—they add stuff to + // the stack without popping anything off. + if (type < parser.minRepeatTerm) + this.storeNode(type, this.reducePos, this.reducePos, 4, true); + this.reduceContext(type, this.reducePos); + return; + } + // Find the base index into `this.stack`, content after which will + // be dropped. Note that with `StayFlag` reductions we need to + // consume two extra frames (the dummy parent node for the skipped + // expression and the state that we'll be staying in, which should + // be moved to `this.state`). + let base = this.stack.length - ((depth - 1) * 3) - (action & 262144 /* StayFlag */ ? 6 : 0); + let start = this.stack[base - 2]; + let bufferBase = this.stack[base - 1], count = this.bufferBase + this.buffer.length - bufferBase; + // Store normal terms or `R -> R R` repeat reductions + if (type < parser.minRepeatTerm || (action & 131072 /* RepeatFlag */)) { + let pos = parser.stateFlag(this.state, 1 /* Skipped */) ? this.pos : this.reducePos; + this.storeNode(type, start, pos, count + 4, true); + } + if (action & 262144 /* StayFlag */) { + this.state = this.stack[base]; + } + else { + let baseStateID = this.stack[base - 3]; + this.state = parser.getGoto(baseStateID, type, true); + } + while (this.stack.length > base) + this.stack.pop(); + this.reduceContext(type, start); + } + // Shift a value into the buffer + /// @internal + storeNode(term, start, end, size = 4, isReduce = false) { + if (term == 0 /* Err */ && + (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) { + // Try to omit/merge adjacent error nodes + let cur = this, top = this.buffer.length; + if (top == 0 && cur.parent) { + top = cur.bufferBase - cur.parent.bufferBase; + cur = cur.parent; + } + if (top > 0 && cur.buffer[top - 4] == 0 /* Err */ && cur.buffer[top - 1] > -1) { + if (start == end) + return; + if (cur.buffer[top - 2] >= start) { + cur.buffer[top - 2] = end; + return; + } + } + } + if (!isReduce || this.pos == end) { // Simple case, just append + this.buffer.push(term, start, end, size); + } + else { // There may be skipped nodes that have to be moved forward + let index = this.buffer.length; + if (index > 0 && this.buffer[index - 4] != 0 /* Err */) + while (index > 0 && this.buffer[index - 2] > end) { + // Move this record forward + this.buffer[index] = this.buffer[index - 4]; + this.buffer[index + 1] = this.buffer[index - 3]; + this.buffer[index + 2] = this.buffer[index - 2]; + this.buffer[index + 3] = this.buffer[index - 1]; + index -= 4; + if (size > 4) + size -= 4; + } + this.buffer[index] = term; + this.buffer[index + 1] = start; + this.buffer[index + 2] = end; + this.buffer[index + 3] = size; + } + } + // Apply a shift action + /// @internal + shift(action, next, nextEnd) { + let start = this.pos; + if (action & 131072 /* GotoFlag */) { + this.pushState(action & 65535 /* ValueMask */, this.pos); + } + else if ((action & 262144 /* StayFlag */) == 0) { // Regular shift + let nextState = action, { parser } = this.p; + if (nextEnd > this.pos || next <= parser.maxNode) { + this.pos = nextEnd; + if (!parser.stateFlag(nextState, 1 /* Skipped */)) + this.reducePos = nextEnd; + } + this.pushState(nextState, start); + this.shiftContext(next, start); + if (next <= parser.maxNode) + this.buffer.push(next, start, nextEnd, 4); + } + else { // Shift-and-stay, which means this is a skipped token + this.pos = nextEnd; + this.shiftContext(next, start); + if (next <= this.p.parser.maxNode) + this.buffer.push(next, start, nextEnd, 4); + } + } + // Apply an action + /// @internal + apply(action, next, nextEnd) { + if (action & 65536 /* ReduceFlag */) + this.reduce(action); + else + this.shift(action, next, nextEnd); + } + // Add a prebuilt (reused) node into the buffer. + /// @internal + useNode(value, next) { + let index = this.p.reused.length - 1; + if (index < 0 || this.p.reused[index] != value) { + this.p.reused.push(value); + index++; + } + let start = this.pos; + this.reducePos = this.pos = start + value.length; + this.pushState(next, start); + this.buffer.push(index, start, this.reducePos, -1 /* size == -1 means this is a reused value */); + if (this.curContext) + this.updateContext(this.curContext.tracker.reuse(this.curContext.context, value, this, this.p.stream.reset(this.pos - value.length))); + } + // Split the stack. Due to the buffer sharing and the fact + // that `this.stack` tends to stay quite shallow, this isn't very + // expensive. + /// @internal + split() { + let parent = this; + let off = parent.buffer.length; + // Because the top of the buffer (after this.pos) may be mutated + // to reorder reductions and skipped tokens, and shared buffers + // should be immutable, this copies any outstanding skipped tokens + // to the new buffer, and puts the base pointer before them. + while (off > 0 && parent.buffer[off - 2] > parent.reducePos) + off -= 4; + let buffer = parent.buffer.slice(off), base = parent.bufferBase + off; + // Make sure parent points to an actual parent with content, if there is such a parent. + while (parent && base == parent.bufferBase) + parent = parent.parent; + return new Stack(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, buffer, base, this.curContext, this.lookAhead, parent); + } + // Try to recover from an error by 'deleting' (ignoring) one token. + /// @internal + recoverByDelete(next, nextEnd) { + let isNode = next <= this.p.parser.maxNode; + if (isNode) + this.storeNode(next, this.pos, nextEnd, 4); + this.storeNode(0 /* Err */, this.pos, nextEnd, isNode ? 8 : 4); + this.pos = this.reducePos = nextEnd; + this.score -= 190 /* Delete */; + } + /// Check if the given term would be able to be shifted (optionally + /// after some reductions) on this stack. This can be useful for + /// external tokenizers that want to make sure they only provide a + /// given token when it applies. + canShift(term) { + for (let sim = new SimulatedStack(this);;) { + let action = this.p.parser.stateSlot(sim.state, 4 /* DefaultReduce */) || this.p.parser.hasAction(sim.state, term); + if ((action & 65536 /* ReduceFlag */) == 0) + return true; + if (action == 0) + return false; + sim.reduce(action); + } + } + // Apply up to Recover.MaxNext recovery actions that conceptually + // inserts some missing token or rule. + /// @internal + recoverByInsert(next) { + if (this.stack.length >= 300 /* MaxInsertStackDepth */) + return []; + let nextStates = this.p.parser.nextStates(this.state); + if (nextStates.length > 4 /* MaxNext */ << 1 || this.stack.length >= 120 /* DampenInsertStackDepth */) { + let best = []; + for (let i = 0, s; i < nextStates.length; i += 2) { + if ((s = nextStates[i + 1]) != this.state && this.p.parser.hasAction(s, next)) + best.push(nextStates[i], s); + } + if (this.stack.length < 120 /* DampenInsertStackDepth */) + for (let i = 0; best.length < 4 /* MaxNext */ << 1 && i < nextStates.length; i += 2) { + let s = nextStates[i + 1]; + if (!best.some((v, i) => (i & 1) && v == s)) + best.push(nextStates[i], s); + } + nextStates = best; + } + let result = []; + for (let i = 0; i < nextStates.length && result.length < 4 /* MaxNext */; i += 2) { + let s = nextStates[i + 1]; + if (s == this.state) + continue; + let stack = this.split(); + stack.pushState(s, this.pos); + stack.storeNode(0 /* Err */, stack.pos, stack.pos, 4, true); + stack.shiftContext(nextStates[i], this.pos); + stack.score -= 200 /* Insert */; + result.push(stack); + } + return result; + } + // Force a reduce, if possible. Return false if that can't + // be done. + /// @internal + forceReduce() { + let reduce = this.p.parser.stateSlot(this.state, 5 /* ForcedReduce */); + if ((reduce & 65536 /* ReduceFlag */) == 0) + return false; + let { parser } = this.p; + if (!parser.validAction(this.state, reduce)) { + let depth = reduce >> 19 /* ReduceDepthShift */, term = reduce & 65535 /* ValueMask */; + let target = this.stack.length - depth * 3; + if (target < 0 || parser.getGoto(this.stack[target], term, false) < 0) + return false; + this.storeNode(0 /* Err */, this.reducePos, this.reducePos, 4, true); + this.score -= 100 /* Reduce */; + } + this.reducePos = this.pos; + this.reduce(reduce); + return true; + } + /// @internal + forceAll() { + while (!this.p.parser.stateFlag(this.state, 2 /* Accepting */)) { + if (!this.forceReduce()) { + this.storeNode(0 /* Err */, this.pos, this.pos, 4, true); + break; + } + } + return this; + } + /// Check whether this state has no further actions (assumed to be a direct descendant of the + /// top state, since any other states must be able to continue + /// somehow). @internal + get deadEnd() { + if (this.stack.length != 3) + return false; + let { parser } = this.p; + return parser.data[parser.stateSlot(this.state, 1 /* Actions */)] == 65535 /* End */ && + !parser.stateSlot(this.state, 4 /* DefaultReduce */); + } + /// Restart the stack (put it back in its start state). Only safe + /// when this.stack.length == 3 (state is directly below the top + /// state). @internal + restart() { + this.state = this.stack[0]; + this.stack.length = 0; + } + /// @internal + sameState(other) { + if (this.state != other.state || this.stack.length != other.stack.length) + return false; + for (let i = 0; i < this.stack.length; i += 3) + if (this.stack[i] != other.stack[i]) + return false; + return true; + } + /// Get the parser used by this stack. + get parser() { return this.p.parser; } + /// Test whether a given dialect (by numeric ID, as exported from + /// the terms file) is enabled. + dialectEnabled(dialectID) { return this.p.parser.dialect.flags[dialectID]; } + shiftContext(term, start) { + if (this.curContext) + this.updateContext(this.curContext.tracker.shift(this.curContext.context, term, this, this.p.stream.reset(start))); + } + reduceContext(term, start) { + if (this.curContext) + this.updateContext(this.curContext.tracker.reduce(this.curContext.context, term, this, this.p.stream.reset(start))); + } + /// @internal + emitContext() { + let last = this.buffer.length - 1; + if (last < 0 || this.buffer[last] != -3) + this.buffer.push(this.curContext.hash, this.reducePos, this.reducePos, -3); + } + /// @internal + emitLookAhead() { + let last = this.buffer.length - 1; + if (last < 0 || this.buffer[last] != -4) + this.buffer.push(this.lookAhead, this.reducePos, this.reducePos, -4); + } + updateContext(context) { + if (context != this.curContext.context) { + let newCx = new StackContext(this.curContext.tracker, context); + if (newCx.hash != this.curContext.hash) + this.emitContext(); + this.curContext = newCx; + } + } + /// @internal + setLookAhead(lookAhead) { + if (lookAhead > this.lookAhead) { + this.emitLookAhead(); + this.lookAhead = lookAhead; + } + } + /// @internal + close() { + if (this.curContext && this.curContext.tracker.strict) + this.emitContext(); + if (this.lookAhead > 0) + this.emitLookAhead(); + } +} +class StackContext { + constructor(tracker, context) { + this.tracker = tracker; + this.context = context; + this.hash = tracker.strict ? tracker.hash(context) : 0; + } +} +var Recover; +(function (Recover) { + Recover[Recover["Insert"] = 200] = "Insert"; + Recover[Recover["Delete"] = 190] = "Delete"; + Recover[Recover["Reduce"] = 100] = "Reduce"; + Recover[Recover["MaxNext"] = 4] = "MaxNext"; + Recover[Recover["MaxInsertStackDepth"] = 300] = "MaxInsertStackDepth"; + Recover[Recover["DampenInsertStackDepth"] = 120] = "DampenInsertStackDepth"; +})(Recover || (Recover = {})); +// Used to cheaply run some reductions to scan ahead without mutating +// an entire stack +class SimulatedStack { + constructor(start) { + this.start = start; + this.state = start.state; + this.stack = start.stack; + this.base = this.stack.length; + } + reduce(action) { + let term = action & 65535 /* ValueMask */, depth = action >> 19 /* ReduceDepthShift */; + if (depth == 0) { + if (this.stack == this.start.stack) + this.stack = this.stack.slice(); + this.stack.push(this.state, 0, 0); + this.base += 3; + } + else { + this.base -= (depth - 1) * 3; + } + let goto = this.start.p.parser.getGoto(this.stack[this.base - 3], term, true); + this.state = goto; + } +} +// This is given to `Tree.build` to build a buffer, and encapsulates +// the parent-stack-walking necessary to read the nodes. +class StackBufferCursor { + constructor(stack, pos, index) { + this.stack = stack; + this.pos = pos; + this.index = index; + this.buffer = stack.buffer; + if (this.index == 0) + this.maybeNext(); + } + static create(stack, pos = stack.bufferBase + stack.buffer.length) { + return new StackBufferCursor(stack, pos, pos - stack.bufferBase); + } + maybeNext() { + let next = this.stack.parent; + if (next != null) { + this.index = this.stack.bufferBase - next.bufferBase; + this.stack = next; + this.buffer = next.buffer; + } + } + 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]; } + next() { + this.index -= 4; + this.pos -= 4; + if (this.index == 0) + this.maybeNext(); + } + fork() { + return new StackBufferCursor(this.stack, this.pos, this.index); + } +} + +class CachedToken { + constructor() { + this.start = -1; + this.value = -1; + this.end = -1; + this.extended = -1; + this.lookAhead = 0; + this.mask = 0; + this.context = 0; + } +} +const nullToken = new CachedToken; +/// [Tokenizers](#lr.ExternalTokenizer) interact with the input +/// through this interface. It presents the input as a stream of +/// characters, tracking lookahead and hiding the complexity of +/// [ranges](#common.Parser.parse^ranges) from tokenizer code. +class InputStream { + /// @internal + constructor( + /// @internal + input, + /// @internal + ranges) { + this.input = input; + this.ranges = ranges; + /// @internal + this.chunk = ""; + /// @internal + this.chunkOff = 0; + /// Backup chunk + this.chunk2 = ""; + this.chunk2Pos = 0; + /// The character code of the next code unit in the input, or -1 + /// when the stream is at the end of the input. + this.next = -1; + /// @internal + this.token = nullToken; + this.rangeIndex = 0; + this.pos = this.chunkPos = ranges[0].from; + this.range = ranges[0]; + this.end = ranges[ranges.length - 1].to; + this.readNext(); + } + resolveOffset(offset, assoc) { + let range = this.range, index = this.rangeIndex; + let pos = this.pos + offset; + while (pos < range.from) { + if (!index) + return null; + let next = this.ranges[--index]; + pos -= range.from - next.to; + range = next; + } + while (assoc < 0 ? pos > range.to : pos >= range.to) { + if (index == this.ranges.length - 1) + return null; + let next = this.ranges[++index]; + pos += next.from - range.to; + range = next; + } + return pos; + } + /// Look at a code unit near the stream position. `.peek(0)` equals + /// `.next`, `.peek(-1)` gives you the previous character, and so + /// on. + /// + /// Note that looking around during tokenizing creates dependencies + /// on potentially far-away content, which may reduce the + /// effectiveness incremental parsing—when looking forward—or even + /// cause invalid reparses when looking backward more than 25 code + /// units, since the library does not track lookbehind. + peek(offset) { + let idx = this.chunkOff + offset, pos, result; + if (idx >= 0 && idx < this.chunk.length) { + pos = this.pos + offset; + result = this.chunk.charCodeAt(idx); + } + else { + let resolved = this.resolveOffset(offset, 1); + if (resolved == null) + return -1; + pos = resolved; + if (pos >= this.chunk2Pos && pos < this.chunk2Pos + this.chunk2.length) { + result = this.chunk2.charCodeAt(pos - this.chunk2Pos); + } + else { + let i = this.rangeIndex, range = this.range; + while (range.to <= pos) + range = this.ranges[++i]; + this.chunk2 = this.input.chunk(this.chunk2Pos = pos); + if (pos + this.chunk2.length > range.to) + this.chunk2 = this.chunk2.slice(0, range.to - pos); + result = this.chunk2.charCodeAt(0); + } + } + if (pos >= this.token.lookAhead) + this.token.lookAhead = pos + 1; + return result; + } + /// Accept a token. By default, the end of the token is set to the + /// current stream position, but you can pass an offset (relative to + /// the stream position) to change that. + acceptToken(token, endOffset = 0) { + let end = endOffset ? this.resolveOffset(endOffset, -1) : this.pos; + if (end == null || end < this.token.start) + throw new RangeError("Token end out of bounds"); + this.token.value = token; + this.token.end = end; + } + getChunk() { + if (this.pos >= this.chunk2Pos && this.pos < this.chunk2Pos + this.chunk2.length) { + let { chunk, chunkPos } = this; + this.chunk = this.chunk2; + this.chunkPos = this.chunk2Pos; + this.chunk2 = chunk; + this.chunk2Pos = chunkPos; + this.chunkOff = this.pos - this.chunkPos; + } + else { + this.chunk2 = this.chunk; + this.chunk2Pos = this.chunkPos; + let nextChunk = this.input.chunk(this.pos); + let end = this.pos + nextChunk.length; + this.chunk = end > this.range.to ? nextChunk.slice(0, this.range.to - this.pos) : nextChunk; + this.chunkPos = this.pos; + this.chunkOff = 0; + } + } + readNext() { + if (this.chunkOff >= this.chunk.length) { + this.getChunk(); + if (this.chunkOff == this.chunk.length) + return this.next = -1; + } + return this.next = this.chunk.charCodeAt(this.chunkOff); + } + /// Move the stream forward N (defaults to 1) code units. Returns + /// the new value of [`next`](#lr.InputStream.next). + advance(n = 1) { + this.chunkOff += n; + while (this.pos + n >= this.range.to) { + if (this.rangeIndex == this.ranges.length - 1) + return this.setDone(); + n -= this.range.to - this.pos; + this.range = this.ranges[++this.rangeIndex]; + this.pos = this.range.from; + } + this.pos += n; + if (this.pos >= this.token.lookAhead) + this.token.lookAhead = this.pos + 1; + return this.readNext(); + } + setDone() { + this.pos = this.chunkPos = this.end; + this.range = this.ranges[this.rangeIndex = this.ranges.length - 1]; + this.chunk = ""; + return this.next = -1; + } + /// @internal + reset(pos, token) { + if (token) { + this.token = token; + token.start = pos; + token.lookAhead = pos + 1; + token.value = token.extended = -1; + } + else { + this.token = nullToken; + } + if (this.pos != pos) { + this.pos = pos; + if (pos == this.end) { + this.setDone(); + return this; + } + while (pos < this.range.from) + this.range = this.ranges[--this.rangeIndex]; + while (pos >= this.range.to) + this.range = this.ranges[++this.rangeIndex]; + if (pos >= this.chunkPos && pos < this.chunkPos + this.chunk.length) { + this.chunkOff = pos - this.chunkPos; + } + else { + this.chunk = ""; + this.chunkOff = 0; + } + this.readNext(); + } + return this; + } + /// @internal + read(from, to) { + if (from >= this.chunkPos && to <= this.chunkPos + this.chunk.length) + return this.chunk.slice(from - this.chunkPos, to - this.chunkPos); + if (from >= this.chunk2Pos && to <= this.chunk2Pos + this.chunk2.length) + return this.chunk2.slice(from - this.chunk2Pos, to - this.chunk2Pos); + if (from >= this.range.from && to <= this.range.to) + return this.input.read(from, to); + let result = ""; + for (let r of this.ranges) { + if (r.from >= to) + break; + if (r.to > from) + result += this.input.read(Math.max(r.from, from), Math.min(r.to, to)); + } + return result; + } +} +/// @internal +class TokenGroup { + constructor(data, id) { + this.data = data; + this.id = id; + } + token(input, stack) { readToken(this.data, input, stack, this.id); } +} +TokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false; +/// `@external tokens` declarations in the grammar should resolve to +/// an instance of this class. +class ExternalTokenizer { + /// Create a tokenizer. The first argument is the function that, + /// given an input stream, scans for the types of tokens it + /// recognizes at the stream's position, and calls + /// [`acceptToken`](#lr.InputStream.acceptToken) when it finds + /// one. + constructor( + /// @internal + token, options = {}) { + this.token = token; + this.contextual = !!options.contextual; + this.fallback = !!options.fallback; + this.extend = !!options.extend; + } +} +// Tokenizer data is stored a big uint16 array containing, for each +// state: +// +// - A group bitmask, indicating what token groups are reachable from +// this state, so that paths that can only lead to tokens not in +// any of the current groups can be cut off early. +// +// - The position of the end of the state's sequence of accepting +// tokens +// +// - The number of outgoing edges for the state +// +// - The accepting tokens, as (token id, group mask) pairs +// +// - The outgoing edges, as (start character, end character, state +// index) triples, with end character being exclusive +// +// This function interprets that data, running through a stream as +// long as new states with the a matching group mask can be reached, +// and updating `token` when it matches a token. +function readToken(data, input, stack, group) { + let state = 0, groupMask = 1 << group, { parser } = stack.p, { dialect } = parser; + scan: for (;;) { + if ((groupMask & data[state]) == 0) + break; + let accEnd = data[state + 1]; + // Check whether this state can lead to a token in the current group + // Accept tokens in this state, possibly overwriting + // lower-precedence / shorter tokens + for (let i = state + 3; i < accEnd; i += 2) + if ((data[i + 1] & groupMask) > 0) { + let term = data[i]; + if (dialect.allows(term) && + (input.token.value == -1 || input.token.value == term || parser.overrides(term, input.token.value))) { + input.acceptToken(term); + break; + } + } + // Do a binary search on the state's edges + for (let next = input.next, low = 0, high = data[state + 2]; low < high;) { + let mid = (low + high) >> 1; + let index = accEnd + mid + (mid << 1); + let from = data[index], to = data[index + 1]; + if (next < from) + high = mid; + else if (next >= to) + low = mid + 1; + else { + state = data[index + 2]; + input.advance(); + continue scan; + } + } + break; + } +} + +// See lezer-generator/src/encode.ts for comments about the encoding +// used here +function decodeArray(input, Type = Uint16Array) { + if (typeof input != "string") + return input; + let array = null; + for (let pos = 0, out = 0; pos < input.length;) { + let value = 0; + for (;;) { + let next = input.charCodeAt(pos++), stop = false; + if (next == 126 /* BigValCode */) { + value = 65535 /* BigVal */; + break; + } + if (next >= 92 /* Gap2 */) + next--; + if (next >= 34 /* Gap1 */) + next--; + let digit = next - 32 /* Start */; + if (digit >= 46 /* Base */) { + digit -= 46 /* Base */; + stop = true; + } + value += digit; + if (stop) + break; + value *= 46 /* Base */; + } + if (array) + array[out++] = value; + else + array = new Type(value); + } + return array; +} + +// Environment variable used to control console output +const verbose = typeof process != "undefined" && process.env && /\bparse\b/.test(process.env.LOG); +let stackIDs = null; +var Safety; +(function (Safety) { + Safety[Safety["Margin"] = 25] = "Margin"; +})(Safety || (Safety = {})); +function cutAt(tree, pos, side) { + let cursor = tree.cursor(IterMode.IncludeAnonymous); + cursor.moveTo(pos); + for (;;) { + if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos))) + for (;;) { + if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError) + return side < 0 ? Math.max(0, Math.min(cursor.to - 1, pos - 25 /* Margin */)) + : Math.min(tree.length, Math.max(cursor.from + 1, pos + 25 /* Margin */)); + if (side < 0 ? cursor.prevSibling() : cursor.nextSibling()) + break; + if (!cursor.parent()) + return side < 0 ? 0 : tree.length; + } + } +} +class FragmentCursor { + constructor(fragments, nodeSet) { + this.fragments = fragments; + this.nodeSet = nodeSet; + this.i = 0; + this.fragment = null; + this.safeFrom = -1; + this.safeTo = -1; + this.trees = []; + this.start = []; + this.index = []; + this.nextFragment(); + } + nextFragment() { + let fr = this.fragment = this.i == this.fragments.length ? null : this.fragments[this.i++]; + if (fr) { + this.safeFrom = fr.openStart ? cutAt(fr.tree, fr.from + fr.offset, 1) - fr.offset : fr.from; + this.safeTo = fr.openEnd ? cutAt(fr.tree, fr.to + fr.offset, -1) - fr.offset : fr.to; + while (this.trees.length) { + this.trees.pop(); + this.start.pop(); + this.index.pop(); + } + this.trees.push(fr.tree); + this.start.push(-fr.offset); + this.index.push(0); + this.nextStart = this.safeFrom; + } + else { + this.nextStart = 1e9; + } + } + // `pos` must be >= any previously given `pos` for this cursor + nodeAt(pos) { + if (pos < this.nextStart) + return null; + while (this.fragment && this.safeTo <= pos) + this.nextFragment(); + if (!this.fragment) + return null; + for (;;) { + let last = this.trees.length - 1; + if (last < 0) { // End of tree + this.nextFragment(); + return null; + } + let top = this.trees[last], index = this.index[last]; + if (index == top.children.length) { + this.trees.pop(); + this.start.pop(); + this.index.pop(); + continue; + } + let next = top.children[index]; + let start = this.start[last] + top.positions[index]; + if (start > pos) { + this.nextStart = start; + return null; + } + if (next instanceof Tree) { + if (start == pos) { + if (start < this.safeFrom) + return null; + let end = start + next.length; + if (end <= this.safeTo) { + let lookAhead = next.prop(NodeProp.lookAhead); + if (!lookAhead || end + lookAhead < this.fragment.to) + return next; + } + } + this.index[last]++; + if (start + next.length >= Math.max(this.safeFrom, pos)) { // Enter this node + this.trees.push(next); + this.start.push(start); + this.index.push(0); + } + } + else { + this.index[last]++; + this.nextStart = start + next.length; + } + } + } +} +class TokenCache { + constructor(parser, stream) { + this.stream = stream; + this.tokens = []; + this.mainToken = null; + this.actions = []; + this.tokens = parser.tokenizers.map(_ => new CachedToken); + } + getActions(stack) { + let actionIndex = 0; + let main = null; + let { parser } = stack.p, { tokenizers } = parser; + let mask = parser.stateSlot(stack.state, 3 /* TokenizerMask */); + let context = stack.curContext ? stack.curContext.hash : 0; + let lookAhead = 0; + for (let i = 0; i < tokenizers.length; i++) { + if (((1 << i) & mask) == 0) + continue; + let tokenizer = tokenizers[i], token = this.tokens[i]; + if (main && !tokenizer.fallback) + continue; + if (tokenizer.contextual || token.start != stack.pos || token.mask != mask || token.context != context) { + this.updateCachedToken(token, tokenizer, stack); + token.mask = mask; + token.context = context; + } + if (token.lookAhead > token.end + 25 /* Margin */) + lookAhead = Math.max(token.lookAhead, lookAhead); + if (token.value != 0 /* Err */) { + let startIndex = actionIndex; + if (token.extended > -1) + actionIndex = this.addActions(stack, token.extended, token.end, actionIndex); + actionIndex = this.addActions(stack, token.value, token.end, actionIndex); + if (!tokenizer.extend) { + main = token; + if (actionIndex > startIndex) + break; + } + } + } + while (this.actions.length > actionIndex) + this.actions.pop(); + if (lookAhead) + stack.setLookAhead(lookAhead); + if (!main && stack.pos == this.stream.end) { + main = new CachedToken; + main.value = stack.p.parser.eofTerm; + main.start = main.end = stack.pos; + actionIndex = this.addActions(stack, main.value, main.end, actionIndex); + } + this.mainToken = main; + return this.actions; + } + getMainToken(stack) { + if (this.mainToken) + return this.mainToken; + let main = new CachedToken, { pos, p } = stack; + main.start = pos; + main.end = Math.min(pos + 1, p.stream.end); + main.value = pos == p.stream.end ? p.parser.eofTerm : 0 /* Err */; + return main; + } + updateCachedToken(token, tokenizer, stack) { + tokenizer.token(this.stream.reset(stack.pos, token), stack); + if (token.value > -1) { + let { parser } = stack.p; + for (let i = 0; i < parser.specialized.length; i++) + if (parser.specialized[i] == token.value) { + let result = parser.specializers[i](this.stream.read(token.start, token.end), stack); + if (result >= 0 && stack.p.parser.dialect.allows(result >> 1)) { + if ((result & 1) == 0 /* Specialize */) + token.value = result >> 1; + else + token.extended = result >> 1; + break; + } + } + } + else { + token.value = 0 /* Err */; + token.end = Math.min(stack.p.stream.end, stack.pos + 1); + } + } + putAction(action, token, end, index) { + // Don't add duplicate actions + for (let i = 0; i < index; i += 3) + if (this.actions[i] == action) + return index; + this.actions[index++] = action; + this.actions[index++] = token; + this.actions[index++] = end; + return index; + } + addActions(stack, token, end, index) { + let { state } = stack, { parser } = stack.p, { data } = parser; + for (let set = 0; set < 2; set++) { + for (let i = parser.stateSlot(state, set ? 2 /* Skip */ : 1 /* Actions */);; i += 3) { + if (data[i] == 65535 /* End */) { + if (data[i + 1] == 1 /* Next */) { + i = pair(data, i + 2); + } + else { + if (index == 0 && data[i + 1] == 2 /* Other */) + index = this.putAction(pair(data, i + 2), token, end, index); + break; + } + } + if (data[i] == token) + index = this.putAction(pair(data, i + 1), token, end, index); + } + } + return index; + } +} +var Rec; +(function (Rec) { + Rec[Rec["Distance"] = 5] = "Distance"; + Rec[Rec["MaxRemainingPerStep"] = 3] = "MaxRemainingPerStep"; + // When two stacks have been running independently long enough to + // add this many elements to their buffers, prune one. + Rec[Rec["MinBufferLengthPrune"] = 500] = "MinBufferLengthPrune"; + Rec[Rec["ForceReduceLimit"] = 10] = "ForceReduceLimit"; + // Once a stack reaches this depth (in .stack.length) force-reduce + // it back to CutTo to avoid creating trees that overflow the stack + // on recursive traversal. + Rec[Rec["CutDepth"] = 15000] = "CutDepth"; + Rec[Rec["CutTo"] = 9000] = "CutTo"; +})(Rec || (Rec = {})); +class Parse { + constructor(parser, input, fragments, ranges) { + this.parser = parser; + this.input = input; + this.ranges = ranges; + this.recovering = 0; + this.nextStackID = 0x2654; // ♔, ♕, ♖, ♗, ♘, ♙, ♠, ♡, ♢, ♣, ♤, ♥, ♦, ♧ + this.minStackPos = 0; + this.reused = []; + this.stoppedAt = null; + this.stream = new InputStream(input, ranges); + this.tokens = new TokenCache(parser, this.stream); + this.topTerm = parser.top[1]; + let { from } = ranges[0]; + this.stacks = [Stack.start(this, parser.top[0], from)]; + this.fragments = fragments.length && this.stream.end - from > parser.bufferLength * 4 + ? new FragmentCursor(fragments, parser.nodeSet) : null; + } + get parsedPos() { + return this.minStackPos; + } + // Move the parser forward. This will process all parse stacks at + // `this.pos` and try to advance them to a further position. If no + // stack for such a position is found, it'll start error-recovery. + // + // When the parse is finished, this will return a syntax tree. When + // not, it returns `null`. + advance() { + let stacks = this.stacks, pos = this.minStackPos; + // This will hold stacks beyond `pos`. + let newStacks = this.stacks = []; + let stopped, stoppedTokens; + // Keep advancing any stacks at `pos` until they either move + // forward or can't be advanced. Gather stacks that can't be + // advanced further in `stopped`. + for (let i = 0; i < stacks.length; i++) { + let stack = stacks[i]; + for (;;) { + this.tokens.mainToken = null; + if (stack.pos > pos) { + newStacks.push(stack); + } + else if (this.advanceStack(stack, newStacks, stacks)) { + continue; + } + else { + if (!stopped) { + stopped = []; + stoppedTokens = []; + } + stopped.push(stack); + let tok = this.tokens.getMainToken(stack); + stoppedTokens.push(tok.value, tok.end); + } + break; + } + } + if (!newStacks.length) { + let finished = stopped && findFinished(stopped); + if (finished) + return this.stackToTree(finished); + if (this.parser.strict) { + if (verbose && stopped) + console.log("Stuck with token " + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : "none")); + throw new SyntaxError("No parse at " + pos); + } + if (!this.recovering) + this.recovering = 5 /* Distance */; + } + if (this.recovering && stopped) { + let finished = this.stoppedAt != null && stopped[0].pos > this.stoppedAt ? stopped[0] + : this.runRecovery(stopped, stoppedTokens, newStacks); + if (finished) + return this.stackToTree(finished.forceAll()); + } + if (this.recovering) { + let maxRemaining = this.recovering == 1 ? 1 : this.recovering * 3 /* MaxRemainingPerStep */; + if (newStacks.length > maxRemaining) { + newStacks.sort((a, b) => b.score - a.score); + while (newStacks.length > maxRemaining) + newStacks.pop(); + } + if (newStacks.some(s => s.reducePos > pos)) + this.recovering--; + } + else if (newStacks.length > 1) { + // Prune stacks that are in the same state, or that have been + // running without splitting for a while, to avoid getting stuck + // with multiple successful stacks running endlessly on. + outer: for (let i = 0; i < newStacks.length - 1; i++) { + let stack = newStacks[i]; + for (let j = i + 1; j < newStacks.length; j++) { + let other = newStacks[j]; + if (stack.sameState(other) || + stack.buffer.length > 500 /* MinBufferLengthPrune */ && other.buffer.length > 500 /* MinBufferLengthPrune */) { + if (((stack.score - other.score) || (stack.buffer.length - other.buffer.length)) > 0) { + newStacks.splice(j--, 1); + } + else { + newStacks.splice(i--, 1); + continue outer; + } + } + } + } + } + this.minStackPos = newStacks[0].pos; + for (let i = 1; i < newStacks.length; i++) + if (newStacks[i].pos < this.minStackPos) + this.minStackPos = newStacks[i].pos; + return null; + } + stopAt(pos) { + if (this.stoppedAt != null && this.stoppedAt < pos) + throw new RangeError("Can't move stoppedAt forward"); + this.stoppedAt = pos; + } + // Returns an updated version of the given stack, or null if the + // stack can't advance normally. When `split` and `stacks` are + // given, stacks split off by ambiguous operations will be pushed to + // `split`, or added to `stacks` if they move `pos` forward. + advanceStack(stack, stacks, split) { + let start = stack.pos, { parser } = this; + let base = verbose ? this.stackID(stack) + " -> " : ""; + if (this.stoppedAt != null && start > this.stoppedAt) + return stack.forceReduce() ? stack : null; + if (this.fragments) { + let strictCx = stack.curContext && stack.curContext.tracker.strict, cxHash = strictCx ? stack.curContext.hash : 0; + for (let cached = this.fragments.nodeAt(start); cached;) { + let match = this.parser.nodeSet.types[cached.type.id] == cached.type ? parser.getGoto(stack.state, cached.type.id) : -1; + if (match > -1 && cached.length && (!strictCx || (cached.prop(NodeProp.contextHash) || 0) == cxHash)) { + stack.useNode(cached, match); + if (verbose) + console.log(base + this.stackID(stack) + ` (via reuse of ${parser.getName(cached.type.id)})`); + return true; + } + if (!(cached instanceof Tree) || cached.children.length == 0 || cached.positions[0] > 0) + break; + let inner = cached.children[0]; + if (inner instanceof Tree && cached.positions[0] == 0) + cached = inner; + else + break; + } + } + let defaultReduce = parser.stateSlot(stack.state, 4 /* DefaultReduce */); + if (defaultReduce > 0) { + stack.reduce(defaultReduce); + if (verbose) + console.log(base + this.stackID(stack) + ` (via always-reduce ${parser.getName(defaultReduce & 65535 /* ValueMask */)})`); + return true; + } + if (stack.stack.length >= 15000 /* CutDepth */) { + while (stack.stack.length > 9000 /* CutTo */ && stack.forceReduce()) { } + } + let actions = this.tokens.getActions(stack); + for (let i = 0; i < actions.length;) { + let action = actions[i++], term = actions[i++], end = actions[i++]; + let last = i == actions.length || !split; + let localStack = last ? stack : stack.split(); + localStack.apply(action, term, end); + if (verbose) + console.log(base + this.stackID(localStack) + ` (via ${(action & 65536 /* ReduceFlag */) == 0 ? "shift" + : `reduce of ${parser.getName(action & 65535 /* ValueMask */)}`} for ${parser.getName(term)} @ ${start}${localStack == stack ? "" : ", split"})`); + if (last) + return true; + else if (localStack.pos > start) + stacks.push(localStack); + else + split.push(localStack); + } + return false; + } + // Advance a given stack forward as far as it will go. Returns the + // (possibly updated) stack if it got stuck, or null if it moved + // forward and was given to `pushStackDedup`. + advanceFully(stack, newStacks) { + let pos = stack.pos; + for (;;) { + if (!this.advanceStack(stack, null, null)) + return false; + if (stack.pos > pos) { + pushStackDedup(stack, newStacks); + return true; + } + } + } + runRecovery(stacks, tokens, newStacks) { + let finished = null, restarted = false; + for (let i = 0; i < stacks.length; i++) { + let stack = stacks[i], token = tokens[i << 1], tokenEnd = tokens[(i << 1) + 1]; + let base = verbose ? this.stackID(stack) + " -> " : ""; + if (stack.deadEnd) { + if (restarted) + continue; + restarted = true; + stack.restart(); + if (verbose) + console.log(base + this.stackID(stack) + " (restarted)"); + let done = this.advanceFully(stack, newStacks); + if (done) + continue; + } + let force = stack.split(), forceBase = base; + for (let j = 0; force.forceReduce() && j < 10 /* ForceReduceLimit */; j++) { + if (verbose) + console.log(forceBase + this.stackID(force) + " (via force-reduce)"); + let done = this.advanceFully(force, newStacks); + if (done) + break; + if (verbose) + forceBase = this.stackID(force) + " -> "; + } + for (let insert of stack.recoverByInsert(token)) { + if (verbose) + console.log(base + this.stackID(insert) + " (via recover-insert)"); + this.advanceFully(insert, newStacks); + } + if (this.stream.end > stack.pos) { + if (tokenEnd == stack.pos) { + tokenEnd++; + token = 0 /* Err */; + } + stack.recoverByDelete(token, tokenEnd); + if (verbose) + console.log(base + this.stackID(stack) + ` (via recover-delete ${this.parser.getName(token)})`); + pushStackDedup(stack, newStacks); + } + else if (!finished || finished.score < stack.score) { + finished = stack; + } + } + return finished; + } + // Convert the stack's buffer to a syntax tree. + stackToTree(stack) { + stack.close(); + return Tree.build({ buffer: StackBufferCursor.create(stack), + nodeSet: this.parser.nodeSet, + topID: this.topTerm, + maxBufferLength: this.parser.bufferLength, + reused: this.reused, + start: this.ranges[0].from, + length: stack.pos - this.ranges[0].from, + minRepeatType: this.parser.minRepeatTerm }); + } + stackID(stack) { + let id = (stackIDs || (stackIDs = new WeakMap)).get(stack); + if (!id) + stackIDs.set(stack, id = String.fromCodePoint(this.nextStackID++)); + return id + stack; + } +} +function pushStackDedup(stack, newStacks) { + for (let i = 0; i < newStacks.length; i++) { + let other = newStacks[i]; + if (other.pos == stack.pos && other.sameState(stack)) { + if (newStacks[i].score < stack.score) + newStacks[i] = stack; + return; + } + } + newStacks.push(stack); +} +class Dialect { + constructor(source, flags, disabled) { + this.source = source; + this.flags = flags; + this.disabled = disabled; + } + allows(term) { return !this.disabled || this.disabled[term] == 0; } +} +const id = x => x; +/// Context trackers are used to track stateful context (such as +/// indentation in the Python grammar, or parent elements in the XML +/// grammar) needed by external tokenizers. You declare them in a +/// grammar file as `@context exportName from "module"`. +/// +/// Context values should be immutable, and can be updated (replaced) +/// on shift or reduce actions. +/// +/// The export used in a `@context` declaration should be of this +/// type. +class ContextTracker { + /// Define a context tracker. + constructor(spec) { + this.start = spec.start; + this.shift = spec.shift || id; + this.reduce = spec.reduce || id; + this.reuse = spec.reuse || id; + this.hash = spec.hash || (() => 0); + this.strict = spec.strict !== false; + } +} +/// A parser holds the parse tables for a given grammar, as generated +/// by `lezer-generator`. +class LRParser extends Parser { + /// @internal + constructor(spec) { + super(); + /// @internal + this.wrappers = []; + if (spec.version != 14 /* Version */) + throw new RangeError(`Parser version (${spec.version}) doesn't match runtime version (${14 /* Version */})`); + let nodeNames = spec.nodeNames.split(" "); + this.minRepeatTerm = nodeNames.length; + for (let i = 0; i < spec.repeatNodeCount; i++) + nodeNames.push(""); + let topTerms = Object.keys(spec.topRules).map(r => spec.topRules[r][1]); + let nodeProps = []; + for (let i = 0; i < nodeNames.length; i++) + nodeProps.push([]); + function setProp(nodeID, prop, value) { + nodeProps[nodeID].push([prop, prop.deserialize(String(value))]); + } + if (spec.nodeProps) + for (let propSpec of spec.nodeProps) { + let prop = propSpec[0]; + if (typeof prop == "string") + prop = NodeProp[prop]; + for (let i = 1; i < propSpec.length;) { + let next = propSpec[i++]; + if (next >= 0) { + setProp(next, prop, propSpec[i++]); + } + else { + let value = propSpec[i + -next]; + for (let j = -next; j > 0; j--) + setProp(propSpec[i++], prop, value); + i++; + } + } + } + this.nodeSet = new NodeSet(nodeNames.map((name, i) => NodeType.define({ + name: i >= this.minRepeatTerm ? undefined : name, + id: i, + props: nodeProps[i], + top: topTerms.indexOf(i) > -1, + error: i == 0, + skipped: spec.skippedNodes && spec.skippedNodes.indexOf(i) > -1 + }))); + if (spec.propSources) + this.nodeSet = this.nodeSet.extend(...spec.propSources); + this.strict = false; + this.bufferLength = DefaultBufferLength; + let tokenArray = decodeArray(spec.tokenData); + this.context = spec.context; + this.specialized = new Uint16Array(spec.specialized ? spec.specialized.length : 0); + this.specializers = []; + if (spec.specialized) + for (let i = 0; i < spec.specialized.length; i++) { + this.specialized[i] = spec.specialized[i].term; + this.specializers[i] = spec.specialized[i].get; + } + this.states = decodeArray(spec.states, Uint32Array); + this.data = decodeArray(spec.stateData); + this.goto = decodeArray(spec.goto); + this.maxTerm = spec.maxTerm; + this.tokenizers = spec.tokenizers.map(value => typeof value == "number" ? new TokenGroup(tokenArray, value) : value); + this.topRules = spec.topRules; + this.dialects = spec.dialects || {}; + this.dynamicPrecedences = spec.dynamicPrecedences || null; + this.tokenPrecTable = spec.tokenPrec; + this.termNames = spec.termNames || null; + this.maxNode = this.nodeSet.types.length - 1; + this.dialect = this.parseDialect(); + this.top = this.topRules[Object.keys(this.topRules)[0]]; + } + createParse(input, fragments, ranges) { + let parse = new Parse(this, input, fragments, ranges); + for (let w of this.wrappers) + parse = w(parse, input, fragments, ranges); + return parse; + } + /// Get a goto table entry @internal + getGoto(state, term, loose = false) { + let table = this.goto; + if (term >= table[0]) + return -1; + for (let pos = table[term + 1];;) { + let groupTag = table[pos++], last = groupTag & 1; + let target = table[pos++]; + if (last && loose) + return target; + for (let end = pos + (groupTag >> 1); pos < end; pos++) + if (table[pos] == state) + return target; + if (last) + return -1; + } + } + /// Check if this state has an action for a given terminal @internal + hasAction(state, terminal) { + let data = this.data; + for (let set = 0; set < 2; set++) { + for (let i = this.stateSlot(state, set ? 2 /* Skip */ : 1 /* Actions */), next;; i += 3) { + if ((next = data[i]) == 65535 /* End */) { + if (data[i + 1] == 1 /* Next */) + next = data[i = pair(data, i + 2)]; + else if (data[i + 1] == 2 /* Other */) + return pair(data, i + 2); + else + break; + } + if (next == terminal || next == 0 /* Err */) + return pair(data, i + 1); + } + } + return 0; + } + /// @internal + stateSlot(state, slot) { + return this.states[(state * 6 /* Size */) + slot]; + } + /// @internal + stateFlag(state, flag) { + return (this.stateSlot(state, 0 /* Flags */) & flag) > 0; + } + /// @internal + validAction(state, action) { + if (action == this.stateSlot(state, 4 /* DefaultReduce */)) + return true; + for (let i = this.stateSlot(state, 1 /* Actions */);; i += 3) { + if (this.data[i] == 65535 /* End */) { + if (this.data[i + 1] == 1 /* Next */) + i = pair(this.data, i + 2); + else + return false; + } + if (action == pair(this.data, i + 1)) + return true; + } + } + /// Get the states that can follow this one through shift actions or + /// goto jumps. @internal + nextStates(state) { + let result = []; + for (let i = this.stateSlot(state, 1 /* Actions */);; i += 3) { + if (this.data[i] == 65535 /* End */) { + if (this.data[i + 1] == 1 /* Next */) + i = pair(this.data, i + 2); + else + break; + } + if ((this.data[i + 2] & (65536 /* ReduceFlag */ >> 16)) == 0) { + let value = this.data[i + 1]; + if (!result.some((v, i) => (i & 1) && v == value)) + result.push(this.data[i], value); + } + } + return result; + } + /// @internal + overrides(token, prev) { + let iPrev = findOffset(this.data, this.tokenPrecTable, prev); + return iPrev < 0 || findOffset(this.data, this.tokenPrecTable, token) < iPrev; + } + /// Configure the parser. Returns a new parser instance that has the + /// given settings modified. Settings not provided in `config` are + /// kept from the original parser. + configure(config) { + // Hideous reflection-based kludge to make it easy to create a + // slightly modified copy of a parser. + let copy = Object.assign(Object.create(LRParser.prototype), this); + if (config.props) + copy.nodeSet = this.nodeSet.extend(...config.props); + if (config.top) { + let info = this.topRules[config.top]; + if (!info) + throw new RangeError(`Invalid top rule name ${config.top}`); + copy.top = info; + } + if (config.tokenizers) + copy.tokenizers = this.tokenizers.map(t => { + let found = config.tokenizers.find(r => r.from == t); + return found ? found.to : t; + }); + if (config.contextTracker) + copy.context = config.contextTracker; + if (config.dialect) + copy.dialect = this.parseDialect(config.dialect); + if (config.strict != null) + copy.strict = config.strict; + if (config.wrap) + copy.wrappers = copy.wrappers.concat(config.wrap); + if (config.bufferLength != null) + copy.bufferLength = config.bufferLength; + return copy; + } + /// Tells you whether any [parse wrappers](#lr.ParserConfig.wrap) + /// are registered for this parser. + hasWrappers() { + return this.wrappers.length > 0; + } + /// Returns the name associated with a given term. This will only + /// work for all terms when the parser was generated with the + /// `--names` option. By default, only the names of tagged terms are + /// stored. + getName(term) { + return this.termNames ? this.termNames[term] : String(term <= this.maxNode && this.nodeSet.types[term].name || term); + } + /// The eof term id is always allocated directly after the node + /// types. @internal + get eofTerm() { return this.maxNode + 1; } + /// The type of top node produced by the parser. + get topNode() { return this.nodeSet.types[this.top[1]]; } + /// @internal + dynamicPrecedence(term) { + let prec = this.dynamicPrecedences; + return prec == null ? 0 : prec[term] || 0; + } + /// @internal + parseDialect(dialect) { + let values = Object.keys(this.dialects), flags = values.map(() => false); + if (dialect) + for (let part of dialect.split(" ")) { + let id = values.indexOf(part); + if (id >= 0) + flags[id] = true; + } + let disabled = null; + for (let i = 0; i < values.length; i++) + if (!flags[i]) { + for (let j = this.dialects[values[i]], id; (id = this.data[j++]) != 65535 /* End */;) + (disabled || (disabled = new Uint8Array(this.maxTerm + 1)))[id] = 1; + } + return new Dialect(dialect, flags, disabled); + } + /// (used by the output of the parser generator) @internal + static deserialize(spec) { + return new LRParser(spec); + } +} +function pair(data, off) { return data[off] | (data[off + 1] << 16); } +function findOffset(data, start, term) { + for (let i = start, next; (next = data[i]) != 65535 /* End */; i++) + if (next == term) + return i - start; + return -1; +} +function findFinished(stacks) { + let best = null; + for (let stack of stacks) { + let stopped = stack.p.stoppedAt; + if ((stack.pos == stack.p.stream.end || stopped != null && stack.pos > stopped) && + stack.p.parser.stateFlag(stack.state, 2 /* Accepting */) && + (!best || best.score < stack.score)) + best = stack; + } + return best; +} + +export { ContextTracker, ExternalTokenizer, InputStream, LRParser, Stack }; diff --git a/node_modules/@lezer/lr/dist/index.js b/node_modules/@lezer/lr/dist/index.js new file mode 100644 index 0000000000..c65f243ed3 --- /dev/null +++ b/node_modules/@lezer/lr/dist/index.js @@ -0,0 +1,1592 @@ +import { Parser, NodeSet, NodeType, DefaultBufferLength, NodeProp, Tree, IterMode } from '@lezer/common'; + +/// A parse stack. These are used internally by the parser to track +/// parsing progress. They also provide some properties and methods +/// that external code such as a tokenizer can use to get information +/// about the parse state. +class Stack { + /// @internal + constructor( + /// The parse that this stack is part of @internal + p, + /// Holds state, input pos, buffer index triplets for all but the + /// top state @internal + stack, + /// The current parse state @internal + state, + // The position at which the next reduce should take place. This + // can be less than `this.pos` when skipped expressions have been + // added to the stack (which should be moved outside of the next + // reduction) + /// @internal + reducePos, + /// The input position up to which this stack has parsed. + pos, + /// The dynamic score of the stack, including dynamic precedence + /// and error-recovery penalties + /// @internal + score, + // The output buffer. Holds (type, start, end, size) quads + // representing nodes created by the parser, where `size` is + // amount of buffer array entries covered by this node. + /// @internal + buffer, + // The base offset of the buffer. When stacks are split, the split + // instance shared the buffer history with its parent up to + // `bufferBase`, which is the absolute offset (including the + // offset of previous splits) into the buffer at which this stack + // starts writing. + /// @internal + bufferBase, + /// @internal + curContext, + /// @internal + lookAhead = 0, + // A parent stack from which this was split off, if any. This is + // set up so that it always points to a stack that has some + // additional buffer content, never to a stack with an equal + // `bufferBase`. + /// @internal + parent) { + this.p = p; + this.stack = stack; + this.state = state; + this.reducePos = reducePos; + this.pos = pos; + this.score = score; + this.buffer = buffer; + this.bufferBase = bufferBase; + this.curContext = curContext; + this.lookAhead = lookAhead; + this.parent = parent; + } + /// @internal + toString() { + return `[${this.stack.filter((_, i) => i % 3 == 0).concat(this.state)}]@${this.pos}${this.score ? "!" + this.score : ""}`; + } + // Start an empty stack + /// @internal + static start(p, state, pos = 0) { + let cx = p.parser.context; + return new Stack(p, [], state, pos, pos, 0, [], 0, cx ? new StackContext(cx, cx.start) : null, 0, null); + } + /// The stack's current [context](#lr.ContextTracker) value, if + /// any. Its type will depend on the context tracker's type + /// parameter, or it will be `null` if there is no context + /// tracker. + get context() { return this.curContext ? this.curContext.context : null; } + // Push a state onto the stack, tracking its start position as well + // as the buffer base at that point. + /// @internal + pushState(state, start) { + this.stack.push(this.state, start, this.bufferBase + this.buffer.length); + this.state = state; + } + // Apply a reduce action + /// @internal + reduce(action) { + let depth = action >> 19 /* ReduceDepthShift */, type = action & 65535 /* ValueMask */; + let { parser } = this.p; + let dPrec = parser.dynamicPrecedence(type); + if (dPrec) + this.score += dPrec; + if (depth == 0) { + this.pushState(parser.getGoto(this.state, type, true), this.reducePos); + // Zero-depth reductions are a special case—they add stuff to + // the stack without popping anything off. + if (type < parser.minRepeatTerm) + this.storeNode(type, this.reducePos, this.reducePos, 4, true); + this.reduceContext(type, this.reducePos); + return; + } + // Find the base index into `this.stack`, content after which will + // be dropped. Note that with `StayFlag` reductions we need to + // consume two extra frames (the dummy parent node for the skipped + // expression and the state that we'll be staying in, which should + // be moved to `this.state`). + let base = this.stack.length - ((depth - 1) * 3) - (action & 262144 /* StayFlag */ ? 6 : 0); + let start = this.stack[base - 2]; + let bufferBase = this.stack[base - 1], count = this.bufferBase + this.buffer.length - bufferBase; + // Store normal terms or `R -> R R` repeat reductions + if (type < parser.minRepeatTerm || (action & 131072 /* RepeatFlag */)) { + let pos = parser.stateFlag(this.state, 1 /* Skipped */) ? this.pos : this.reducePos; + this.storeNode(type, start, pos, count + 4, true); + } + if (action & 262144 /* StayFlag */) { + this.state = this.stack[base]; + } + else { + let baseStateID = this.stack[base - 3]; + this.state = parser.getGoto(baseStateID, type, true); + } + while (this.stack.length > base) + this.stack.pop(); + this.reduceContext(type, start); + } + // Shift a value into the buffer + /// @internal + storeNode(term, start, end, size = 4, isReduce = false) { + if (term == 0 /* Err */ && + (!this.stack.length || this.stack[this.stack.length - 1] < this.buffer.length + this.bufferBase)) { + // Try to omit/merge adjacent error nodes + let cur = this, top = this.buffer.length; + if (top == 0 && cur.parent) { + top = cur.bufferBase - cur.parent.bufferBase; + cur = cur.parent; + } + if (top > 0 && cur.buffer[top - 4] == 0 /* Err */ && cur.buffer[top - 1] > -1) { + if (start == end) + return; + if (cur.buffer[top - 2] >= start) { + cur.buffer[top - 2] = end; + return; + } + } + } + if (!isReduce || this.pos == end) { // Simple case, just append + this.buffer.push(term, start, end, size); + } + else { // There may be skipped nodes that have to be moved forward + let index = this.buffer.length; + if (index > 0 && this.buffer[index - 4] != 0 /* Err */) + while (index > 0 && this.buffer[index - 2] > end) { + // Move this record forward + this.buffer[index] = this.buffer[index - 4]; + this.buffer[index + 1] = this.buffer[index - 3]; + this.buffer[index + 2] = this.buffer[index - 2]; + this.buffer[index + 3] = this.buffer[index - 1]; + index -= 4; + if (size > 4) + size -= 4; + } + this.buffer[index] = term; + this.buffer[index + 1] = start; + this.buffer[index + 2] = end; + this.buffer[index + 3] = size; + } + } + // Apply a shift action + /// @internal + shift(action, next, nextEnd) { + let start = this.pos; + if (action & 131072 /* GotoFlag */) { + this.pushState(action & 65535 /* ValueMask */, this.pos); + } + else if ((action & 262144 /* StayFlag */) == 0) { // Regular shift + let nextState = action, { parser } = this.p; + if (nextEnd > this.pos || next <= parser.maxNode) { + this.pos = nextEnd; + if (!parser.stateFlag(nextState, 1 /* Skipped */)) + this.reducePos = nextEnd; + } + this.pushState(nextState, start); + this.shiftContext(next, start); + if (next <= parser.maxNode) + this.buffer.push(next, start, nextEnd, 4); + } + else { // Shift-and-stay, which means this is a skipped token + this.pos = nextEnd; + this.shiftContext(next, start); + if (next <= this.p.parser.maxNode) + this.buffer.push(next, start, nextEnd, 4); + } + } + // Apply an action + /// @internal + apply(action, next, nextEnd) { + if (action & 65536 /* ReduceFlag */) + this.reduce(action); + else + this.shift(action, next, nextEnd); + } + // Add a prebuilt (reused) node into the buffer. + /// @internal + useNode(value, next) { + let index = this.p.reused.length - 1; + if (index < 0 || this.p.reused[index] != value) { + this.p.reused.push(value); + index++; + } + let start = this.pos; + this.reducePos = this.pos = start + value.length; + this.pushState(next, start); + this.buffer.push(index, start, this.reducePos, -1 /* size == -1 means this is a reused value */); + if (this.curContext) + this.updateContext(this.curContext.tracker.reuse(this.curContext.context, value, this, this.p.stream.reset(this.pos - value.length))); + } + // Split the stack. Due to the buffer sharing and the fact + // that `this.stack` tends to stay quite shallow, this isn't very + // expensive. + /// @internal + split() { + let parent = this; + let off = parent.buffer.length; + // Because the top of the buffer (after this.pos) may be mutated + // to reorder reductions and skipped tokens, and shared buffers + // should be immutable, this copies any outstanding skipped tokens + // to the new buffer, and puts the base pointer before them. + while (off > 0 && parent.buffer[off - 2] > parent.reducePos) + off -= 4; + let buffer = parent.buffer.slice(off), base = parent.bufferBase + off; + // Make sure parent points to an actual parent with content, if there is such a parent. + while (parent && base == parent.bufferBase) + parent = parent.parent; + return new Stack(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, buffer, base, this.curContext, this.lookAhead, parent); + } + // Try to recover from an error by 'deleting' (ignoring) one token. + /// @internal + recoverByDelete(next, nextEnd) { + let isNode = next <= this.p.parser.maxNode; + if (isNode) + this.storeNode(next, this.pos, nextEnd, 4); + this.storeNode(0 /* Err */, this.pos, nextEnd, isNode ? 8 : 4); + this.pos = this.reducePos = nextEnd; + this.score -= 190 /* Delete */; + } + /// Check if the given term would be able to be shifted (optionally + /// after some reductions) on this stack. This can be useful for + /// external tokenizers that want to make sure they only provide a + /// given token when it applies. + canShift(term) { + for (let sim = new SimulatedStack(this);;) { + let action = this.p.parser.stateSlot(sim.state, 4 /* DefaultReduce */) || this.p.parser.hasAction(sim.state, term); + if ((action & 65536 /* ReduceFlag */) == 0) + return true; + if (action == 0) + return false; + sim.reduce(action); + } + } + // Apply up to Recover.MaxNext recovery actions that conceptually + // inserts some missing token or rule. + /// @internal + recoverByInsert(next) { + if (this.stack.length >= 300 /* MaxInsertStackDepth */) + return []; + let nextStates = this.p.parser.nextStates(this.state); + if (nextStates.length > 4 /* MaxNext */ << 1 || this.stack.length >= 120 /* DampenInsertStackDepth */) { + let best = []; + for (let i = 0, s; i < nextStates.length; i += 2) { + if ((s = nextStates[i + 1]) != this.state && this.p.parser.hasAction(s, next)) + best.push(nextStates[i], s); + } + if (this.stack.length < 120 /* DampenInsertStackDepth */) + for (let i = 0; best.length < 4 /* MaxNext */ << 1 && i < nextStates.length; i += 2) { + let s = nextStates[i + 1]; + if (!best.some((v, i) => (i & 1) && v == s)) + best.push(nextStates[i], s); + } + nextStates = best; + } + let result = []; + for (let i = 0; i < nextStates.length && result.length < 4 /* MaxNext */; i += 2) { + let s = nextStates[i + 1]; + if (s == this.state) + continue; + let stack = this.split(); + stack.pushState(s, this.pos); + stack.storeNode(0 /* Err */, stack.pos, stack.pos, 4, true); + stack.shiftContext(nextStates[i], this.pos); + stack.score -= 200 /* Insert */; + result.push(stack); + } + return result; + } + // Force a reduce, if possible. Return false if that can't + // be done. + /// @internal + forceReduce() { + let reduce = this.p.parser.stateSlot(this.state, 5 /* ForcedReduce */); + if ((reduce & 65536 /* ReduceFlag */) == 0) + return false; + let { parser } = this.p; + if (!parser.validAction(this.state, reduce)) { + let depth = reduce >> 19 /* ReduceDepthShift */, term = reduce & 65535 /* ValueMask */; + let target = this.stack.length - depth * 3; + if (target < 0 || parser.getGoto(this.stack[target], term, false) < 0) + return false; + this.storeNode(0 /* Err */, this.reducePos, this.reducePos, 4, true); + this.score -= 100 /* Reduce */; + } + this.reducePos = this.pos; + this.reduce(reduce); + return true; + } + /// @internal + forceAll() { + while (!this.p.parser.stateFlag(this.state, 2 /* Accepting */)) { + if (!this.forceReduce()) { + this.storeNode(0 /* Err */, this.pos, this.pos, 4, true); + break; + } + } + return this; + } + /// Check whether this state has no further actions (assumed to be a direct descendant of the + /// top state, since any other states must be able to continue + /// somehow). @internal + get deadEnd() { + if (this.stack.length != 3) + return false; + let { parser } = this.p; + return parser.data[parser.stateSlot(this.state, 1 /* Actions */)] == 65535 /* End */ && + !parser.stateSlot(this.state, 4 /* DefaultReduce */); + } + /// Restart the stack (put it back in its start state). Only safe + /// when this.stack.length == 3 (state is directly below the top + /// state). @internal + restart() { + this.state = this.stack[0]; + this.stack.length = 0; + } + /// @internal + sameState(other) { + if (this.state != other.state || this.stack.length != other.stack.length) + return false; + for (let i = 0; i < this.stack.length; i += 3) + if (this.stack[i] != other.stack[i]) + return false; + return true; + } + /// Get the parser used by this stack. + get parser() { return this.p.parser; } + /// Test whether a given dialect (by numeric ID, as exported from + /// the terms file) is enabled. + dialectEnabled(dialectID) { return this.p.parser.dialect.flags[dialectID]; } + shiftContext(term, start) { + if (this.curContext) + this.updateContext(this.curContext.tracker.shift(this.curContext.context, term, this, this.p.stream.reset(start))); + } + reduceContext(term, start) { + if (this.curContext) + this.updateContext(this.curContext.tracker.reduce(this.curContext.context, term, this, this.p.stream.reset(start))); + } + /// @internal + emitContext() { + let last = this.buffer.length - 1; + if (last < 0 || this.buffer[last] != -3) + this.buffer.push(this.curContext.hash, this.reducePos, this.reducePos, -3); + } + /// @internal + emitLookAhead() { + let last = this.buffer.length - 1; + if (last < 0 || this.buffer[last] != -4) + this.buffer.push(this.lookAhead, this.reducePos, this.reducePos, -4); + } + updateContext(context) { + if (context != this.curContext.context) { + let newCx = new StackContext(this.curContext.tracker, context); + if (newCx.hash != this.curContext.hash) + this.emitContext(); + this.curContext = newCx; + } + } + /// @internal + setLookAhead(lookAhead) { + if (lookAhead > this.lookAhead) { + this.emitLookAhead(); + this.lookAhead = lookAhead; + } + } + /// @internal + close() { + if (this.curContext && this.curContext.tracker.strict) + this.emitContext(); + if (this.lookAhead > 0) + this.emitLookAhead(); + } +} +class StackContext { + constructor(tracker, context) { + this.tracker = tracker; + this.context = context; + this.hash = tracker.strict ? tracker.hash(context) : 0; + } +} +var Recover; +(function (Recover) { + Recover[Recover["Insert"] = 200] = "Insert"; + Recover[Recover["Delete"] = 190] = "Delete"; + Recover[Recover["Reduce"] = 100] = "Reduce"; + Recover[Recover["MaxNext"] = 4] = "MaxNext"; + Recover[Recover["MaxInsertStackDepth"] = 300] = "MaxInsertStackDepth"; + Recover[Recover["DampenInsertStackDepth"] = 120] = "DampenInsertStackDepth"; +})(Recover || (Recover = {})); +// Used to cheaply run some reductions to scan ahead without mutating +// an entire stack +class SimulatedStack { + constructor(start) { + this.start = start; + this.state = start.state; + this.stack = start.stack; + this.base = this.stack.length; + } + reduce(action) { + let term = action & 65535 /* ValueMask */, depth = action >> 19 /* ReduceDepthShift */; + if (depth == 0) { + if (this.stack == this.start.stack) + this.stack = this.stack.slice(); + this.stack.push(this.state, 0, 0); + this.base += 3; + } + else { + this.base -= (depth - 1) * 3; + } + let goto = this.start.p.parser.getGoto(this.stack[this.base - 3], term, true); + this.state = goto; + } +} +// This is given to `Tree.build` to build a buffer, and encapsulates +// the parent-stack-walking necessary to read the nodes. +class StackBufferCursor { + constructor(stack, pos, index) { + this.stack = stack; + this.pos = pos; + this.index = index; + this.buffer = stack.buffer; + if (this.index == 0) + this.maybeNext(); + } + static create(stack, pos = stack.bufferBase + stack.buffer.length) { + return new StackBufferCursor(stack, pos, pos - stack.bufferBase); + } + maybeNext() { + let next = this.stack.parent; + if (next != null) { + this.index = this.stack.bufferBase - next.bufferBase; + this.stack = next; + this.buffer = next.buffer; + } + } + 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]; } + next() { + this.index -= 4; + this.pos -= 4; + if (this.index == 0) + this.maybeNext(); + } + fork() { + return new StackBufferCursor(this.stack, this.pos, this.index); + } +} + +class CachedToken { + constructor() { + this.start = -1; + this.value = -1; + this.end = -1; + this.extended = -1; + this.lookAhead = 0; + this.mask = 0; + this.context = 0; + } +} +const nullToken = new CachedToken; +/// [Tokenizers](#lr.ExternalTokenizer) interact with the input +/// through this interface. It presents the input as a stream of +/// characters, tracking lookahead and hiding the complexity of +/// [ranges](#common.Parser.parse^ranges) from tokenizer code. +class InputStream { + /// @internal + constructor( + /// @internal + input, + /// @internal + ranges) { + this.input = input; + this.ranges = ranges; + /// @internal + this.chunk = ""; + /// @internal + this.chunkOff = 0; + /// Backup chunk + this.chunk2 = ""; + this.chunk2Pos = 0; + /// The character code of the next code unit in the input, or -1 + /// when the stream is at the end of the input. + this.next = -1; + /// @internal + this.token = nullToken; + this.rangeIndex = 0; + this.pos = this.chunkPos = ranges[0].from; + this.range = ranges[0]; + this.end = ranges[ranges.length - 1].to; + this.readNext(); + } + /// @internal + resolveOffset(offset, assoc) { + let range = this.range, index = this.rangeIndex; + let pos = this.pos + offset; + while (pos < range.from) { + if (!index) + return null; + let next = this.ranges[--index]; + pos -= range.from - next.to; + range = next; + } + while (assoc < 0 ? pos > range.to : pos >= range.to) { + if (index == this.ranges.length - 1) + return null; + let next = this.ranges[++index]; + pos += next.from - range.to; + range = next; + } + return pos; + } + /// Look at a code unit near the stream position. `.peek(0)` equals + /// `.next`, `.peek(-1)` gives you the previous character, and so + /// on. + /// + /// Note that looking around during tokenizing creates dependencies + /// on potentially far-away content, which may reduce the + /// effectiveness incremental parsing—when looking forward—or even + /// cause invalid reparses when looking backward more than 25 code + /// units, since the library does not track lookbehind. + peek(offset) { + let idx = this.chunkOff + offset, pos, result; + if (idx >= 0 && idx < this.chunk.length) { + pos = this.pos + offset; + result = this.chunk.charCodeAt(idx); + } + else { + let resolved = this.resolveOffset(offset, 1); + if (resolved == null) + return -1; + pos = resolved; + if (pos >= this.chunk2Pos && pos < this.chunk2Pos + this.chunk2.length) { + result = this.chunk2.charCodeAt(pos - this.chunk2Pos); + } + else { + let i = this.rangeIndex, range = this.range; + while (range.to <= pos) + range = this.ranges[++i]; + this.chunk2 = this.input.chunk(this.chunk2Pos = pos); + if (pos + this.chunk2.length > range.to) + this.chunk2 = this.chunk2.slice(0, range.to - pos); + result = this.chunk2.charCodeAt(0); + } + } + if (pos >= this.token.lookAhead) + this.token.lookAhead = pos + 1; + return result; + } + /// Accept a token. By default, the end of the token is set to the + /// current stream position, but you can pass an offset (relative to + /// the stream position) to change that. + acceptToken(token, endOffset = 0) { + let end = endOffset ? this.resolveOffset(endOffset, -1) : this.pos; + if (end == null || end < this.token.start) + throw new RangeError("Token end out of bounds"); + this.token.value = token; + this.token.end = end; + } + getChunk() { + if (this.pos >= this.chunk2Pos && this.pos < this.chunk2Pos + this.chunk2.length) { + let { chunk, chunkPos } = this; + this.chunk = this.chunk2; + this.chunkPos = this.chunk2Pos; + this.chunk2 = chunk; + this.chunk2Pos = chunkPos; + this.chunkOff = this.pos - this.chunkPos; + } + else { + this.chunk2 = this.chunk; + this.chunk2Pos = this.chunkPos; + let nextChunk = this.input.chunk(this.pos); + let end = this.pos + nextChunk.length; + this.chunk = end > this.range.to ? nextChunk.slice(0, this.range.to - this.pos) : nextChunk; + this.chunkPos = this.pos; + this.chunkOff = 0; + } + } + readNext() { + if (this.chunkOff >= this.chunk.length) { + this.getChunk(); + if (this.chunkOff == this.chunk.length) + return this.next = -1; + } + return this.next = this.chunk.charCodeAt(this.chunkOff); + } + /// Move the stream forward N (defaults to 1) code units. Returns + /// the new value of [`next`](#lr.InputStream.next). + advance(n = 1) { + this.chunkOff += n; + while (this.pos + n >= this.range.to) { + if (this.rangeIndex == this.ranges.length - 1) + return this.setDone(); + n -= this.range.to - this.pos; + this.range = this.ranges[++this.rangeIndex]; + this.pos = this.range.from; + } + this.pos += n; + if (this.pos >= this.token.lookAhead) + this.token.lookAhead = this.pos + 1; + return this.readNext(); + } + setDone() { + this.pos = this.chunkPos = this.end; + this.range = this.ranges[this.rangeIndex = this.ranges.length - 1]; + this.chunk = ""; + return this.next = -1; + } + /// @internal + reset(pos, token) { + if (token) { + this.token = token; + token.start = pos; + token.lookAhead = pos + 1; + token.value = token.extended = -1; + } + else { + this.token = nullToken; + } + if (this.pos != pos) { + this.pos = pos; + if (pos == this.end) { + this.setDone(); + return this; + } + while (pos < this.range.from) + this.range = this.ranges[--this.rangeIndex]; + while (pos >= this.range.to) + this.range = this.ranges[++this.rangeIndex]; + if (pos >= this.chunkPos && pos < this.chunkPos + this.chunk.length) { + this.chunkOff = pos - this.chunkPos; + } + else { + this.chunk = ""; + this.chunkOff = 0; + } + this.readNext(); + } + return this; + } + /// @internal + read(from, to) { + if (from >= this.chunkPos && to <= this.chunkPos + this.chunk.length) + return this.chunk.slice(from - this.chunkPos, to - this.chunkPos); + if (from >= this.chunk2Pos && to <= this.chunk2Pos + this.chunk2.length) + return this.chunk2.slice(from - this.chunk2Pos, to - this.chunk2Pos); + if (from >= this.range.from && to <= this.range.to) + return this.input.read(from, to); + let result = ""; + for (let r of this.ranges) { + if (r.from >= to) + break; + if (r.to > from) + result += this.input.read(Math.max(r.from, from), Math.min(r.to, to)); + } + return result; + } +} +/// @internal +class TokenGroup { + constructor(data, id) { + this.data = data; + this.id = id; + } + token(input, stack) { readToken(this.data, input, stack, this.id); } +} +TokenGroup.prototype.contextual = TokenGroup.prototype.fallback = TokenGroup.prototype.extend = false; +/// `@external tokens` declarations in the grammar should resolve to +/// an instance of this class. +class ExternalTokenizer { + /// Create a tokenizer. The first argument is the function that, + /// given an input stream, scans for the types of tokens it + /// recognizes at the stream's position, and calls + /// [`acceptToken`](#lr.InputStream.acceptToken) when it finds + /// one. + constructor( + /// @internal + token, options = {}) { + this.token = token; + this.contextual = !!options.contextual; + this.fallback = !!options.fallback; + this.extend = !!options.extend; + } +} +// Tokenizer data is stored a big uint16 array containing, for each +// state: +// +// - A group bitmask, indicating what token groups are reachable from +// this state, so that paths that can only lead to tokens not in +// any of the current groups can be cut off early. +// +// - The position of the end of the state's sequence of accepting +// tokens +// +// - The number of outgoing edges for the state +// +// - The accepting tokens, as (token id, group mask) pairs +// +// - The outgoing edges, as (start character, end character, state +// index) triples, with end character being exclusive +// +// This function interprets that data, running through a stream as +// long as new states with the a matching group mask can be reached, +// and updating `token` when it matches a token. +function readToken(data, input, stack, group) { + let state = 0, groupMask = 1 << group, { parser } = stack.p, { dialect } = parser; + scan: for (;;) { + if ((groupMask & data[state]) == 0) + break; + let accEnd = data[state + 1]; + // Check whether this state can lead to a token in the current group + // Accept tokens in this state, possibly overwriting + // lower-precedence / shorter tokens + for (let i = state + 3; i < accEnd; i += 2) + if ((data[i + 1] & groupMask) > 0) { + let term = data[i]; + if (dialect.allows(term) && + (input.token.value == -1 || input.token.value == term || parser.overrides(term, input.token.value))) { + input.acceptToken(term); + break; + } + } + // Do a binary search on the state's edges + for (let next = input.next, low = 0, high = data[state + 2]; low < high;) { + let mid = (low + high) >> 1; + let index = accEnd + mid + (mid << 1); + let from = data[index], to = data[index + 1]; + if (next < from) + high = mid; + else if (next >= to) + low = mid + 1; + else { + state = data[index + 2]; + input.advance(); + continue scan; + } + } + break; + } +} + +// See lezer-generator/src/encode.ts for comments about the encoding +// used here +function decodeArray(input, Type = Uint16Array) { + if (typeof input != "string") + return input; + let array = null; + for (let pos = 0, out = 0; pos < input.length;) { + let value = 0; + for (;;) { + let next = input.charCodeAt(pos++), stop = false; + if (next == 126 /* BigValCode */) { + value = 65535 /* BigVal */; + break; + } + if (next >= 92 /* Gap2 */) + next--; + if (next >= 34 /* Gap1 */) + next--; + let digit = next - 32 /* Start */; + if (digit >= 46 /* Base */) { + digit -= 46 /* Base */; + stop = true; + } + value += digit; + if (stop) + break; + value *= 46 /* Base */; + } + if (array) + array[out++] = value; + else + array = new Type(value); + } + return array; +} + +// Environment variable used to control console output +const verbose = typeof process != "undefined" && process.env && /\bparse\b/.test(process.env.LOG); +let stackIDs = null; +var Safety; +(function (Safety) { + Safety[Safety["Margin"] = 25] = "Margin"; +})(Safety || (Safety = {})); +function cutAt(tree, pos, side) { + let cursor = tree.cursor(IterMode.IncludeAnonymous); + cursor.moveTo(pos); + for (;;) { + if (!(side < 0 ? cursor.childBefore(pos) : cursor.childAfter(pos))) + for (;;) { + if ((side < 0 ? cursor.to < pos : cursor.from > pos) && !cursor.type.isError) + return side < 0 ? Math.max(0, Math.min(cursor.to - 1, pos - 25 /* Margin */)) + : Math.min(tree.length, Math.max(cursor.from + 1, pos + 25 /* Margin */)); + if (side < 0 ? cursor.prevSibling() : cursor.nextSibling()) + break; + if (!cursor.parent()) + return side < 0 ? 0 : tree.length; + } + } +} +class FragmentCursor { + constructor(fragments, nodeSet) { + this.fragments = fragments; + this.nodeSet = nodeSet; + this.i = 0; + this.fragment = null; + this.safeFrom = -1; + this.safeTo = -1; + this.trees = []; + this.start = []; + this.index = []; + this.nextFragment(); + } + nextFragment() { + let fr = this.fragment = this.i == this.fragments.length ? null : this.fragments[this.i++]; + if (fr) { + this.safeFrom = fr.openStart ? cutAt(fr.tree, fr.from + fr.offset, 1) - fr.offset : fr.from; + this.safeTo = fr.openEnd ? cutAt(fr.tree, fr.to + fr.offset, -1) - fr.offset : fr.to; + while (this.trees.length) { + this.trees.pop(); + this.start.pop(); + this.index.pop(); + } + this.trees.push(fr.tree); + this.start.push(-fr.offset); + this.index.push(0); + this.nextStart = this.safeFrom; + } + else { + this.nextStart = 1e9; + } + } + // `pos` must be >= any previously given `pos` for this cursor + nodeAt(pos) { + if (pos < this.nextStart) + return null; + while (this.fragment && this.safeTo <= pos) + this.nextFragment(); + if (!this.fragment) + return null; + for (;;) { + let last = this.trees.length - 1; + if (last < 0) { // End of tree + this.nextFragment(); + return null; + } + let top = this.trees[last], index = this.index[last]; + if (index == top.children.length) { + this.trees.pop(); + this.start.pop(); + this.index.pop(); + continue; + } + let next = top.children[index]; + let start = this.start[last] + top.positions[index]; + if (start > pos) { + this.nextStart = start; + return null; + } + if (next instanceof Tree) { + if (start == pos) { + if (start < this.safeFrom) + return null; + let end = start + next.length; + if (end <= this.safeTo) { + let lookAhead = next.prop(NodeProp.lookAhead); + if (!lookAhead || end + lookAhead < this.fragment.to) + return next; + } + } + this.index[last]++; + if (start + next.length >= Math.max(this.safeFrom, pos)) { // Enter this node + this.trees.push(next); + this.start.push(start); + this.index.push(0); + } + } + else { + this.index[last]++; + this.nextStart = start + next.length; + } + } + } +} +class TokenCache { + constructor(parser, stream) { + this.stream = stream; + this.tokens = []; + this.mainToken = null; + this.actions = []; + this.tokens = parser.tokenizers.map(_ => new CachedToken); + } + getActions(stack) { + let actionIndex = 0; + let main = null; + let { parser } = stack.p, { tokenizers } = parser; + let mask = parser.stateSlot(stack.state, 3 /* TokenizerMask */); + let context = stack.curContext ? stack.curContext.hash : 0; + let lookAhead = 0; + for (let i = 0; i < tokenizers.length; i++) { + if (((1 << i) & mask) == 0) + continue; + let tokenizer = tokenizers[i], token = this.tokens[i]; + if (main && !tokenizer.fallback) + continue; + if (tokenizer.contextual || token.start != stack.pos || token.mask != mask || token.context != context) { + this.updateCachedToken(token, tokenizer, stack); + token.mask = mask; + token.context = context; + } + if (token.lookAhead > token.end + 25 /* Margin */) + lookAhead = Math.max(token.lookAhead, lookAhead); + if (token.value != 0 /* Err */) { + let startIndex = actionIndex; + if (token.extended > -1) + actionIndex = this.addActions(stack, token.extended, token.end, actionIndex); + actionIndex = this.addActions(stack, token.value, token.end, actionIndex); + if (!tokenizer.extend) { + main = token; + if (actionIndex > startIndex) + break; + } + } + } + while (this.actions.length > actionIndex) + this.actions.pop(); + if (lookAhead) + stack.setLookAhead(lookAhead); + if (!main && stack.pos == this.stream.end) { + main = new CachedToken; + main.value = stack.p.parser.eofTerm; + main.start = main.end = stack.pos; + actionIndex = this.addActions(stack, main.value, main.end, actionIndex); + } + this.mainToken = main; + return this.actions; + } + getMainToken(stack) { + if (this.mainToken) + return this.mainToken; + let main = new CachedToken, { pos, p } = stack; + main.start = pos; + main.end = Math.min(pos + 1, p.stream.end); + main.value = pos == p.stream.end ? p.parser.eofTerm : 0 /* Err */; + return main; + } + updateCachedToken(token, tokenizer, stack) { + tokenizer.token(this.stream.reset(stack.pos, token), stack); + if (token.value > -1) { + let { parser } = stack.p; + for (let i = 0; i < parser.specialized.length; i++) + if (parser.specialized[i] == token.value) { + let result = parser.specializers[i](this.stream.read(token.start, token.end), stack); + if (result >= 0 && stack.p.parser.dialect.allows(result >> 1)) { + if ((result & 1) == 0 /* Specialize */) + token.value = result >> 1; + else + token.extended = result >> 1; + break; + } + } + } + else { + token.value = 0 /* Err */; + token.end = Math.min(stack.p.stream.end, stack.pos + 1); + } + } + putAction(action, token, end, index) { + // Don't add duplicate actions + for (let i = 0; i < index; i += 3) + if (this.actions[i] == action) + return index; + this.actions[index++] = action; + this.actions[index++] = token; + this.actions[index++] = end; + return index; + } + addActions(stack, token, end, index) { + let { state } = stack, { parser } = stack.p, { data } = parser; + for (let set = 0; set < 2; set++) { + for (let i = parser.stateSlot(state, set ? 2 /* Skip */ : 1 /* Actions */);; i += 3) { + if (data[i] == 65535 /* End */) { + if (data[i + 1] == 1 /* Next */) { + i = pair(data, i + 2); + } + else { + if (index == 0 && data[i + 1] == 2 /* Other */) + index = this.putAction(pair(data, i + 2), token, end, index); + break; + } + } + if (data[i] == token) + index = this.putAction(pair(data, i + 1), token, end, index); + } + } + return index; + } +} +var Rec; +(function (Rec) { + Rec[Rec["Distance"] = 5] = "Distance"; + Rec[Rec["MaxRemainingPerStep"] = 3] = "MaxRemainingPerStep"; + // When two stacks have been running independently long enough to + // add this many elements to their buffers, prune one. + Rec[Rec["MinBufferLengthPrune"] = 500] = "MinBufferLengthPrune"; + Rec[Rec["ForceReduceLimit"] = 10] = "ForceReduceLimit"; + // Once a stack reaches this depth (in .stack.length) force-reduce + // it back to CutTo to avoid creating trees that overflow the stack + // on recursive traversal. + Rec[Rec["CutDepth"] = 15000] = "CutDepth"; + Rec[Rec["CutTo"] = 9000] = "CutTo"; +})(Rec || (Rec = {})); +class Parse { + constructor(parser, input, fragments, ranges) { + this.parser = parser; + this.input = input; + this.ranges = ranges; + this.recovering = 0; + this.nextStackID = 0x2654; // ♔, ♕, ♖, ♗, ♘, ♙, ♠, ♡, ♢, ♣, ♤, ♥, ♦, ♧ + this.minStackPos = 0; + this.reused = []; + this.stoppedAt = null; + this.stream = new InputStream(input, ranges); + this.tokens = new TokenCache(parser, this.stream); + this.topTerm = parser.top[1]; + let { from } = ranges[0]; + this.stacks = [Stack.start(this, parser.top[0], from)]; + this.fragments = fragments.length && this.stream.end - from > parser.bufferLength * 4 + ? new FragmentCursor(fragments, parser.nodeSet) : null; + } + get parsedPos() { + return this.minStackPos; + } + // Move the parser forward. This will process all parse stacks at + // `this.pos` and try to advance them to a further position. If no + // stack for such a position is found, it'll start error-recovery. + // + // When the parse is finished, this will return a syntax tree. When + // not, it returns `null`. + advance() { + let stacks = this.stacks, pos = this.minStackPos; + // This will hold stacks beyond `pos`. + let newStacks = this.stacks = []; + let stopped, stoppedTokens; + // Keep advancing any stacks at `pos` until they either move + // forward or can't be advanced. Gather stacks that can't be + // advanced further in `stopped`. + for (let i = 0; i < stacks.length; i++) { + let stack = stacks[i]; + for (;;) { + this.tokens.mainToken = null; + if (stack.pos > pos) { + newStacks.push(stack); + } + else if (this.advanceStack(stack, newStacks, stacks)) { + continue; + } + else { + if (!stopped) { + stopped = []; + stoppedTokens = []; + } + stopped.push(stack); + let tok = this.tokens.getMainToken(stack); + stoppedTokens.push(tok.value, tok.end); + } + break; + } + } + if (!newStacks.length) { + let finished = stopped && findFinished(stopped); + if (finished) + return this.stackToTree(finished); + if (this.parser.strict) { + if (verbose && stopped) + console.log("Stuck with token " + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : "none")); + throw new SyntaxError("No parse at " + pos); + } + if (!this.recovering) + this.recovering = 5 /* Distance */; + } + if (this.recovering && stopped) { + let finished = this.stoppedAt != null && stopped[0].pos > this.stoppedAt ? stopped[0] + : this.runRecovery(stopped, stoppedTokens, newStacks); + if (finished) + return this.stackToTree(finished.forceAll()); + } + if (this.recovering) { + let maxRemaining = this.recovering == 1 ? 1 : this.recovering * 3 /* MaxRemainingPerStep */; + if (newStacks.length > maxRemaining) { + newStacks.sort((a, b) => b.score - a.score); + while (newStacks.length > maxRemaining) + newStacks.pop(); + } + if (newStacks.some(s => s.reducePos > pos)) + this.recovering--; + } + else if (newStacks.length > 1) { + // Prune stacks that are in the same state, or that have been + // running without splitting for a while, to avoid getting stuck + // with multiple successful stacks running endlessly on. + outer: for (let i = 0; i < newStacks.length - 1; i++) { + let stack = newStacks[i]; + for (let j = i + 1; j < newStacks.length; j++) { + let other = newStacks[j]; + if (stack.sameState(other) || + stack.buffer.length > 500 /* MinBufferLengthPrune */ && other.buffer.length > 500 /* MinBufferLengthPrune */) { + if (((stack.score - other.score) || (stack.buffer.length - other.buffer.length)) > 0) { + newStacks.splice(j--, 1); + } + else { + newStacks.splice(i--, 1); + continue outer; + } + } + } + } + } + this.minStackPos = newStacks[0].pos; + for (let i = 1; i < newStacks.length; i++) + if (newStacks[i].pos < this.minStackPos) + this.minStackPos = newStacks[i].pos; + return null; + } + stopAt(pos) { + if (this.stoppedAt != null && this.stoppedAt < pos) + throw new RangeError("Can't move stoppedAt forward"); + this.stoppedAt = pos; + } + // Returns an updated version of the given stack, or null if the + // stack can't advance normally. When `split` and `stacks` are + // given, stacks split off by ambiguous operations will be pushed to + // `split`, or added to `stacks` if they move `pos` forward. + advanceStack(stack, stacks, split) { + let start = stack.pos, { parser } = this; + let base = verbose ? this.stackID(stack) + " -> " : ""; + if (this.stoppedAt != null && start > this.stoppedAt) + return stack.forceReduce() ? stack : null; + if (this.fragments) { + let strictCx = stack.curContext && stack.curContext.tracker.strict, cxHash = strictCx ? stack.curContext.hash : 0; + for (let cached = this.fragments.nodeAt(start); cached;) { + let match = this.parser.nodeSet.types[cached.type.id] == cached.type ? parser.getGoto(stack.state, cached.type.id) : -1; + if (match > -1 && cached.length && (!strictCx || (cached.prop(NodeProp.contextHash) || 0) == cxHash)) { + stack.useNode(cached, match); + if (verbose) + console.log(base + this.stackID(stack) + ` (via reuse of ${parser.getName(cached.type.id)})`); + return true; + } + if (!(cached instanceof Tree) || cached.children.length == 0 || cached.positions[0] > 0) + break; + let inner = cached.children[0]; + if (inner instanceof Tree && cached.positions[0] == 0) + cached = inner; + else + break; + } + } + let defaultReduce = parser.stateSlot(stack.state, 4 /* DefaultReduce */); + if (defaultReduce > 0) { + stack.reduce(defaultReduce); + if (verbose) + console.log(base + this.stackID(stack) + ` (via always-reduce ${parser.getName(defaultReduce & 65535 /* ValueMask */)})`); + return true; + } + if (stack.stack.length >= 15000 /* CutDepth */) { + while (stack.stack.length > 9000 /* CutTo */ && stack.forceReduce()) { } + } + let actions = this.tokens.getActions(stack); + for (let i = 0; i < actions.length;) { + let action = actions[i++], term = actions[i++], end = actions[i++]; + let last = i == actions.length || !split; + let localStack = last ? stack : stack.split(); + localStack.apply(action, term, end); + if (verbose) + console.log(base + this.stackID(localStack) + ` (via ${(action & 65536 /* ReduceFlag */) == 0 ? "shift" + : `reduce of ${parser.getName(action & 65535 /* ValueMask */)}`} for ${parser.getName(term)} @ ${start}${localStack == stack ? "" : ", split"})`); + if (last) + return true; + else if (localStack.pos > start) + stacks.push(localStack); + else + split.push(localStack); + } + return false; + } + // Advance a given stack forward as far as it will go. Returns the + // (possibly updated) stack if it got stuck, or null if it moved + // forward and was given to `pushStackDedup`. + advanceFully(stack, newStacks) { + let pos = stack.pos; + for (;;) { + if (!this.advanceStack(stack, null, null)) + return false; + if (stack.pos > pos) { + pushStackDedup(stack, newStacks); + return true; + } + } + } + runRecovery(stacks, tokens, newStacks) { + let finished = null, restarted = false; + for (let i = 0; i < stacks.length; i++) { + let stack = stacks[i], token = tokens[i << 1], tokenEnd = tokens[(i << 1) + 1]; + let base = verbose ? this.stackID(stack) + " -> " : ""; + if (stack.deadEnd) { + if (restarted) + continue; + restarted = true; + stack.restart(); + if (verbose) + console.log(base + this.stackID(stack) + " (restarted)"); + let done = this.advanceFully(stack, newStacks); + if (done) + continue; + } + let force = stack.split(), forceBase = base; + for (let j = 0; force.forceReduce() && j < 10 /* ForceReduceLimit */; j++) { + if (verbose) + console.log(forceBase + this.stackID(force) + " (via force-reduce)"); + let done = this.advanceFully(force, newStacks); + if (done) + break; + if (verbose) + forceBase = this.stackID(force) + " -> "; + } + for (let insert of stack.recoverByInsert(token)) { + if (verbose) + console.log(base + this.stackID(insert) + " (via recover-insert)"); + this.advanceFully(insert, newStacks); + } + if (this.stream.end > stack.pos) { + if (tokenEnd == stack.pos) { + tokenEnd++; + token = 0 /* Err */; + } + stack.recoverByDelete(token, tokenEnd); + if (verbose) + console.log(base + this.stackID(stack) + ` (via recover-delete ${this.parser.getName(token)})`); + pushStackDedup(stack, newStacks); + } + else if (!finished || finished.score < stack.score) { + finished = stack; + } + } + return finished; + } + // Convert the stack's buffer to a syntax tree. + stackToTree(stack) { + stack.close(); + return Tree.build({ buffer: StackBufferCursor.create(stack), + nodeSet: this.parser.nodeSet, + topID: this.topTerm, + maxBufferLength: this.parser.bufferLength, + reused: this.reused, + start: this.ranges[0].from, + length: stack.pos - this.ranges[0].from, + minRepeatType: this.parser.minRepeatTerm }); + } + stackID(stack) { + let id = (stackIDs || (stackIDs = new WeakMap)).get(stack); + if (!id) + stackIDs.set(stack, id = String.fromCodePoint(this.nextStackID++)); + return id + stack; + } +} +function pushStackDedup(stack, newStacks) { + for (let i = 0; i < newStacks.length; i++) { + let other = newStacks[i]; + if (other.pos == stack.pos && other.sameState(stack)) { + if (newStacks[i].score < stack.score) + newStacks[i] = stack; + return; + } + } + newStacks.push(stack); +} +class Dialect { + constructor(source, flags, disabled) { + this.source = source; + this.flags = flags; + this.disabled = disabled; + } + allows(term) { return !this.disabled || this.disabled[term] == 0; } +} +const id = x => x; +/// Context trackers are used to track stateful context (such as +/// indentation in the Python grammar, or parent elements in the XML +/// grammar) needed by external tokenizers. You declare them in a +/// grammar file as `@context exportName from "module"`. +/// +/// Context values should be immutable, and can be updated (replaced) +/// on shift or reduce actions. +/// +/// The export used in a `@context` declaration should be of this +/// type. +class ContextTracker { + /// Define a context tracker. + constructor(spec) { + this.start = spec.start; + this.shift = spec.shift || id; + this.reduce = spec.reduce || id; + this.reuse = spec.reuse || id; + this.hash = spec.hash || (() => 0); + this.strict = spec.strict !== false; + } +} +/// Holds the parse tables for a given grammar, as generated by +/// `lezer-generator`, and provides [methods](#common.Parser) to parse +/// content with. +class LRParser extends Parser { + /// @internal + constructor(spec) { + super(); + /// @internal + this.wrappers = []; + if (spec.version != 14 /* Version */) + throw new RangeError(`Parser version (${spec.version}) doesn't match runtime version (${14 /* Version */})`); + let nodeNames = spec.nodeNames.split(" "); + this.minRepeatTerm = nodeNames.length; + for (let i = 0; i < spec.repeatNodeCount; i++) + nodeNames.push(""); + let topTerms = Object.keys(spec.topRules).map(r => spec.topRules[r][1]); + let nodeProps = []; + for (let i = 0; i < nodeNames.length; i++) + nodeProps.push([]); + function setProp(nodeID, prop, value) { + nodeProps[nodeID].push([prop, prop.deserialize(String(value))]); + } + if (spec.nodeProps) + for (let propSpec of spec.nodeProps) { + let prop = propSpec[0]; + if (typeof prop == "string") + prop = NodeProp[prop]; + for (let i = 1; i < propSpec.length;) { + let next = propSpec[i++]; + if (next >= 0) { + setProp(next, prop, propSpec[i++]); + } + else { + let value = propSpec[i + -next]; + for (let j = -next; j > 0; j--) + setProp(propSpec[i++], prop, value); + i++; + } + } + } + this.nodeSet = new NodeSet(nodeNames.map((name, i) => NodeType.define({ + name: i >= this.minRepeatTerm ? undefined : name, + id: i, + props: nodeProps[i], + top: topTerms.indexOf(i) > -1, + error: i == 0, + skipped: spec.skippedNodes && spec.skippedNodes.indexOf(i) > -1 + }))); + if (spec.propSources) + this.nodeSet = this.nodeSet.extend(...spec.propSources); + this.strict = false; + this.bufferLength = DefaultBufferLength; + let tokenArray = decodeArray(spec.tokenData); + this.context = spec.context; + this.specialized = new Uint16Array(spec.specialized ? spec.specialized.length : 0); + this.specializers = []; + if (spec.specialized) + for (let i = 0; i < spec.specialized.length; i++) { + this.specialized[i] = spec.specialized[i].term; + this.specializers[i] = spec.specialized[i].get; + } + this.states = decodeArray(spec.states, Uint32Array); + this.data = decodeArray(spec.stateData); + this.goto = decodeArray(spec.goto); + this.maxTerm = spec.maxTerm; + this.tokenizers = spec.tokenizers.map(value => typeof value == "number" ? new TokenGroup(tokenArray, value) : value); + this.topRules = spec.topRules; + this.dialects = spec.dialects || {}; + this.dynamicPrecedences = spec.dynamicPrecedences || null; + this.tokenPrecTable = spec.tokenPrec; + this.termNames = spec.termNames || null; + this.maxNode = this.nodeSet.types.length - 1; + this.dialect = this.parseDialect(); + this.top = this.topRules[Object.keys(this.topRules)[0]]; + } + createParse(input, fragments, ranges) { + let parse = new Parse(this, input, fragments, ranges); + for (let w of this.wrappers) + parse = w(parse, input, fragments, ranges); + return parse; + } + /// Get a goto table entry @internal + getGoto(state, term, loose = false) { + let table = this.goto; + if (term >= table[0]) + return -1; + for (let pos = table[term + 1];;) { + let groupTag = table[pos++], last = groupTag & 1; + let target = table[pos++]; + if (last && loose) + return target; + for (let end = pos + (groupTag >> 1); pos < end; pos++) + if (table[pos] == state) + return target; + if (last) + return -1; + } + } + /// Check if this state has an action for a given terminal @internal + hasAction(state, terminal) { + let data = this.data; + for (let set = 0; set < 2; set++) { + for (let i = this.stateSlot(state, set ? 2 /* Skip */ : 1 /* Actions */), next;; i += 3) { + if ((next = data[i]) == 65535 /* End */) { + if (data[i + 1] == 1 /* Next */) + next = data[i = pair(data, i + 2)]; + else if (data[i + 1] == 2 /* Other */) + return pair(data, i + 2); + else + break; + } + if (next == terminal || next == 0 /* Err */) + return pair(data, i + 1); + } + } + return 0; + } + /// @internal + stateSlot(state, slot) { + return this.states[(state * 6 /* Size */) + slot]; + } + /// @internal + stateFlag(state, flag) { + return (this.stateSlot(state, 0 /* Flags */) & flag) > 0; + } + /// @internal + validAction(state, action) { + if (action == this.stateSlot(state, 4 /* DefaultReduce */)) + return true; + for (let i = this.stateSlot(state, 1 /* Actions */);; i += 3) { + if (this.data[i] == 65535 /* End */) { + if (this.data[i + 1] == 1 /* Next */) + i = pair(this.data, i + 2); + else + return false; + } + if (action == pair(this.data, i + 1)) + return true; + } + } + /// Get the states that can follow this one through shift actions or + /// goto jumps. @internal + nextStates(state) { + let result = []; + for (let i = this.stateSlot(state, 1 /* Actions */);; i += 3) { + if (this.data[i] == 65535 /* End */) { + if (this.data[i + 1] == 1 /* Next */) + i = pair(this.data, i + 2); + else + break; + } + if ((this.data[i + 2] & (65536 /* ReduceFlag */ >> 16)) == 0) { + let value = this.data[i + 1]; + if (!result.some((v, i) => (i & 1) && v == value)) + result.push(this.data[i], value); + } + } + return result; + } + /// @internal + overrides(token, prev) { + let iPrev = findOffset(this.data, this.tokenPrecTable, prev); + return iPrev < 0 || findOffset(this.data, this.tokenPrecTable, token) < iPrev; + } + /// Configure the parser. Returns a new parser instance that has the + /// given settings modified. Settings not provided in `config` are + /// kept from the original parser. + configure(config) { + // Hideous reflection-based kludge to make it easy to create a + // slightly modified copy of a parser. + let copy = Object.assign(Object.create(LRParser.prototype), this); + if (config.props) + copy.nodeSet = this.nodeSet.extend(...config.props); + if (config.top) { + let info = this.topRules[config.top]; + if (!info) + throw new RangeError(`Invalid top rule name ${config.top}`); + copy.top = info; + } + if (config.tokenizers) + copy.tokenizers = this.tokenizers.map(t => { + let found = config.tokenizers.find(r => r.from == t); + return found ? found.to : t; + }); + if (config.contextTracker) + copy.context = config.contextTracker; + if (config.dialect) + copy.dialect = this.parseDialect(config.dialect); + if (config.strict != null) + copy.strict = config.strict; + if (config.wrap) + copy.wrappers = copy.wrappers.concat(config.wrap); + if (config.bufferLength != null) + copy.bufferLength = config.bufferLength; + return copy; + } + /// Tells you whether any [parse wrappers](#lr.ParserConfig.wrap) + /// are registered for this parser. + hasWrappers() { + return this.wrappers.length > 0; + } + /// Returns the name associated with a given term. This will only + /// work for all terms when the parser was generated with the + /// `--names` option. By default, only the names of tagged terms are + /// stored. + getName(term) { + return this.termNames ? this.termNames[term] : String(term <= this.maxNode && this.nodeSet.types[term].name || term); + } + /// The eof term id is always allocated directly after the node + /// types. @internal + get eofTerm() { return this.maxNode + 1; } + /// The type of top node produced by the parser. + get topNode() { return this.nodeSet.types[this.top[1]]; } + /// @internal + dynamicPrecedence(term) { + let prec = this.dynamicPrecedences; + return prec == null ? 0 : prec[term] || 0; + } + /// @internal + parseDialect(dialect) { + let values = Object.keys(this.dialects), flags = values.map(() => false); + if (dialect) + for (let part of dialect.split(" ")) { + let id = values.indexOf(part); + if (id >= 0) + flags[id] = true; + } + let disabled = null; + for (let i = 0; i < values.length; i++) + if (!flags[i]) { + for (let j = this.dialects[values[i]], id; (id = this.data[j++]) != 65535 /* End */;) + (disabled || (disabled = new Uint8Array(this.maxTerm + 1)))[id] = 1; + } + return new Dialect(dialect, flags, disabled); + } + /// (used by the output of the parser generator) @internal + static deserialize(spec) { + return new LRParser(spec); + } +} +function pair(data, off) { return data[off] | (data[off + 1] << 16); } +function findOffset(data, start, term) { + for (let i = start, next; (next = data[i]) != 65535 /* End */; i++) + if (next == term) + return i - start; + return -1; +} +function findFinished(stacks) { + let best = null; + for (let stack of stacks) { + let stopped = stack.p.stoppedAt; + if ((stack.pos == stack.p.stream.end || stopped != null && stack.pos > stopped) && + stack.p.parser.stateFlag(stack.state, 2 /* Accepting */) && + (!best || best.score < stack.score)) + best = stack; + } + return best; +} + +export { ContextTracker, ExternalTokenizer, InputStream, LRParser, Stack }; diff --git a/node_modules/@lezer/lr/dist/parse.d.ts b/node_modules/@lezer/lr/dist/parse.d.ts new file mode 100644 index 0000000000..9ae36c9db3 --- /dev/null +++ b/node_modules/@lezer/lr/dist/parse.d.ts @@ -0,0 +1,102 @@ +import { Tree, TreeFragment, NodeSet, NodeType, NodePropSource, Input, PartialParse, Parser, ParseWrapper } from "@lezer/common"; +import { Stack } from "./stack"; +import { Tokenizer, ExternalTokenizer, CachedToken, InputStream } from "./token"; +declare class FragmentCursor { + readonly fragments: readonly TreeFragment[]; + readonly nodeSet: NodeSet; + i: number; + fragment: TreeFragment | null; + safeFrom: number; + safeTo: number; + trees: Tree[]; + start: number[]; + index: number[]; + nextStart: number; + constructor(fragments: readonly TreeFragment[], nodeSet: NodeSet); + nextFragment(): void; + nodeAt(pos: number): Tree | null; +} +declare class TokenCache { + readonly stream: InputStream; + tokens: CachedToken[]; + mainToken: CachedToken | null; + actions: number[]; + constructor(parser: LRParser, stream: InputStream); + getActions(stack: Stack): number[]; + getMainToken(stack: Stack): CachedToken; + updateCachedToken(token: CachedToken, tokenizer: Tokenizer, stack: Stack): void; + putAction(action: number, token: number, end: number, index: number): number; + addActions(stack: Stack, token: number, end: number, index: number): number; +} +export declare class Parse implements PartialParse { + readonly parser: LRParser; + readonly input: Input; + readonly ranges: readonly { + from: number; + to: number; + }[]; + stacks: Stack[]; + recovering: number; + fragments: FragmentCursor | null; + nextStackID: number; + minStackPos: number; + reused: Tree[]; + stream: InputStream; + tokens: TokenCache; + topTerm: number; + stoppedAt: null | number; + constructor(parser: LRParser, input: Input, fragments: readonly TreeFragment[], ranges: readonly { + from: number; + to: number; + }[]); + get parsedPos(): number; + advance(): Tree; + stopAt(pos: number): void; + private advanceStack; + private advanceFully; + private runRecovery; + stackToTree(stack: Stack): Tree; + private stackID; +} +export declare class Dialect { + readonly source: string | undefined; + readonly flags: readonly boolean[]; + readonly disabled: null | Uint8Array; + constructor(source: string | undefined, flags: readonly boolean[], disabled: null | Uint8Array); + allows(term: number): boolean; +} +export declare class ContextTracker { + constructor(spec: { + start: T; + shift?(context: T, term: number, stack: Stack, input: InputStream): T; + reduce?(context: T, term: number, stack: Stack, input: InputStream): T; + reuse?(context: T, node: Tree, stack: Stack, input: InputStream): T; + hash?(context: T): number; + strict?: boolean; + }); +} +export interface ParserConfig { + props?: readonly NodePropSource[]; + top?: string; + dialect?: string; + tokenizers?: { + from: ExternalTokenizer; + to: ExternalTokenizer; + }[]; + contextTracker?: ContextTracker; + strict?: boolean; + wrap?: ParseWrapper; + bufferLength?: number; +} +export declare class LRParser extends Parser { + readonly nodeSet: NodeSet; + createParse(input: Input, fragments: readonly TreeFragment[], ranges: readonly { + from: number; + to: number; + }[]): PartialParse; + configure(config: ParserConfig): LRParser; + hasWrappers(): boolean; + getName(term: number): string; + get topNode(): NodeType; +} +export {}; diff --git a/node_modules/@lezer/lr/dist/stack.d.ts b/node_modules/@lezer/lr/dist/stack.d.ts new file mode 100644 index 0000000000..9882f0844e --- /dev/null +++ b/node_modules/@lezer/lr/dist/stack.d.ts @@ -0,0 +1,34 @@ +import { BufferCursor } from "@lezer/common"; +export declare class Stack { + pos: number; + get context(): any; + canShift(term: number): boolean; + get parser(): import("./parse").LRParser; + dialectEnabled(dialectID: number): boolean; + private shiftContext; + private reduceContext; + private updateContext; +} +export declare const enum Recover { + Insert = 200, + Delete = 190, + Reduce = 100, + MaxNext = 4, + MaxInsertStackDepth = 300, + DampenInsertStackDepth = 120 +} +export declare class StackBufferCursor implements BufferCursor { + stack: Stack; + pos: number; + index: number; + buffer: number[]; + constructor(stack: Stack, pos: number, index: number); + static create(stack: Stack, pos?: number): StackBufferCursor; + maybeNext(): void; + get id(): number; + get start(): number; + get end(): number; + get size(): number; + next(): void; + fork(): StackBufferCursor; +} diff --git a/node_modules/@lezer/lr/dist/token.d.ts b/node_modules/@lezer/lr/dist/token.d.ts new file mode 100644 index 0000000000..410183243a --- /dev/null +++ b/node_modules/@lezer/lr/dist/token.d.ts @@ -0,0 +1,35 @@ +import { Stack } from "./stack"; +export declare class CachedToken { + start: number; + value: number; + end: number; + extended: number; + lookAhead: number; + mask: number; + context: number; +} +export declare class InputStream { + private chunk2; + private chunk2Pos; + next: number; + pos: number; + private rangeIndex; + private range; + peek(offset: number): any; + acceptToken(token: number, endOffset?: number): void; + private getChunk; + private readNext; + advance(n?: number): number; + private setDone; +} +export interface Tokenizer { +} +interface ExternalOptions { + contextual?: boolean; + fallback?: boolean; + extend?: boolean; +} +export declare class ExternalTokenizer { + constructor(token: (input: InputStream, stack: Stack) => void, options?: ExternalOptions); +} +export {}; diff --git a/node_modules/@lezer/lr/package.json b/node_modules/@lezer/lr/package.json new file mode 100644 index 0000000000..fc1b87b6e8 --- /dev/null +++ b/node_modules/@lezer/lr/package.json @@ -0,0 +1,35 @@ +{ + "name": "@lezer/lr", + "version": "1.0.0", + "description": "Incremental parser", + "main": "dist/index.cjs", + "type": "module", + "exports": { + "import": "./dist/index.js", + "require": "./dist/index.cjs" + }, + "module": "dist/index.js", + "types": "dist/index.d.ts", + "author": "Marijn Haverbeke ", + "license": "MIT", + "repository": { + "type" : "git", + "url" : "https://github.com/lezer-parser/lr.git" + }, + "devDependencies": { + "rollup": "^2.52.2", + "@rollup/plugin-commonjs": "^15.1.0", + "@rollup/plugin-node-resolve": "^9.0.0", + "rollup-plugin-typescript2": "^0.30.0", + "typescript": "^4.3.4" + }, + "dependencies": { + "@lezer/common": "^1.0.0" + }, + "files": ["dist"], + "scripts": { + "test": "echo 'Tests are in @lezer/generator'", + "watch": "rollup -w -c rollup.config.js", + "prepare": "rollup -c rollup.config.js" + } +} diff --git a/node_modules/@silvermine/videojs-chromecast/.jsdoc b/node_modules/@silvermine/videojs-chromecast/.jsdoc new file mode 100644 index 0000000000..831f1dc2a0 --- /dev/null +++ b/node_modules/@silvermine/videojs-chromecast/.jsdoc @@ -0,0 +1,3 @@ +{ + "plugins": [ "plugins/markdown" ] +} diff --git a/node_modules/@silvermine/videojs-chromecast/.nvmrc b/node_modules/@silvermine/videojs-chromecast/.nvmrc new file mode 100644 index 0000000000..25615cc6a8 --- /dev/null +++ b/node_modules/@silvermine/videojs-chromecast/.nvmrc @@ -0,0 +1 @@ +12.22.1 diff --git a/node_modules/@silvermine/videojs-chromecast/.nycrc.json b/node_modules/@silvermine/videojs-chromecast/.nycrc.json new file mode 100644 index 0000000000..11f0896461 --- /dev/null +++ b/node_modules/@silvermine/videojs-chromecast/.nycrc.json @@ -0,0 +1,16 @@ +{ + "include": [ + "src/**/*.js" + ], + "extension": [ + ".js" + ], + "reporter": [ + "text-summary", + "html", + "lcov" + ], + "instrument": true, + "sourceMap": true, + "all": true +} diff --git a/node_modules/@silvermine/videojs-chromecast/LICENSE b/node_modules/@silvermine/videojs-chromecast/LICENSE new file mode 100644 index 0000000000..873928e946 --- /dev/null +++ b/node_modules/@silvermine/videojs-chromecast/LICENSE @@ -0,0 +1,20 @@ +The MIT License (MIT) +Copyright (c) 2017 Jeremy Thomerson + +Permission is hereby granted, free of charge, to any person obtaining a copy of +this software and associated documentation files (the "Software"), to deal in +the Software without restriction, including without limitation the rights to +use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies +of the Software, and to permit persons to whom the Software is furnished to do +so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in all +copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE +SOFTWARE. diff --git a/node_modules/@silvermine/videojs-chromecast/README.md b/node_modules/@silvermine/videojs-chromecast/README.md new file mode 100644 index 0000000000..1d6dd8b338 --- /dev/null +++ b/node_modules/@silvermine/videojs-chromecast/README.md @@ -0,0 +1,327 @@ +# Silvermine VideoJS Chromecast Plugin + +[![Build Status](https://travis-ci.org/silvermine/videojs-chromecast.svg?branch=master)](https://travis-ci.org/silvermine/videojs-chromecast) +[![Coverage Status](https://coveralls.io/repos/github/silvermine/videojs-chromecast/badge.svg?branch=master)](https://coveralls.io/github/silvermine/videojs-chromecast?branch=master) +[![Dependency Status](https://david-dm.org/silvermine/videojs-chromecast.svg)](https://david-dm.org/silvermine/videojs-chromecast) +[![Dev Dependency Status](https://david-dm.org/silvermine/videojs-chromecast/dev-status.svg)](https://david-dm.org/silvermine/videojs-chromecast#info=devDependencies&view=table) + + +## What is it? + +A plugin for [videojs](http://videojs.com/) versions 6+ that adds a button to the control +bar which will cast videos to a Chromecast. + + +## How do I use it? + +The `@silvermine/videojs-chromecast` plugin includes 3 types of assets: javascript, CSS, +and images. + +You can either build the plugin locally and use the assets that are output from the build +process directly, or you can install the plugin as an npm module, include the +javascript and SCSS source in your project using a Common-JS module loader and SASS build +process, and copy the images from the image source folder to your project. + +Note that regardless of whether you are using this plugin via the pre-built JS or as a +module, the Chromecast framework will need to be included after the plugin. For example: + +```html + + + +``` + +### Building the plugin locally + + 1. Either clone this repository or install the `@silvermine/videojs-chromecast` module + using `npm install @silvermine/videojs-chromecast`. + 2. Ensure that `@silvermine/videojs-chromecast`'s `devDependencies` are installed by + running `npm install` from within the `videojs-chromecast` folder. + 3. Run `grunt build` to build and copy the javascript, CSS and image files to the + `videojs-chromecast/dist` folder. + 4. Copy the plugin's files from the `dist` folder into your project as needed. + 5. Ensure that the images in the `dist/images` folder are accessible at `./images/`, + relative to where the plugin's CSS is located. If, for example, your CSS is located + at `https://example.com/plugins/silvermine-videojs-chromecast.css`, then the + plugin's images should be located at `https://example.com/plugins/images/`. + 6. Follow the steps in the "Configuration" section below. + +Note: when adding the plugin's javascript to your web page, include the +`silvermine-videojs-chromecast.min.js` javascript file in your HTML *after* loading +Video.js. The plugin's built javascript file expects there to be a reference to Video.js +at `window.videojs` and will throw an error if it does not exist. + +### Initialization options + +* **`preloadWebComponents`** (default: `false`) - The Chromecast framework relies on the + `webcomponents.js` polyfill when a browser does not have `document.registerElement` in + order to create the `` custom component (which is not used by this + plugin). If you are using jQuery, this polyfill must be loaded and initialized before + jQuery is initialized. Unfortunately, the Chromecast framework loads the + `webcomponents.js` polyfill via a dynamically created ` + +``` + +### Configuration + +Once the plugin has been loaded and registered, configure it and add it to your Video.js +player using Video.js' plugin configuration option (see the section under the heading +"Setting up a Plugin" on [Video.js' plugin documentation page][videojs-docs]. + +**Important: In addition to defining plugin configuration, you are required to define the +player's `techOrder` option, setting `'chromecast'` as the first Tech in the list.** Below +is an example of the minimum required configuration for the Chromecast plugin to function: + +```js +var options; + +options = { + controls: true, + techOrder: [ 'chromecast', 'html5' ], // You may have more Tech, such as Flash or HLS + plugins: { + chromecast: {} + } +}; + +videojs(document.getElementById('myVideoElement'), options); +``` + +Please note that even if you choose not to use any of the configuration options, you must +either provide a `chromecast` entry in the `plugins` option for Video.js to initialize the +plugin for you: + +```js +options = { + plugins: { + chromecast: {} + } +}; +``` + +or you must initialize the plugin manually: + +```js +var player = videojs(document.getElementById('myVideoElement')); + +player.chromecast(); // initializes the Chromecast plugin +``` + +#### Configuration options + +##### Plugin configuration +* **`plugins.chromecast.receiverAppID`** - the string ID of a custom [Chromecast receiver + app][cast-receiver] to use. Defaults to the [default Media Receiver ID][def-cast-id]. +* **`plugins.chromecast.addButtonToControlBar`** - a `boolean` flag that tells the plugin + whether or not it should automatically add the Chromecast button to the Video.js + player's control bar component. Defaults to `true`. +* **`plugins.chromecast.buttonPositionIndex`** - a zero-based number specifying the index + of the Chromecast button among the control bar's child components (if + `addButtonToControlBar` is set to `true`). By default the Chromecast Button is added as + the last child of the control bar. A value less than 0 puts the button at the specified + position from the end of the control bar. Note that it's likely not all child components + of the control bar are visible. + +##### Chromecast Tech configuration +* **`chromecast.requestTitleFn`** - a function that this plugin calls when it needs a + string that will be the title shown in the UI that is shown when a Chromecast session is + active and connected. When the this plugin calls the `requestTitleFn`, it passes it the + [current `source` object][player-source] and expects a string in return. If nothing is + returned or if this option is not defined, no title will be shown. +* **`chromecast.requestSubtitleFn`** - a function that this plugin calls when it needs a + string that will be the sub-title shown in the UI that is shown when a Chromecast + session is active and connected. When the this plugin calls the `requestSubtitleFn`, it + passes it the [current `source` object][player-source] and expects a string in return. + If nothing is returned or if this option is not defined, no sub-title will be shown. +* **`chromecast.requestCustomDataFn`** - a function that this plugin calls when it needs an + object that contains custom information necessary for a Chromecast receiver app when a + session is active and connected. When the this plugin calls the `requestCustomDataFn`, it + passes it the [current `source` object][player-source] and expects an object in return. + If nothing is returned or if this option is not defined, no custom data will be sent. + This option is intended to be used with a [custom receiver][custom-receiver] application + to extend its default capabilities. + +Here is an example configuration object that makes full use of all required and optional +configuration: + +```js +var titles, subtitles, customData, options; + +titles = { + 'https://example.com/videos/video-1.mp4': 'Example Title', + 'https://example.com/videos/video-2.mp4': 'Example Title2', +}; + +subtitles = { + 'https://example.com/videos/video-1.mp4': 'Subtitle', + 'https://example.com/videos/video-2.mp4': 'Subtitle2', +}; + +customData = { + 'https://example.com/videos/video-1.mp4': { 'customColor': '#0099ee' }, + 'https://example.com/videos/video-2.mp4': { 'customColor': '#000080' }, +}; + +options = { + // Must specify the 'chromecast' Tech first + techOrder: [ 'chromecast', 'html5' ], // Required + // Configuration for the Chromecast Tech + chromecast: { + requestTitleFn: function(source) { // Not required + return titles[source.url]; + }, + requestSubtitleFn: function(source) { // Not required + return subtitles[source.url]; + }, + requestCustomDataFn: function(source) { // Not required + return customData[source.url]; + } + }, + plugins: { + chromecast: { + receiverAppID: '1234' // Not required + addButtonToControlBar: false, // Defaults to true + }, + } +}; +``` + +##### Localization + +The `ChromecastButton` component has one translated string: "Open Chromecast menu". The +"Open Chromecast menu" string appears in both of the standard places for Button component +accessibility text: inside the `.vjs-control-text` span and as the `