| commit | e452407c06e538ab74d8472db10ed34ca99a66a1 | [log] [tgz] |
|---|---|---|
| author | Xin Li <delphij@google.com> | Fri Oct 09 03:23:01 2020 +0000 |
| committer | Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com> | Fri Oct 09 03:23:01 2020 +0000 |
| tree | 016def8e169faec1a21e319a82de77ec852c2ccd | |
| parent | f575d2366e23947838ce8d44df33dcd0c624c9ad [diff] | |
| parent | 00867e8870e57c3fc8f93a16a1119f36f62ad297 [diff] |
[automerger skipped] Skip ab/6749736 in stage. am: 00867e8870 -s ours am skip reason: Change-Id I6f40c13954fc23f9e9d3b81198f0cdbd19dddfc4 with SHA-1 9e821675c0 is in history Original change: https://googleplex-android-review.googlesource.com/c/platform/external/rust/crates/smallvec/+/12797252 Change-Id: I1af8a34669e8e3928a67e66c99b016a38d5ace12
"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();