Test coverage for search_n with impossible value by AlexGuteniev · Pull Request #5440 · microsoft/STL (original) (raw)

Thanks for adding some impossible coverage to vector algorithms, @StephanTLavavej! (#5355)

But you seem to miss the one you've then-recently reviewed 😹 (#5352)

I had to damage the sequence in the test array a bit, because for search_n coverage to properly cover the right branch, we need to search for more than one consecutive element, otherwise we get special n=1 case.