| commit | 3f3f9157c213b84ebfd2427c95a1ff8b10c86dfa | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Thu Feb 17 02:46:48 2022 +0000 |
| committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Thu Feb 17 02:46:48 2022 +0000 |
| tree | a3a1376bc898f7520a54af076af0a6c41706cc29 | |
| parent | 7cada8b69c5499b9bb9cf660fadaf13e40747fb8 [diff] | |
| parent | bcbb2293e68b7ea9e451b4af2b3c5474708b6f59 [diff] |
Snap for 8192738 from bcbb2293e68b7ea9e451b4af2b3c5474708b6f59 to tm-frc-documentsui-release Change-Id: I30cf07e2104b7fb725ecda920ed31a2a46ed756d
“Small vector” optimization for Rust: store up to a small number of items on the stack
use smallvec::{SmallVec, smallvec}; // This SmallVec can hold up to 4 items on the stack: let mut v: SmallVec<[i32; 4]> = smallvec![1, 2, 3, 4]; // It will automatically move its contents to the heap if // contains more than four items: v.push(5); // SmallVec points to a slice, so you can use normal slice // indexing and other methods to access its contents: v[0] = v[1] + v[2]; v.sort();