Andreas Kling 81bee185e6 LibJS: Replace source map HashMap with sorted Vector ...

Bytecode source map entries are always added in order of increasing
bytecode offset, and lookups only happen during error handling (a cold
path). This makes a sorted vector with binary search a better fit than
a hash map.

This change reduces memory overhead and speeds up bytecode generation
by avoiding hash table operations during compilation. Lookups remain
fast via binary search, and since source_range_at() is only called
when generating stack traces, the O(log n) lookup is acceptable.

2026-01-26 19:37:42 +01:00

4.7 KiB

Raw Blame History

View Raw