Happy thanksgiving to all the Gooners in Trumpland <| sep |> for i in 12 . buffer . len let prediction coefficients . iter . zipbufferi 12 . i . mapc , s c s as i 64 . sumi 64 qlpshift let delta buffer buffer prediction as i 32 delta This is a snippetL 534 from my FLAC decoder . I like it because it demonstrates the cost of abstraction in Rust very well . It contains nontrivial things such as iterators and closures being constructed , potentially out of bounds array indexing , and it uses highlevel concepts such as map and sum . Yet , when you look at the generated instructions , it is a very tight loop with some moves , 12 multiplications and adds , and a shift . Not a single instruction is redundant . I couldn ' t have written it better by hand .