diff options
| author | Peng Liu <winner245@hotmail.com> | 2025-02-26 11:38:15 -0500 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2025-02-26 11:38:15 -0500 |
| commit | 1d583ed2fb76c3d944ffab012c21b8fc0a93cac1 (patch) | |
| tree | c784a5ba70a1ae6990b3e19c233ecce7ec683a3a /libcxx/include/__algorithm/minmax.h | |
| parent | 1ec1d25f691b92fb6aec8d0564139a5ba6c721b7 (diff) | |
| download | llvm-1d583ed2fb76c3d944ffab012c21b8fc0a93cac1.zip llvm-1d583ed2fb76c3d944ffab012c21b8fc0a93cac1.tar.gz llvm-1d583ed2fb76c3d944ffab012c21b8fc0a93cac1.tar.bz2 | |
[libc++][test] Augment ranges::{fill, fill_n, find} with missing tests (#121209)
libc++ currently has very limited test coverage for `std::ranges{fill, fill_n, find}`
with `vector<bool>::iterator` optimizations. Specifically, the existing tests for
`std::ranges::fill` only covers cases of 1 - 2 bytes, which is merely 1/8 to 1/4
of the `__storage_type` word size. This renders the tests insufficient to validate
functionality for whole words, with or without partial words (which necessitates at
least 8 bytes of data). Moreover, no tests were provided for `ranges::{find, fill_n}`
with `vector<bool>::iterator` optimizations. This PR fills in the gap.
Diffstat (limited to 'libcxx/include/__algorithm/minmax.h')
0 files changed, 0 insertions, 0 deletions