Remove unused containers from quic_containers.
PiperOrigin-RevId: 371331493
Change-Id: Ie376d2f40a72c9126274f968bb32c58ef1f4840d
diff --git a/quic/platform/api/quic_containers.h b/quic/platform/api/quic_containers.h
index 4eb603f..759ff8a 100644
--- a/quic/platform/api/quic_containers.h
+++ b/quic/platform/api/quic_containers.h
@@ -13,33 +13,10 @@
template <typename Key>
using QuicDefaultHasher = QuicDefaultHasherImpl<Key>;
-// A general-purpose unordered map.
-template <typename Key, typename Value, typename Hash = QuicDefaultHasher<Key>>
-using QuicUnorderedMap = QuicUnorderedMapImpl<Key, Value, Hash>;
-
-// A general-purpose unordered map that does not gurantee pointer stability.
-template <typename Key, typename Value, typename Hash = QuicDefaultHasher<Key>>
-using QuicHashMap = QuicHashMapImpl<Key, Value, Hash>;
-
-// A general-purpose unordered set.
-template <typename Key, typename Hash = QuicDefaultHasher<Key>>
-using QuicUnorderedSet = QuicUnorderedSetImpl<Key, Hash>;
-
-// A general-purpose unordered set that does not gurantee pointer stability.
-template <typename Key, typename Hash = QuicDefaultHasher<Key>>
-using QuicHashSet = QuicHashSetImpl<Key, Hash>;
-
// A map which offers insertion-ordered iteration.
template <typename Key, typename Value, typename Hash = QuicDefaultHasher<Key>>
using QuicLinkedHashMap = QuicLinkedHashMapImpl<Key, Value, Hash>;
-// Represents a simple queue which may be backed by a list or
-// a flat circular buffer.
-//
-// DOES NOT GUARANTEE POINTER OR ITERATOR STABILITY!
-template <typename T>
-using QuicQueue = QuicQueueImpl<T>;
-
// A vector optimized for small sizes. Provides the same APIs as a std::vector.
template <typename T, size_t N, typename A = std::allocator<T>>
using QuicInlinedVector = QuicInlinedVectorImpl<T, N, A>;
