You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The current dictionary-based approach has poor performance because the dictionaries are frequently allocated and released, meaning that strings (keys) are frequently allocated and released as well. Considering that the dictionary is completely known a priori we might as well emit matching structs or use some purs_any_t ** and access them by some known pointer offset by key.
The text was updated successfully, but these errors were encountered:
This comment still holds true in part, however, top-level thunks are now cached and only evaluated once during the program's runtime. Another idea I had to perhaps squeeze out a bit more performance improvements without relying on upstream support for this feature is to pre-hash the keys into the dictionary for generated code.
The current dictionary-based approach has poor performance because the dictionaries are frequently allocated and released, meaning that strings (keys) are frequently allocated and released as well. Considering that the dictionary is completely known a priori we might as well emit matching structs or use some
purs_any_t **
and access them by some known pointer offset by key.The text was updated successfully, but these errors were encountered: