BETAmodules.com is in beta — open to partnerships & joint ventures.Build with us
modules.com
⌘K

diff-lcs

v2.0.0RubyGems· Ruby

Diff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm. It includes utilities to create a simple HTML diff output format and a standard diff-like tool. This is release 2.0, which has significant breaking changes (removal of deprecations and workarounds) and requires at least Ruby 3.2 or higher. See full details in the `CHANGELOG`, but users of diff-lcs should not notice any significant changes to the APIs. ==== To Install:

The verdict
Worth a look. Actively maintained and growing, actively maintained.
Live from the RubyGems registry · derived rules, not AI
How it scores
MaintenanceHealthy
PopularityRising
SecurityClean
LicensePermissive
DepsZero deps
Maintenance
Last published 4 months ago.
Popularity
19K downloads / week
Security
No known advisories for this version (OSV).
License
MIT
Dependencies
No runtime dependencies
Recent releases
  • 2.0.04 months ago
  • 2.0.0.beta.24 months ago
  • 2.0.0.beta.15 months ago
  • 1.6.2over a year ago
  • 1.6.1over a year ago
  • 1.6.0over a year ago
  • 1.5.12 years ago
  • 1.5.04 years ago
diff-lcs — Diff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm. It includes utilities to create a simple HTML diff output format and a standard diff-like tool. This is release 2.0, which has significant breaking changes (removal of deprecations and workarounds) and requires at least Ruby 3.2 or higher. See full details in the `CHANGELOG`, but users of diff-lcs should not notice any significant changes to the APIs. ==== To Install: (Ruby / RubyGems) · Modules