⚡ Bolt: Optimize compareTo with zero-allocation parser #809
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
⚡ Bolt Optimization:
compareToZero-Allocation Parser💡 What: Refactored
compareToto use a manual character-by-character parser instead ofsplit,replace, andRegExp.🎯 Why: Version comparison is a hot path. The previous implementation allocated multiple strings and arrays for every comparison, creating garbage collection pressure.
📊 Impact:
🔬 Measurement:
bench.ts(1M iterations over 7 version strings).bun run test).PR created automatically by Jules for task 11172138652610001456 started by @srod
Summary by cubic
Rewrote compareTo to a zero-allocation, single-pass parser to remove regex/split overhead and cut GC pressure. Delivers ~13x speedup in benchmarks (3723ms -> 285ms for 1M calls) with the same comparison behavior.
Written for commit 9c0b23d. Summary will update on new commits.