diff options
| author | Vincent Ambo <mail@tazj.in> | 2020-08-06T02·01+0100 |
|---|---|---|
| committer | tazjin <mail@tazj.in> | 2020-08-06T02·20+0000 |
| commit | 91bd7ce73ab7eacaf995090014f67391624531c1 (patch) | |
| tree | 92b860538a77417e67bc84f085610e9b6f361f06 /third_party/nix/src/libstore/binary-cache-store.hh | |
| parent | a41c3dedb18201aa689206079e203f41c9bef389 (diff) | |
refactor(tvix): Use absl::btree_map for DerivationOutputs r/1610
This container implementation is much faster than std::map. We have stuck to an ordered container because it's unclear whether the accesses of this field (of which there are *many*) are actually ordering dependent. Also includes an Arbitrary implementation for absl::btree_map (for any K, V that are also Arbitrary). Change-Id: I04f58ca0ce32b9ae1759313b01508b0e44bae793 Reviewed-on: https://cl.tvl.fyi/c/depot/+/1683 Reviewed-by: glittershark <grfn@gws.fyi> Tested-by: BuildkiteCI
Diffstat (limited to 'third_party/nix/src/libstore/binary-cache-store.hh')
0 files changed, 0 insertions, 0 deletions