array-timsort is a fast JavaScript array sorting module that implements Python’s Timsort algorithm, described as adaptive and stable. It can sort arrays lexicographically by default, accept a custom compare function, and optionally sort a subrange, returning an array of indexes that records how elements were reordered.
Project status
- The repository appears quiet or effectively in maintenance mode, with the last upstream push on 2020-10-01, and no evidence of ongoing updates since then.
- Update cadence is not current, with updates concentrated on 2020-10-01 (versions 1.0.1 to 1.0.3 published within minutes), then a long gap of nearly six years to today (2026-08-12).
AI summary generated
Recent updates
1.0.3
Release 1.0.3 does not include any functional code changes in the provided diff. The only modifications are a README wording update and a package.json version bump from 1.0.2 to 1.0.3.
1.0.2
Release 1.0.2 contains only a package version bump and a README update. No actual implementation code changes are shown in the provided diff, so functional behavior should remain the same.
1.0.1
Release 1.0.1 was published on 2020-10-01, but no release notes were provided by the publisher. As a result, it is not possible to confirm what changed, whether there are any breaking changes, or if fixes were included based solely on the provided information.
1.0.0
Release 1.0.0 contains no provided release notes. The code diff shows a package rename (from timsort-result to array-timsort) along with internal changes to the TimSort index-tracking logic and updates to CI/test coverage.
Breaking0.0.1
This is version 0.0.1, but no release notes were provided by the publisher. As a result, the documented set of changes (features, fixes, or breaking changes) cannot be determined from the available information.