Better performance for large Tilesets#125
Merged
fallahn merged 3 commits intofallahn:masterfrom Jun 3, 2023
Merged
Conversation
Owner
|
Thanks for the contribution! I'll review this as soon as I get a moment. |
|
Have you any idea how much faster it is, or is there any trade-off for small tilesets? |
Contributor
Author
|
Old version New version The load functions are loading tilemaps with that amount of tiles. And the tileset files are of the format: Terrain is the preview map of lpc terrains |
Owner
|
Wow! That's a considerable speed up - nice work! 😁 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
This creates an index of tiles by their ID, removing the need for a sort in the vector of tiles. It also makes getTile() and createMissingTile() constant operations.