Roberto Ierusalimschy b4b616bdf2 Rehash reinserts elements with "lighter" functions ...

When reinserting elements into a table during a rehash, the code does
not need to invoke all the complexity of a full 'luaH_set':

- The table has space for all keys.
- The key cannot exist in the new hash.
- The keys are valid (not NaN nor nil).
- The keys are normalized (1.0 -> 1).
- The values cannot be nil.
- No barrier needed (the table already pointed to the key and value).

2024-12-05 17:34:08 -03:00

39 KiB

Raw Blame History

View Raw