chromium/components/sync_sessions/tab_node_pool_unittest.cc

// Copyright 2014 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "components/sync_sessions/tab_node_pool.h"

#include <vector>

#include "testing/gmock/include/gmock/gmock.h"
#include "testing/gtest/include/gtest/gtest.h"

namespace sync_sessions {
namespace {

ElementsAre;
UnorderedElementsAre;

const int kTabNodeId1 = …;
const int kTabNodeId2 = …;
const SessionID kTabId1 = …;
const SessionID kTabId2 = …;
const SessionID kTabId3 = …;
const SessionID kTabId4 = …;
const SessionID kTabId5 = …;
const SessionID kTabId6 = …;

class SyncTabNodePoolTest : public testing::Test { … };

TEST_F(SyncTabNodePoolTest, MaxTabNodeIdShouldIncrease) { … }

TEST_F(SyncTabNodePoolTest, MaxTabNodeIdShouldDecrease) { … }

TEST_F(SyncTabNodePoolTest, MaxTabNodeIdShouldNotChange) { … }

TEST_F(SyncTabNodePoolTest, Reassociation) { … }

TEST_F(SyncTabNodePoolTest, ReassociateThenFree) { … }

TEST_F(SyncTabNodePoolTest, AssociateWithFreeTabNode) { … }

TEST_F(SyncTabNodePoolTest, AssociateWithFreeTabNodesContiguous) { … }

// Tests that, when *both* a free tab node and a "hole" exists,
// AssociateWithFreeTabNode() returns the smallest of them.
TEST_F(SyncTabNodePoolTest, AssociateWithFreeTabNodeReturnsMinimum) { … }

TEST_F(SyncTabNodePoolTest, AggressiveCleanupFreeTabNodesMiddle) { … }

TEST_F(SyncTabNodePoolTest, AggressiveCleanupFreeTabNodesMax) { … }

TEST_F(SyncTabNodePoolTest, AggressiveCleanupFreeTabNodesMultiple) { … }

TEST_F(SyncTabNodePoolTest, AggressiveCleanupFreeTabNodesAll) { … }

}  // namespace

}  // namespace sync_sessions