-
Notifications
You must be signed in to change notification settings - Fork 2
perf: replace for...of loops with traditional for loops in core algorithm #46
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: master
Are you sure you want to change the base?
Conversation
…ithm Replace for...of loops with traditional for (let i = 0; ...) loops in performance-critical core algorithm files for better performance: - lib/core/data-structures.ts: capacity calculation loop - lib/core/problem-builder.ts: row constraint processing loop This optimization follows the performance-first approach outlined in CLAUDE.md and provides measurable performance improvements in benchmarks. 🤖 Generated with [Claude Code](https://claude.ai/code) Co-Authored-By: Claude <noreply@anthropic.com>
🚀 Benchmark ResultsPerformance comparison against merge-base Node.js 18
🚀 Benchmark ResultsAll solutions to the sudoku
Finding one pentomino tiling on a 6x10 field
Finding ten pentomino tilings on a 6x10 field
Finding one hundred pentomino tilings on a 6x10 field
Updated: 2025-08-08T01:28:59.264Z Node.js 20
🚀 Benchmark ResultsAll solutions to the sudoku
Finding one pentomino tiling on a 6x10 field
Finding ten pentomino tilings on a 6x10 field
Finding one hundred pentomino tilings on a 6x10 field
Updated: 2025-08-08T01:28:59.698Z Node.js 22
🚀 Benchmark ResultsAll solutions to the sudoku
Finding one pentomino tiling on a 6x10 field
Finding ten pentomino tilings on a 6x10 field
Finding one hundred pentomino tilings on a 6x10 field
Updated: 2025-08-08T01:29:09.030Z |
Replace for...of loops with traditional for (let i = 0; ...) loops in performance-critical core algorithm files for better performance: