[MIRROR] Refactors fancy type generation #1863
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Mirrored on Nova: NovaSector/NovaSector#844
Original PR: tgstation/tgstation#81259
About The Pull Request
Refactors fancy type generation
Ok so we have this proc that generates concatenated names for types so admins have a nice list to sort through.
The trouble is this is done by, for each type, iterating all possible replacements, and seeing which ones apply (with expensive string operations)
A clean run of this applied to all datums takes about 3.5 seconds on my pc.
This sucks.
Ok so can we do better. Well, yes, pretty easily.
Rather then, for each potential type, iterating all the options, let's build a zebra typecache (a lookup list of type -> string to use), and use that.
Then we can use a list of replacement -> the bit to tear out to figure out what to remove.
This works quite well. It does mean that we're doing it based off the type tree and not type paths, so if we didn't have a replacement for like, mob, it'd look weird, but we don't have cases like that so it's fine.
Or well we sorta did, didn't have anything for atom movables or areas, but I fixed that so sall good.
Anyway, we only need to do this work once. It takes about 0.3 seconds on my machine, so we can cache it.
Just this on its own would technically slow init, since we have a some code that's running this proc off static, but we can just not, that's fine (technically saves init time too since we don't have to burn 0.1 seconds on it anymore).
This brings the cost of generating this list for all datums from 3 seconds to 0.16, assuming we have the static pre generated.
We could in theory pre-generate just like, all the strings?
But I don't think the cached cost is high enough for that to be a real problem. IDK open to other thoughts
Oh also I had to reorder the strings in that list, cause zebra_typecacheof has reverse priority. s life
Updates stat tracking macro to work at world start
It for some reason doesn't actually get anything this early, but now at least the logging would in theory function
Why It's Good For The Game
Better response times for admins, faster code, more better