EHN: Implement cartesian_nearest_index
#660
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.
Maybe used in #640. (Implement
_find_closest_state_index
part in #640 (comment).)Given a point
x
, find the index of the point nearest tox
among those in the Cartesian product generatednodes
.If
nodes
hasn
arrays of grid points (so the product isn
dimensional) and there arem
grid points in each dimension, this function does binary search for each dimension, so that the complexity isO(n log(m))
, while if one actually constructs the Cartesian product and does linear search, then the complexity isO(m^n)
.