use fastest-levenshtein

[nissa-seru]

We are already using fastest-levenshtein - this diff is to just remove the homebrew implementation and uniformly use the (more efficient) implementation from the package.

---

Important

Replaces custom Levenshtein distance function with fastest-levenshtein package in search-replace.ts.

• Behavior:
  • Replaces custom levenshteinDistance function with distance from fastest-levenshtein in getSimilarity() in search-replace.ts.
  • Removes the entire custom implementation of Levenshtein distance.
• Imports:
  • Adds import for distance from fastest-levenshtein in search-replace.ts.

^{This description was created by for 5a1299c. It will automatically update as commits are pushed.}

[changeset-bot]

⚠️ No Changeset found

Latest commit: 5a1299c

Merging this PR will not cause a version bump for any packages. If these changes should not result in a new version, you're good to go. If these changes should result in a version bump, you need to add a changeset.

Click here to learn what changesets are, and how to add one.

Click here if you're a maintainer who wants to add a changeset to this PR