| commit | cbb28b6759f865fd0a4dc16ace0dcb4918ae6449 | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Wed Feb 07 00:14:31 2024 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Wed Feb 07 00:14:31 2024 +0000 |
| tree | 9d9548529b260bac4bd6063fc336192fadb522d7 | |
| parent | e25d4f299a4ed2a243c92dcdf3f2321ccf28cce2 [diff] | |
| parent | 8b1968c06a29fe32fac43db9cb424a7b3948fb67 [diff] |
Snap for 11413429 from 8b1968c06a29fe32fac43db9cb424a7b3948fb67 to 24D1-release Change-Id: I9a35ad98afacb6989e4e284a72a87096eea12b7b
“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();