सभी किताबें

पेशेवर

ऐप्स परिचय Coach लॉग इन पढ़ना शुरू करें

Quantitative Finance · शब्दावली

Bounds-check elimination क्या है?

Definition 9.2 Low-Latency Software · अध्याय 9 — Rust for Low Latency

Bounds-check elimination is the compiler’s removal of an index check it can prove always passes: a loop counter bounded by the slice’s own length, an index already compared, an iterator that yields only valid positions.

The C++ and Rust twins: decoding Book 1’s sample with each language’s feed decoder (left), and summing 65 536 integers in order, and through a table of scattered indices with and without bounds checks (right). Measured on a laptop (Intel Core Ultra 7 155H) under WSL2, no isolated cores, pinned to one CPU. Data: bench_rust.py.
Figure 9.1. The C++ and Rust twins: decoding Book 1’s sample with each language’s feed decoder (left), and summing 65 536 integers in order, and through a table of scattered indices with and without bounds checks (right). Measured on a laptop (Intel Core Ultra 7 155H) under WSL2, no isolated cores, pinned to one CPU. Data: bench_rust.py.
अध्याय में पढ़ें →