File size: 4,827 Bytes
985c397 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 | /// The MIT License (MIT)
/// Copyright (c) 2016 Peter Goldsborough
///
/// Permission is hereby granted, free of charge, to any person obtaining a copy
/// of this software and associated documentation files (the "Software"), to
/// deal in the Software without restriction, including without limitation the
/// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
/// sell copies of the Software, and to permit persons to whom the Software is
/// furnished to do so, subject to the following conditions:
///
/// The above copyright notice and this permission notice shall be included in
/// all copies or substantial portions of the Software.
///
/// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
/// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
/// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
/// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
/// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
/// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
/// IN THE SOFTWARE.
#include <string>
#include <utility>
#include <vector>
#include "gtest/gtest.h"
#include "lru/lru.hpp"
#include "tests/move-aware-dummies.hpp"
struct MoveAwarenessTest : public ::testing::Test {
MoveAwarenessTest() {
MoveAwareKey::reset();
MoveAwareValue::reset();
}
LRU::Cache<MoveAwareKey, MoveAwareValue> cache;
};
TEST_F(MoveAwarenessTest, DoesNotMoveForInsert) {
cache.insert("x", "y");
// One construction (right there)
ASSERT_EQ(MoveAwareKey::forwarding_count, 1);
ASSERT_EQ(MoveAwareValue::forwarding_count, 1);
ASSERT_EQ(MoveAwareKey::copy_count, 1);
// Values only go into the map
ASSERT_EQ(MoveAwareValue::copy_count, 1);
// Do this at the end to avoid incrementing the counts
ASSERT_EQ(cache["x"], "y");
}
TEST_F(MoveAwarenessTest, ForwardsValuesWell) {
cache.emplace("x", "y");
// One construction to make the key first
EXPECT_GE(MoveAwareKey::forwarding_count, 1);
EXPECT_GE(MoveAwareValue::forwarding_count, 1);
EXPECT_EQ(MoveAwareKey::copy_count, 0);
EXPECT_EQ(MoveAwareValue::copy_count, 0);
ASSERT_EQ(cache["x"], "y");
}
TEST_F(MoveAwarenessTest, MovesSingleRValues) {
cache.emplace(std::string("x"), std::string("y"));
// Move constructions from the string
EXPECT_EQ(MoveAwareKey::move_count, 1);
EXPECT_EQ(MoveAwareValue::move_count, 1);
EXPECT_EQ(MoveAwareKey::non_move_count, 0);
EXPECT_EQ(MoveAwareValue::non_move_count, 0);
EXPECT_EQ(MoveAwareKey::copy_count, 0);
EXPECT_EQ(MoveAwareValue::copy_count, 0);
ASSERT_EQ(cache["x"], "y");
}
TEST_F(MoveAwarenessTest, CopiesSingleLValues) {
std::string x("x");
std::string y("y");
cache.emplace(x, y);
// Move constructions from the string
EXPECT_EQ(MoveAwareKey::non_move_count, 1);
EXPECT_EQ(MoveAwareValue::non_move_count, 1);
EXPECT_EQ(MoveAwareKey::move_count, 0);
EXPECT_EQ(MoveAwareValue::move_count, 0);
EXPECT_EQ(MoveAwareKey::copy_count, 0);
EXPECT_EQ(MoveAwareValue::copy_count, 0);
ASSERT_EQ(cache["x"], "y");
}
TEST_F(MoveAwarenessTest, MovesRValueTuples) {
cache.emplace(std::piecewise_construct,
std::forward_as_tuple(1, 3.14),
std::forward_as_tuple(2, 2.718));
// construct_from_tuple performs one move construction
// (i.e. construction from rvalues)
EXPECT_EQ(MoveAwareKey::move_count, 1);
EXPECT_EQ(MoveAwareValue::move_count, 1);
EXPECT_EQ(MoveAwareKey::non_move_count, 0);
EXPECT_EQ(MoveAwareValue::non_move_count, 0);
EXPECT_EQ(MoveAwareKey::copy_count, 0);
EXPECT_EQ(MoveAwareValue::copy_count, 0);
}
TEST_F(MoveAwarenessTest, MovesLValueTuples) {
int x = 1, z = 2;
double y = 3.14, w = 2.718;
cache.emplace(std::piecewise_construct,
std::forward_as_tuple(x, y),
std::forward_as_tuple(z, w));
// construct_from_tuple will perfom one copy construction
// (i.e. construction from lvalues)
EXPECT_EQ(MoveAwareKey::non_move_count, 1);
EXPECT_EQ(MoveAwareValue::non_move_count, 1);
EXPECT_EQ(MoveAwareKey::move_count, 0);
EXPECT_EQ(MoveAwareValue::move_count, 0);
EXPECT_EQ(MoveAwareKey::copy_count, 0);
EXPECT_EQ(MoveAwareValue::copy_count, 0);
}
TEST_F(MoveAwarenessTest, MovesElementsOutOfRValueRanges) {
std::vector<std::pair<std::string, std::string>> range = {{"x", "y"}};
cache.insert(std::move(range));
// Move constructions from the string
EXPECT_EQ(MoveAwareKey::move_count, 1);
EXPECT_EQ(MoveAwareValue::move_count, 1);
EXPECT_EQ(MoveAwareKey::non_move_count, 0);
EXPECT_EQ(MoveAwareValue::non_move_count, 0);
EXPECT_EQ(MoveAwareKey::copy_count, 0);
EXPECT_EQ(MoveAwareValue::copy_count, 0);
ASSERT_EQ(cache["x"], "y");
}
|