Preconditions on the ranges, which an algorithm turns into a shorter loop.
A precondition is trusted, never checked: a false one is undefined behaviour, and the page of each says what it requires.
Contents | |
| dense_output | |
| Optimises a filtering algorithm for most elements kept per step. | |
| divisible_by_cardinal | |
| States that a range holds a whole number of SIMD registers. | |
| expect_smaller_range | |
| Names the range an algorithm should expect to be the shorter one. | |
| overflow | |
| Number of lanes a loop may write past its range. | |
| sparse_output | |
| Optimises a filtering algorithm for few elements kept per step. | |
