| Index: net/quic/platform/impl/quic_containers_impl.h
|
| diff --git a/net/quic/platform/impl/quic_containers_impl.h b/net/quic/platform/impl/quic_containers_impl.h
|
| index 287b73b3216db7588dfbe84098cc539f5ccb5c93..360ae4c28bcf378bb4e0a1a770d4b6c0ad28292e 100644
|
| --- a/net/quic/platform/impl/quic_containers_impl.h
|
| +++ b/net/quic/platform/impl/quic_containers_impl.h
|
| @@ -21,7 +21,7 @@ using QuicLinkedHashMapImpl = linked_hash_map<Key, Value>;
|
| // unique key-value-pair elements, and upgrades itself to unordered_map when
|
| // runs out of space.
|
| template <typename Key, typename Value, int Size>
|
| -using QuicSmallMapImpl = base::SmallMap<std::unordered_map<Key, Value>, Size>;
|
| +using QuicSmallMapImpl = base::small_map<std::unordered_map<Key, Value>, Size>;
|
|
|
| // A data structure used to represent a sorted set of non-empty, non-adjacent,
|
| // and mutually disjoint intervals.
|
|
|