@adecore/editor-core 0.0.1 → 0.17.0-beta.2

package/LICENSE

@@ -0,0 +1,110 @@
+# Functional Source License, Version 1.1, MIT Future License
+
+## Abbreviation
+
+FSL-1.1-MIT
+
+## Notice
+
+Copyright 2026 - present Bas Milius
+
+## Terms and Conditions
+
+### Licensor ("We")
+
+The party offering the Software under these Terms and Conditions.
+
+### The Software
+
+The "Software" is each version of the software that we make available under
+these Terms and Conditions, as indicated by our inclusion of these Terms and
+Conditions with the Software.
+
+### License Grant
+
+Subject to your compliance with this License Grant and the Patents,
+Redistribution and Trademark clauses below, we hereby grant you the right to
+use, copy, modify, create derivative works, publicly perform, publicly display
+and redistribute the Software for any Permitted Purpose identified below.
+
+### Permitted Purpose
+
+A Permitted Purpose is any purpose other than a Competing Use. A Competing Use
+means making the Software available to others in a commercial product or
+service that:
+
+1. substitutes for the Software;
+
+2. substitutes for any other product or service we offer using the Software
+   that exists as of the date we make the Software available; or
+
+3. offers the same or substantially similar functionality as the Software.
+
+Permitted Purposes specifically include using the Software:
+
+1. for your internal use and access;
+
+2. for non-commercial education;
+
+3. for non-commercial research; and
+
+4. in connection with professional services that you provide to a licensee
+   using the Software in accordance with these Terms and Conditions.
+
+### Patents
+
+To the extent your use for a Permitted Purpose would necessarily infringe our
+patents, the license grant above includes a license under our patents. If you
+make a claim against any party that the Software infringes or contributes to
+the infringement of any patent, then your patent license to the Software ends
+immediately.
+
+### Redistribution
+
+The Terms and Conditions apply to all copies, modifications and derivatives of
+the Software.
+
+If you redistribute any copies, modifications or derivatives of the Software,
+you must include a copy of or a link to these Terms and Conditions and not
+remove any copyright notices provided in or with the Software.
+
+### Disclaimer
+
+THE SOFTWARE IS PROVIDED "AS IS" AND WITHOUT WARRANTIES OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING WITHOUT LIMITATION WARRANTIES OF FITNESS FOR A PARTICULAR
+PURPOSE, MERCHANTABILITY, TITLE OR NON-INFRINGEMENT.
+
+IN NO EVENT WILL WE HAVE ANY LIABILITY TO YOU ARISING OUT OF OR RELATED TO THE
+SOFTWARE, INCLUDING INDIRECT, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES,
+EVEN IF WE HAVE BEEN INFORMED OF THEIR POSSIBILITY IN ADVANCE.
+
+### Trademarks
+
+Except for displaying the License Details and identifying us as the origin of
+the Software, you have no right under these Terms and Conditions to use our
+trademarks, trade names, service marks or product names.
+
+## Grant of Future License
+
+We hereby irrevocably grant you an additional license to use the Software under
+the MIT license that is effective on the second anniversary of the date we make
+the Software available. On or after that date, you may use the Software under
+the MIT license, in which case the following will apply:
+
+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.

package/LICENSE.apache-2.0.txt

@@ -0,0 +1,201 @@
+Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,11 @@
+@adecore/editor-core
+
+Original project sources remain under FSL-1.1-MIT (see LICENSE), except what is named below.
+
+The word-boundary predicates in src/words.ts are adapted from the IntelliJ Platform, Copyright
+2000-2023 JetBrains s.r.o. and contributors, under the Apache License, Version 2.0 (see
+LICENSE.apache-2.0.txt). The TypeScript translation is a modified version. README.md names the
+upstream file and revision.
+
+This package is independent and is not affiliated with JetBrains or Microsoft. It does not bundle
+Monaco, CodeMirror, or the IntelliJ Platform runtime.

package/README.md

