Fixing heap-buffer-overflow error uncovered by ASan in the [Sort] test. #418
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.
A bug in the shell_sort algorithm causes a random access iterator to be decremented past begin. Depending on which data structure the iterator points to, decrementing it can trigger memory accesses that are only valid when the iterator is within the correct range. An example of such a data structure is EASTL's deque. This change fixes the algorithm to only decrement the random access iterator when it is valid to do so.