| commit | da81013a2639086b1b47f92e4fea8386217e5dd1 | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Tue Aug 20 17:58:44 2024 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Tue Aug 20 17:58:44 2024 +0000 |
| tree | 3b5d4da52002fb597d2aa31d361c4a4eb75e2882 | |
| parent | 3f833ecf525b4177e1ac520c61a05901e37dc308 [diff] | |
| parent | 89d5aa586309e3e7124349eac1da041c1bf03e03 [diff] |
Snap for 12252487 from 89d5aa586309e3e7124349eac1da041c1bf03e03 to simpleperf-release Change-Id: Ia63d2d48a3deda82ace700f174f14a8884f5970c
“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();