On 16/11/20 15:25 -0500, Patrick Palka via Libstdc++ wrote:
My ranges transcription of the std::search_n implementation for random
access iterators missed a crucial part of the algorithm which the tests
unfortunately didn't catch. When __remainder is less than __count at
the start of an iteratio
My ranges transcription of the std::search_n implementation for random
access iterators missed a crucial part of the algorithm which the tests
unfortunately didn't catch. When __remainder is less than __count at
the start of an iteration of the outer while loop, it means we're
continuing a run of
