P-Y on Nostr: I think I'm ok paying that cost because looking up a class by name is rare in the ...
I think I'm ok paying that cost because looking up a class by name is rare in the first place, usually just an entry point.
Most of the time we're traversing a heap graph through references, so everything is optimized for that + low memory footprint.
"Low memory footprint" here means key design choices in critical places:
- Sorted arrays with binary search over hash maps and hash set (load factor=>25% wasted space)
- Byte arrays over objects
Most of the time we're traversing a heap graph through references, so everything is optimized for that + low memory footprint.
"Low memory footprint" here means key design choices in critical places:
- Sorted arrays with binary search over hash maps and hash set (load factor=>25% wasted space)
- Byte arrays over objects