| commit | 28ee3e669df78bf94e18d0a22456d6f49dae8669 | [log] [tgz] |
|---|---|---|
| author | Mike Yu <yumike@google.com> | Tue Apr 18 19:47:53 2023 +0000 |
| committer | Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com> | Tue Apr 18 19:47:53 2023 +0000 |
| tree | 40c1ec7f8824c6f65686d9ffb768102f82961542 | |
| parent | 6a99587c552c521c589581aea3492460e7c5038a [diff] | |
| parent | 3b9e18dccee1efb06c6b222757ab4a712eb5ee81 [diff] |
Make libsmallvec available to resolv module am: 8ae8fd4570 am: fda98b38d8 am: 3b9e18dcce Original change: https://android-review.googlesource.com/c/platform/external/rust/crates/smallvec/+/2535584 Change-Id: I8c3dc968c8dbbd7531d25ad60eb7cfb22389eebd Signed-off-by: Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com>
“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();