@boperators/plugin-ts-language-server 0.1.4 → 0.2.0

package/dist/SourceMap.js

@@ -4,12 +4,12 @@ exports.SourceMap = void 0;
 /**
  * Bidirectional position mapping between original and transformed source text.
  *
- * Computes a list of edit records by diffing the two texts, then provides
- * O(edits) position and span mapping in both directions.
+ * Wraps pre-computed edit records and provides O(edits) position and span
+ * mapping in both directions, for use by the language service proxy.
  */
 class SourceMap {
-    constructor(original, transformed) {
-        this.edits = computeEdits(original, transformed);
+    constructor(edits) {
+        this.edits = edits;
     }
     /** Returns true if no edits were detected (original === transformed). */
     get isEmpty() {
@@ -20,14 +20,11 @@ class SourceMap {
         let delta = 0;
         for (const edit of this.edits) {
             if (pos < edit.origStart) {
-                // Before this edit — just apply accumulated delta
                 break;
             }
             if (pos < edit.origEnd) {
-                // Inside an edited region — map to start of the transformed replacement
                 return edit.transStart;
             }
-            // Past this edit — accumulate the delta
             delta = edit.transEnd - edit.origEnd;
         }
         return pos + delta;
@@ -40,7 +37,6 @@ class SourceMap {
                 break;
             }
             if (pos < edit.transEnd) {
-                // Inside a transformed region — map to start of the original span
                 return edit.origStart;
             }
             delta = edit.origEnd - edit.transEnd;
@@ -78,91 +74,3 @@ class SourceMap {
     }
 }
 exports.SourceMap = SourceMap;
-/**
- * Compute edit records by scanning both texts for mismatches.
- *
- * Uses character-level comparison with anchor-based convergence:
- * identical characters are skipped, mismatches start an edit region,
- * and convergence is found by searching for a matching anchor substring
- * in the remaining text.
- */
-function computeEdits(original, transformed) {
-    if (original === transformed)
-        return [];
-    const edits = [];
-    let i = 0; // index in original
-    let j = 0; // index in transformed
-    while (i < original.length && j < transformed.length) {
-        // Skip matching characters
-        if (original[i] === transformed[j]) {
-            i++;
-            j++;
-            continue;
-        }
-        // Mismatch — start of an edit
-        const origEditStart = i;
-        const transEditStart = j;
-        // Find where the texts converge again.
-        // Search for an anchor: a substring from `original` that also
-        // appears at the corresponding position in `transformed`.
-        const ANCHOR_LEN = 8;
-        let found = false;
-        // Scan ahead in original from the mismatch point
-        for (let oi = origEditStart + 1; oi <= original.length - ANCHOR_LEN; oi++) {
-            const anchor = original.substring(oi, oi + ANCHOR_LEN);
-            const transPos = transformed.indexOf(anchor, transEditStart);
-            if (transPos >= 0) {
-                // Verify the anchor actually converges by checking a few more chars
-                let valid = true;
-                const verifyLen = Math.min(ANCHOR_LEN * 2, original.length - oi, transformed.length - transPos);
-                for (let k = ANCHOR_LEN; k < verifyLen; k++) {
-                    if (original[oi + k] !== transformed[transPos + k]) {
-                        valid = false;
-                        break;
-                    }
-                }
-                if (valid) {
-                    edits.push({
-                        origStart: origEditStart,
-                        origEnd: oi,
-                        transStart: transEditStart,
-                        transEnd: transPos,
-                    });
-                    i = oi;
-                    j = transPos;
-                    found = true;
-                    break;
-                }
-            }
-        }
-        if (!found) {
-            // No convergence — remaining text is all part of the edit.
-            // Use common suffix to tighten the bounds.
-            let suffixLen = 0;
-            while (suffixLen < original.length - origEditStart &&
-                suffixLen < transformed.length - transEditStart &&
-                original[original.length - 1 - suffixLen] ===
-                    transformed[transformed.length - 1 - suffixLen]) {
-                suffixLen++;
-            }
-            edits.push({
-                origStart: origEditStart,
-                origEnd: original.length - suffixLen,
-                transStart: transEditStart,
-                transEnd: transformed.length - suffixLen,
-            });
-            i = original.length;
-            j = transformed.length;
-        }
-    }
-    // Handle remaining text at the end
-    if (i < original.length || j < transformed.length) {
-        edits.push({
-            origStart: i,
-            origEnd: original.length,
-            transStart: j,
-            transEnd: transformed.length,
-        });
-    }
-    return edits;
-}

package/dist/index.js

@@ -1,5 +1,6 @@
 "use strict";
 const boperators_1 = require("boperators");
+const SourceMap_1 = require("./SourceMap");
 // ----- Overload edit scanner -----
 /**
  * Before transformation, find all expressions (binary, prefix unary, postfix unary)
@@ -306,6 +307,7 @@ function createProxy(ts, ls, cache, project) {
     // Copy all methods from the underlying language service
     const proxy = Object.create(null);
     for (const key of Object.keys(ls)) {
+        // biome-ignore lint/suspicious/noExplicitAny: <TODO: fix this>
         proxy[key] = ls[key];
     }
     // --- Diagnostics: remap output spans + suppress overload errors ---
@@ -570,6 +572,7 @@ function createProxy(ts, ls, cache, project) {
         const transformedPos = sourceMap
             ? sourceMap.originalToTransformed(position)
             : position;
+        // biome-ignore lint/complexity/noBannedTypes: <TODO: fix this>
         const result = ls.findRenameLocations(fileName, transformedPos, findInStrings, findInComments, preferences);
         if (!result)
             return result;
@@ -669,7 +672,7 @@ module.exports = function init(modules) {
                 cache.set(fileName, {
                     version,
                     text: result.text,
-                    sourceMap: result.sourceMap,
+                    sourceMap: new SourceMap_1.SourceMap(result.edits),
                     overloadEdits,
                 });
                 return ts.ScriptSnapshot.fromString(result.text);
@@ -679,7 +682,7 @@ module.exports = function init(modules) {
                 cache.set(fileName, {
                     version,
                     text: source,
-                    sourceMap: new boperators_1.SourceMap(source, source),
+                    sourceMap: new SourceMap_1.SourceMap([]),
                     overloadEdits: [],
                 });
                 return snap;

package/package.json

@@ -1,13 +1,16 @@
 {
 	"name": "@boperators/plugin-ts-language-server",
-	"version": "0.1.4",
+	"version": "0.2.0",
 	"license": "MIT",
 	"description": "TypeScript Language Server plugin for boperators - IDE support with source mapping.",
 	"repository": {
 		"type": "git",
-		"url": "https://github.com/DiefBell/boperators",
+		"url": "git+https://github.com/DiefBell/boperators.git",
 		"directory": "plugins/ts-language-server"
 	},
+	"bugs": {
+		"url": "https://github.com/DiefBell/boperators/issues"
+	},
 	"homepage": "https://github.com/DiefBell/boperators/tree/main/plugins/ts-language-server",
 	"type": "commonjs",
 	"main": "./dist/index.js",
@@ -33,7 +36,7 @@
 		"dist"
 	],
 	"peerDependencies": {
-		"boperators": "0.1.4",
+		"boperators": "0.2.0",
 		"typescript": ">=5.0.0 <5.10.0"
 	},
 	"devDependencies": {