4 ms·
> If you always predict the in bounds path, the check is almost free. Note that you often only branch in the "bad" case, which means even on systems without br
by dathinab 4y ago
> If you always predict the in bounds path, the check is almost free.
Note that you often only branch in the "bad" case, which means even on systems without branch prediction it tends to be not very expensive, and compilers can also eliminate a lot of bounds checks.