File size: 2,570 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
/// 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 <chrono>

#include "gtest/gtest.h"

#include "lru/lru.hpp"

TEST(WrapTest, CanWrapMutableAndNonMutableLambdas) {
  // This is purely to make sure both variants compile
  LRU::wrap([](int x) { return x; })(5);
  LRU::wrap([](int x) mutable { return x; })(5);
}

TEST(WrapTest, WrappingWorks) {
  auto f = [x = 0](int _) mutable {
    return ++x;
  };
  auto wrapped = LRU::wrap(f);

  EXPECT_EQ(wrapped(69), 1);
  EXPECT_EQ(wrapped(69), 1);
  EXPECT_EQ(wrapped(42), 2);
  EXPECT_EQ(wrapped(42), 2);
  EXPECT_EQ(wrapped(50), 3);
}

TEST(WrapTest, CanPassCapacityArgumentToWrap) {
  std::size_t call_count = 0;
  auto f = [&call_count](int _) { return call_count += 1; };

  auto wrapped1 = LRU::wrap(f, 1);

  wrapped1(1);
  EXPECT_EQ(call_count, 1);

  wrapped1(1);
  EXPECT_EQ(call_count, 1);

  auto wrapped2 = LRU::wrap(f, 0);

  wrapped1(1);
  EXPECT_EQ(call_count, 1);

  wrapped1(1);
  EXPECT_EQ(call_count, 1);
}


TEST(WrapTest, CanPassTimeArgumentToTimedCacheWrap) {
  using namespace std::chrono_literals;

  std::size_t call_count = 0;
  auto f = [&call_count](int _) { return call_count += 1; };

  auto wrapped1 = LRU::wrap<decltype(f), LRU::TimedCache>(f, 100ms);

  wrapped1(1);
  EXPECT_EQ(call_count, 1);

  wrapped1(1);
  EXPECT_EQ(call_count, 1);

  auto wrapped2 = LRU::timed_wrap(f, 0ms);

  wrapped1(1);
  EXPECT_EQ(call_count, 1);

  wrapped1(1);
  EXPECT_EQ(call_count, 1);
}