@@ -0,0 +1,40 @@
+# @adecore/editor-core
+
+[![npm](https://img.shields.io/npm/v/@adecore/editor-core)](https://www.npmjs.com/package/@adecore/editor-core)
+[![Docs](https://img.shields.io/badge/docs-adecore.dev-blue)](https://adecore.dev/editor-core/)
+
+The document model of a code editor, with no DOM and no dependencies. `DocumentModel` holds the text, the selections, an undo history and the editing commands: typing with bracket pairing, smart Enter, comment toggles, line moves, multiple carets, search and folding. It runs in a browser, Bun and Node. [`@adecore/editor`](https://adecore.dev/editor/) draws it on screen.
+
+## Install
+
+```sh
+bun add @adecore/editor-core
+```
+
+## Use
+
+```ts
+import { DocumentModel } from '@adecore/editor-core';
+
+const document = new DocumentModel('const greeting = "hello";\n');
+
+document.setSelections([{ anchor: 26, head: 26 }]);
+document.typeText('(', { language: 'typescript' }); // the closer comes along
+document.undo();
+```
+
+Offsets are UTF-16 code units, lines and columns zero-based. A batch of edits is simultaneous, in the coordinates of the text before it.
+
+## Documentation
+
+| Page | What it covers |
+|---|---|
+| [Overview](https://adecore.dev/editor-core/) | Coordinates, limits and provenance |
+| [Documents and edits](https://adecore.dev/editor-core/documents) | Text, selections, edit batches, revisions, history and change events |
+| [Typing and commands](https://adecore.dev/editor-core/commands) | `typeText`, `paste`, `execute` and their options |
+| [Search and folding](https://adecore.dev/editor-core/search-folding) | Find and replace, folding ranges and roles |
+| [API reference](https://adecore.dev/editor-core/api) | The helpers and types next to the model |
+
+## License
+
+FSL-1.1-MIT, except the word-boundary predicates in `src/words.ts`, which are adapted from the IntelliJ Platform (`EditorActionUtil.java` of JetBrains/intellij-community at `7184b03af6c5370e79a01ded0df68cf56d7669da`, lines 934 through 982) under Apache 2.0. `NOTICE` and `LICENSE.apache-2.0.txt` ship with the package.

package/dist/block-folds.d.ts

@@ -0,0 +1,3 @@
+import type { DocumentLine } from './rope.ts';
+import type { FoldingRange } from './structure.ts';
+export declare function blockFolds(lineCount: number, getLine: (line: number) => DocumentLine, language: string): FoldingRange[];

package/dist/block-folds.js

@@ -0,0 +1,112 @@
+import { rangeOf } from './lexical-folds.js';
+const MARKDOWN = /^(markdown|md|mdx)$/i;
+const HEADING = /^(#{1,6})\s+\S/;
+const FENCE = /^\s*(`{3,}|~{3,})/;
+const TABLE_ROW = /^\s*\|/;
+const HEREDOC = /<<<[ \t]*(["']?)([A-Za-z_]\w*)\1\s*$/;
+/*
+ * Front matter, code fences, tables and the sections under headings. A fence closes on a line of the same
+ * character and at least as long, and what a fence holds is never read as a heading or a table.
+ */
+function markdownFolds(lineCount, getLine) {
+    const result = [];
+    const headings = [];
+    let first = 0;
+    if (lineCount > 0 && getLine(0).text.trim() === '---') {
+        for (let line = 1; line < lineCount; line++) {
+            const text = getLine(line).text.trim();
+            if (text === '---' || text === '...') {
+                result.push(rangeOf(0, line, getLine, 'block', 'front-matter'));
+                first = line + 1;
+                break;
+            }
+        }
+    }
+    let tableStart = -1;
+    const flushTable = (end) => {
+        if (tableStart !== -1 && end > tableStart) {
+            result.push(rangeOf(tableStart, end, getLine, 'block', 'table'));
+        }
+        tableStart = -1;
+    };
+    for (let line = first; line < lineCount; line++) {
+        const text = getLine(line).text;
+        const fence = FENCE.exec(text);
+        if (fence !== null) {
+            flushTable(line - 1);
+            const marker = fence[1];
+            let end = -1;
+            for (let next = line + 1; next < lineCount && end === -1; next++) {
+                const closer = FENCE.exec(getLine(next).text);
+                if (closer !== null && closer[1][0] === marker[0] && closer[1].length >= marker.length && getLine(next).text.trim() === closer[1]) {
+                    end = next;
+                }
+            }
+            if (end !== -1) {
+                result.push(rangeOf(line, end, getLine, 'block', 'code-fence'));
+                line = end;
+            }
+            continue;
+        }
+        if (TABLE_ROW.test(text)) {
+            tableStart = tableStart === -1 ? line : tableStart;
+            continue;
+        }
+        flushTable(line - 1);
+        const heading = HEADING.exec(text);
+        if (heading !== null) {
+            headings.push({ line, level: heading[1].length });
+        }
+    }
+    flushTable(lineCount - 1);
+    for (const [index, heading] of headings.entries()) {
+        const next = headings.slice(index + 1).find((candidate) => candidate.level <= heading.level);
+        let end = (next?.line ?? lineCount) - 1;
+        while (end > heading.line && getLine(end).text.trim() === '') {
+            end--;
+        }
+        if (end > heading.line) {
+            result.push(rangeOf(heading.line, end, getLine, 'section'));
+        }
+    }
+    return result;
+}
+/* `<?php ... ?>` blocks that sit between markup, and heredocs and nowdocs. A block that opens the file is the file, not a fold. */
+function phpFolds(lineCount, getLine) {
+    const result = [];
+    let open = -1;
+    for (let line = 0; line < lineCount; line++) {
+        const text = getLine(line).text;
+        const heredoc = HEREDOC.exec(text);
+        if (heredoc !== null) {
+            const closer = new RegExp(`^\\s*${heredoc[2]}\\b`);
+            for (let next = line + 1; next < lineCount; next++) {
+                if (closer.test(getLine(next).text)) {
+                    result.push(rangeOf(line, next, getLine, 'block', 'heredoc'));
+                    line = next;
+                    break;
+                }
+            }
+            continue;
+        }
+        const opened = open === -1 ? text.search(/<\?(?:php\b|=)/) : -1;
+        const closed = text.indexOf('?>', Math.max(0, opened));
+        if (opened !== -1 && closed === -1) {
+            open = line === 0 ? -1 : line;
+        }
+        else if (open !== -1 && closed !== -1) {
+            if (line > open) {
+                result.push(rangeOf(open, line, getLine, 'block', 'php-tag'));
+            }
+            open = -1;
+        }
+    }
+    return result;
+}
+/* The folds of whole lines that a language has beyond brackets and indentation. */
+export function blockFolds(lineCount, getLine, language) {
+    if (MARKDOWN.test(language)) {
+        return markdownFolds(lineCount, getLine);
+    }
+    return language.toLowerCase() === 'php' ? phpFolds(lineCount, getLine) : [];
+}

package/dist/brackets.d.ts

@@ -0,0 +1,5 @@
+export interface BracketIndex {
+    pairs: ReadonlyMap<number, number>;
+    unmatched: ReadonlySet<number>;
+}
+export declare function scanBrackets(text: string, language?: string): BracketIndex;

package/dist/brackets.js

@@ -0,0 +1,136 @@
+import { hasBlockComments, hasDashComments, hasHashComments, hashNeedsWordStart, hasMarkupComments, hasSlashComments, isPhp, isScript, isWordCharacter, openers, startsExpression, startsExpressionAfter, startsWord } from './lexical.js';
+function skipLine(text, at) {
+    const end = text.indexOf('\n', at + 1);
+    return end < 0 ? text.length : end;
+}
+function skipComment(text, from, terminator) {
+    const end = text.indexOf(terminator, from);
+    return end < 0 ? text.length : end + terminator.length - 1;
+}
+function skipString(text, at, quote, endsAtLineBreak) {
+    let cursor = at + 1;
+    for (; cursor < text.length; cursor++) {
+        if (text[cursor] === '\\') {
+            cursor++;
+        }
+        else if (text[cursor] === quote || (endsAtLineBreak && /[\r\n]/.test(text[cursor]))) {
+            break;
+        }
+    }
+    return cursor;
+}
+function skipRegex(text, at) {
+    let inClass = false;
+    let cursor = at + 1;
+    for (; cursor < text.length; cursor++) {
+        const character = text[cursor];
+        if (character === '\\') {
+            cursor++;
+        }
+        else if (character === '[') {
+            inClass = true;
+        }
+        else if (character === ']') {
+            inClass = false;
+        }
+        else if ((character === '/' && !inClass) || /[\r\n]/.test(character)) {
+            break;
+        }
+    }
+    return cursor;
+}
+/* Lexical pairing for incomplete code; malformed nesting never produces crossing pairs. */
+export function scanBrackets(text, language = 'typescript') {
+    const pairs = new Map();
+    const unmatched = new Set();
+    const stack = [];
+    const script = isScript(language);
+    const hashComments = hasHashComments(language);
+    const hashAtWordStart = hashNeedsWordStart(language);
+    const dashComments = hasDashComments(language);
+    const phpAttributes = isPhp(language);
+    const slashComments = hasSlashComments(language);
+    const blockComments = hasBlockComments(language);
+    const markupComments = hasMarkupComments(language);
+    let inTemplate = false;
+    let expectsExpression = true;
+    for (let at = 0; at < text.length; at++) {
+        const char = text[at];
+        const next = text[at + 1];
+        if (inTemplate) {
+            if (char === '\\') {
+                at++;
+            }
+            else if (char === '`') {
+                inTemplate = false;
+                expectsExpression = false;
+            }
+            else if (char === '$' && next === '{') {
+                stack.push({ at: ++at, close: '}', template: true });
+                inTemplate = false;
+                expectsExpression = true;
+            }
+            continue;
+        }
+        if (/\s/.test(char)) {
+            continue;
+        }
+        if (markupComments && text.startsWith('<!--', at)) {
+            at = skipComment(text, at + 4, '-->');
+        }
+        else if ((slashComments && char === '/' && next === '/') ||
+            (dashComments && char === '-' && next === '-') ||
+            (hashComments && char === '#' && !(phpAttributes && next === '[') && (!hashAtWordStart || startsWord(text, at)))) {
+            at = skipLine(text, at);
+        }
+        else if (blockComments && char === '/' && next === '*') {
+            at = skipComment(text, at + 2, '*/');
+        }
+        else if (char === '"' || char === "'") {
+            at = skipString(text, at, char, script);
+            expectsExpression = false;
+        }
+        else if (script && char === '`') {
+            inTemplate = true;
+        }
+        else if (script && char === '/' && expectsExpression) {
+            at = skipRegex(text, at);
+            expectsExpression = false;
+        }
+        else if (openers[char]) {
+            stack.push({ at, close: openers[char] });
+            expectsExpression = true;
+        }
+        else if (/[)\]}]/.test(char)) {
+            const open = stack.at(-1);
+            if (open?.close === char) {
+                stack.pop();
+                pairs.set(open.at, at);
+                pairs.set(at, open.at);
+                inTemplate = open.template === true;
+            }
+            else {
+                unmatched.add(at);
+                // A mismatched closer keeps a distant opener from claiming it later.
+                for (const abandoned of stack.splice(0)) {
+                    unmatched.add(abandoned.at);
+                }
+            }
+            expectsExpression = false;
+        }
+        else if (isWordCharacter(char)) {
+            const start = at;
+            while (at + 1 < text.length && isWordCharacter(text[at + 1])) {
+                at++;
+            }
+            expectsExpression = startsExpression(text.slice(start, at + 1));
+        }
+        else {
+            expectsExpression = startsExpressionAfter(char);
+        }
+    }
+    for (const open of stack) {
+        unmatched.add(open.at);
+    }
+    return { pairs, unmatched };
+}

package/dist/closer-tracker.d.ts

@@ -0,0 +1,9 @@
+import type { Selection, TextEdit } from './types.ts';
+export declare class CloserTracker {
+    private marks;
+    add(open: number, close: number): void;
+    isCloserAt(offset: number): boolean;
+    map(edits: readonly TextEdit[]): void;
+    prune(selections: readonly Selection[]): void;
+    clear(): void;
+}