Faster Resizing of IdTables #424
Merged
Conversation
This file contains 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
…a std::vector (or similar data structure) which can cheaply create new Elements (like ints) without initializing (zeroing) them. This makes e.g. resizing the Vector to a bigger size much cheaper.
joka921
force-pushed
the
f.fasterResizeOfIdTable
branch
from
73fe20a
to
5a39212
Compare
hannahbast
approved these changes
Jul 18, 2021
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.
Integrated an "uninitializedAllocator" which safely allows to create a std::vector (or similar data structure)
which can cheaply create new Elements (like ints) without initializing (zeroing) them.
This makes e.g. resizing the Vector to a bigger size much cheaper.
The most important application is the resize-operation of IdTables, which is now O(oldSize) instead of O(newSize) in case
newSize > oldSize.