| commit | 5c83c5df3a6bc3d2ecd8c229313937e68a4a56fd | [log] [tgz] |
|---|---|---|
| author | Xin Li <[email protected]> | Sat Feb 20 14:12:16 2021 +0000 |
| committer | Automerger Merge Worker <[email protected]> | Sat Feb 20 14:12:16 2021 +0000 |
| tree | 301fc457c178d7a6e8031eb136d7bf951a404406 | |
| parent | 004bfcc27519d99d50e446fd68158141d37ffe10 [diff] | |
| parent | ae2bd84a0a9a7f6ed1ac8a6f12618c2758195a4d [diff] |
[automerger skipped] Mark ab/7061308 as merged in stage. am: 2188055b68 -s ours am: 6706c243b2 -s ours am: ae2bd84a0a -s ours am skip reason: Change-Id Ib1995bab25327524c008ae00be310a764aa19f18 with SHA-1 c62d25ec3e is in history Original change: undetermined MUST ONLY BE SUBMITTED BY AUTOMERGER Change-Id: I986a397bc6c57ce62c025ade743e3c9db61975ab
“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();