arcflag router fix for small networks #16078
Open
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
- if the network is too small to build a k-d tree with the given number of levels, now a k-d tree with as much levels as possible is built - the actual number of levels can be queried afterward via KDTreePartition::getNumberOfLevels() additionally: - the parameter vehicle for KDTreePartition::init() is now made optional - a memory leak has been fixed Signed-off-by: Ruediger Ebendt <ruediger.ebendt@dlr.de>
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.
With this fix, a k-d tree with as much levels as possible is built in case the network is too small to build a k-d tree with the given number of levels.
The actual number of levels can be queried afterward via KDTreePartition::getNumberOfLevels().