Skip to content

fix: resolve pending intervaltree work and guard releases - #13

Merged
hexsprite merged 5 commits into
masterfrom
fix/pending-intervaltree-beads
Oct 4, 2026
Merged

hexsprite merged 5 commits into
masterfrom
fix/pending-intervaltree-beads

Conversation

@hexsprite

@hexsprite hexsprite commented Oct 4, 2026 •

Copy link
Copy Markdown
Owner

Query arrays and iteration now have canonical returned-bound order, independent of how the tree was built. Length selection uses the same clipped ordering in both adapters, so [[0,10],[3,5]].findOneByLengthStartingAt(1,4) returns [4,5).

This also corrects the README date example, replaces the string-based debug build guard with CJS/ESM behavior probes, records the generic-library glossary and derived-members design, and adds packed Focuster freelist and release-label CI checks. Shared collectionOps implementation remains separately deferred.

Breaking change: 2.1.0 documents selection by original start. The new selection compares clipped start, then end; the conventional commit marks this for a major release. toSorted() remains a compatibility alias. Nothing is published by this PR alone.

Validation: 281 unit tests, the full property model check, coverage thresholds, lint, typecheck, CJS/ESM packed compatibility, six automation regression tests, actionlint, and a live release-label probe pass. Focuster's published-2.1.0 upgrade passes 30 freelist unit tests and 11 targeted browser tests, with a clean build warning gate. The manual GitHub CI run passed the packed-consumer check against Focuster's locked dependency tree, verified private checkout authentication, and confirmed restoration after the isolated override. The new findOne selection is marked for a major release; package publication remains a later release step.

BREAKING CHANGE: findOneByLengthStartingAt now selects by clipped start, then end, matching searchByLengthStartingAt; previously it selected by original start. ArrayIntervalCollection also returns canonical arrays and rejects nonpositive length queries.
@chatgpt-codex-connector

Copy link
Copy Markdown

You have reached your Codex usage limits for code reviews. You can see your limits in the Codex usage dashboard.
To continue using code reviews, add credits to your account and enable them for code reviews in your settings.

@hexsprite
hexsprite merged commit 8caad30 into master Oct 4, 2026
12 checks passed
@hexsprite
hexsprite deleted the fix/pending-intervaltree-beads branch October 4, 2026 16:54
@codspeed

codspeed Bot commented Oct 4, 2026 •

Copy link
Copy Markdown
Contributor

Merging this PR will degrade performance by 45.46%

⚠️ Different runtime environments detected

Some benchmarks with significant performance changes were compared across different runtime environments,
which may affect the accuracy of the results.

Open the report in CodSpeed to investigate

⚡ 1 improved benchmark
❌ 2 regressed benchmarks
✅ 36 untouched benchmarks

Warning

Please fix the performance issues or acknowledge them on CodSpeed.

Performance Changes

Benchmark BASE HEAD Efficiency
❌ searchPoint (array) 29.3 s 80.4 s -63.58%
❌ searchOverlap (array) 30.8 s 80.9 s -61.91%
⚡ equals 21.1 ms 18 ms +16.97%

Tip

Investigate this regression by commenting @codspeedbot fix this regression on this PR, or directly use the CodSpeed MCP with your agent.


Comparing fix/pending-intervaltree-beads (d86e7fd) with master (08f5cb4)

Open in CodSpeed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant