Graphmatch is a low-level JavaScript utility for matching a string against a directed acyclic graph of regular expressions. It can match fully or partially, supports fine-grained control over which nodes allow partial matches, and can compile the whole graph into a single RegExp for repeated use.
Project status
- Actively maintained: The repo shows recent activity, with the latest upstream push on 2026-02-14, and updates continuing into the 2026 time frame.
- Update cadence: Updates appear on a roughly 3 to 4 month rhythm (e.g., 2025-10-11, 2025-10-19, 2026-02-14), with no long multi-year gap evident.
AI summary generated
Recent updates
v1.1.1
Release v1.1.1 makes a minimal change to package metadata. The code diff shows only updates to package.json, including adding a license field and bumping the package version from 1.1.0 to 1.1.1.
v1.1.0
Release v1.1.0 contains no published release notes. The code changes add fine-grained partial matching support by introducing a per-node `partial` override and modifying the regex source generation logic used for partial matches.
BreakingFeaturesv1.0.2
Release v1.0.2 was published on 2025-10-19, but the publisher did not provide any release notes describing changes. As a result, there is no documented information about new features, bug fixes, breaking changes, or dependency updates in this release.
v1.0.1
Release v1.0.1 contains no publisher-provided release notes. The only detected change in the diff is a package.json update, including a version bump and removal of an entry from dependencies.
v1.0.0
Release v1.0.0 was published on 2025-10-11, but no release notes were provided by the publisher. As a result, no specific new features, fixes, breaking changes, or migration actions can be confirmed from the release notes alone.