mirror of
https://github.com/klzgrad/naiveproxy.git
synced 2024-11-24 14:26:09 +03:00
69 lines
2.5 KiB
C
69 lines
2.5 KiB
C
|
// Copyright (c) 2017 The Chromium Authors. All rights reserved.
|
||
|
|
// Use of this source code is governed by a BSD-style license that can be
|
||
|
|
// found in the LICENSE file.
|
||
|
|
|
||
|
|
#ifndef NET_QUIC_PLATFORM_IMPL_QUIC_CONTAINERS_IMPL_H_
|
||
|
|
#define NET_QUIC_PLATFORM_IMPL_QUIC_CONTAINERS_IMPL_H_
|
||
|
|
|
||
|
|
#include <unordered_map>
|
||
|
|
#include <unordered_set>
|
||
|
|
|
||
|
|
#include "base/containers/circular_deque.h"
|
||
|
|
#include "base/containers/queue.h"
|
||
|
|
#include "base/containers/small_map.h"
|
||
|
|
#include "net/base/interval_set.h"
|
||
|
|
#include "net/base/linked_hash_map.h"
|
||
|
|
|
||
|
|
namespace net {
|
||
|
|
|
||
|
|
// TODO(mpw): s/std::unordered_map/gtl::node_hash_map/ once node_hash_map is
|
||
|
|
// PG3-compatible.
|
||
|
|
template <typename Key,
|
||
|
|
typename Value,
|
||
|
|
typename Hash = typename std::unordered_map<Key, Value>::hasher,
|
||
|
|
typename Eq = typename std::unordered_map<Key, Value>::key_equal,
|
||
|
|
typename Alloc =
|
||
|
|
typename std::unordered_map<Key, Value>::allocator_type>
|
||
|
|
using QuicUnorderedMapImpl = std::unordered_map<Key, Value, Hash, Eq, Alloc>;
|
||
|
|
|
||
|
|
// TODO(mpw): s/std::unordered_set/gtl::node_hash_set/ once node_hash_set is
|
||
|
|
// PG3-compatible.
|
||
|
|
template <typename Key,
|
||
|
|
typename Hash = typename std::unordered_set<Key>::hasher,
|
||
|
|
typename Eq = typename std::unordered_set<Key>::key_equal,
|
||
|
|
typename Alloc = typename std::unordered_set<Key>::allocator_type>
|
||
|
|
using QuicUnorderedSetImpl = std::unordered_set<Key, Hash, Eq, Alloc>;
|
||
|
|
|
||
|
|
// A map which offers insertion-ordered iteration.
|
||
|
|
template <typename Key, typename Value>
|
||
|
|
using QuicLinkedHashMapImpl = linked_hash_map<Key, Value>;
|
||
|
|
|
||
|
|
// A map which is faster than (for example) hash_map for a certain number of
|
||
|
|
// 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::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.
|
||
|
|
template <typename T>
|
||
|
|
using QuicIntervalSetImpl = IntervalSet<T>;
|
||
|
|
|
||
|
|
// Represents a simple queue which may be backed by a list or
|
||
|
|
// a flat circular buffer.
|
||
|
|
//
|
||
|
|
// DOES NOT GUARANTEE POINTER STABILITY!
|
||
|
|
template <typename T>
|
||
|
|
using QuicQueueImpl = base::queue<T>;
|
||
|
|
|
||
|
|
// Represents a double-ended queue which may be backed by a list or
|
||
|
|
// a flat circular buffer.
|
||
|
|
//
|
||
|
|
// DOES NOT GUARANTEE POINTER OR ITERATOR STABILITY!
|
||
|
|
template <typename T>
|
||
|
|
using QuicDequeImpl = base::circular_deque<T>;
|
||
|
|
|
||
|
|
} // namespace net
|
||
|
|
|
||
|
|
#endif // NET_QUIC_PLATFORM_IMPL_QUIC_CONTAINERS_IMPL_H_
|