chromium/net/third_party/quiche/src/quiche/common/quiche_linked_hash_map_test.cc

// Copyright (c) 2019 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.

// Tests QuicheLinkedHashMap.

#include "quiche/common/quiche_linked_hash_map.h"

#include <memory>
#include <tuple>
#include <utility>

#include "quiche/common/platform/api/quiche_test.h"

Pair;
Pointee;
UnorderedElementsAre;

namespace quiche {
namespace test {

// Tests that move constructor works.
TEST(LinkedHashMapTest, Move) { … }

TEST(LinkedHashMapTest, CanEmplaceMoveOnly) { … }

struct NoCopy { … };

TEST(LinkedHashMapTest, CanEmplaceNoMoveNoCopy) { … }

TEST(LinkedHashMapTest, ConstKeys) { … }

// Tests that iteration from begin() to end() works
TEST(LinkedHashMapTest, Iteration) { … }

// Tests that reverse iteration from rbegin() to rend() works
TEST(LinkedHashMapTest, ReverseIteration) { … }

// Tests that clear() works
TEST(LinkedHashMapTest, Clear) { … }

// Tests that size() works.
TEST(LinkedHashMapTest, Size) { … }

// Tests empty()
TEST(LinkedHashMapTest, Empty) { … }

TEST(LinkedHashMapTest, Erase) { … }

TEST(LinkedHashMapTest, Erase2) { … }

// Test that erase(iter,iter) and erase(iter) compile and work.
TEST(LinkedHashMapTest, Erase3) { … }

TEST(LinkedHashMapTest, Insertion) { … }

static std::pair<int, int> Pair(int i, int j) { … }

// Test front accessors.
TEST(LinkedHashMapTest, Front) { … }

TEST(LinkedHashMapTest, Find) { … }

TEST(LinkedHashMapTest, Contains) { … }

TEST(LinkedHashMapTest, Swap) { … }

TEST(LinkedHashMapTest, CustomHashAndEquality) { … }

}  // namespace test
}  // namespace quiche