| commit | f19ca66ae638f9cd5abd4e7e7aca640e6b96d6e5 | [log] [tgz] |
|---|---|---|
| author | Joel Galenson <jgalenson@google.com> | Tue Jul 28 13:45:20 2020 -0700 |
| committer | Joel Galenson <jgalenson@google.com> | Tue Jul 28 13:45:20 2020 -0700 |
| tree | 8223f93f4c104458c4f90e4da7b560a5feeef97a | |
| parent | d32c0a5db6ed5b2f9d03fa555a05524d9e973191 [diff] |
Add Android.bp Change-Id: Iec322d368f4cb878a7ec416f63391477f681d2a2
“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();