blob: 1cbffb8fa412ff526502b5ef05c4a0e666e3e794 [file] [log] [blame]
Jiewen Tan99135962014-09-20 02:18:53 -07001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2/**
Spyridon Mastorakis429634f2015-02-19 17:35:33 -08003 * Copyright (c) 2013-2015 Regents of the University of California.
Jiewen Tan99135962014-09-20 02:18:53 -07004 *
5 * This file is part of ndn-cxx library (NDN C++ library with eXperimental eXtensions).
6 *
7 * ndn-cxx library is free software: you can redistribute it and/or modify it under the
8 * terms of the GNU Lesser General Public License as published by the Free Software
9 * Foundation, either version 3 of the License, or (at your option) any later version.
10 *
11 * ndn-cxx library is distributed in the hope that it will be useful, but WITHOUT ANY
12 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
13 * PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
14 *
15 * You should have received copies of the GNU General Public License and GNU Lesser
16 * General Public License along with ndn-cxx, e.g., in COPYING.md file. If not, see
17 * <http://www.gnu.org/licenses/>.
18 *
19 * See AUTHORS.md for complete list of ndn-cxx authors and contributors.
20 */
21
22#include "util/in-memory-storage-lru.hpp"
23#include "security/key-chain.hpp"
24
25#include "boost-test.hpp"
Spyridon Mastorakis429634f2015-02-19 17:35:33 -080026#include "../make-interest-data.hpp"
Jiewen Tan99135962014-09-20 02:18:53 -070027
28namespace ndn {
29namespace util {
Spyridon Mastorakis429634f2015-02-19 17:35:33 -080030namespace tests {
Jiewen Tan99135962014-09-20 02:18:53 -070031
Alexander Afanasyev3ccc6f72014-10-12 12:19:09 -070032BOOST_AUTO_TEST_SUITE(UtilInMemoryStorage)
33BOOST_AUTO_TEST_SUITE(Lru)
Jiewen Tan99135962014-09-20 02:18:53 -070034
35BOOST_AUTO_TEST_CASE(UsedTimeQueue)
36{
37 InMemoryStorageLru ims;
38
39 Name name1("/insert/1");
40 shared_ptr<Data> data1 = makeData(name1);
41 ims.insert(*data1);
42
43 Name name2("/insert/2");
44 shared_ptr<Data> data2 = makeData(name2);
45 ims.insert(*data2);
46
47 Name name3("/insert/3");
48 shared_ptr<Data> data3 = makeData(name3);
49 ims.insert(*data3);
50
51 shared_ptr<Interest> interest1 = makeInterest(name1);
52 shared_ptr<Interest> interest2 = makeInterest(name2);
53 shared_ptr<Interest> interest3 = makeInterest(name3);
54
55 ims.find(*interest1);
56 ims.find(*interest2);
57 ims.find(*interest3);
58 ims.find(*interest1);
59 ims.find(*interest3);
60 ims.find(*interest3);
61
62 ims.evictItem();
63 BOOST_CHECK_EQUAL(ims.size(), 2);
64
65 shared_ptr<const Data> found2 = ims.find(*interest2);
66 BOOST_CHECK(!static_cast<bool>(found2));
67
68 shared_ptr<const Data> found1 = ims.find(*interest1);
69 BOOST_CHECK_EQUAL(found1->getName(), name1);
70 shared_ptr<const Data> found3 = ims.find(*interest3);
71 BOOST_CHECK_EQUAL(found3->getName(), name3);
72}
73
74BOOST_AUTO_TEST_CASE(UsedTimeQueue2)
75{
76 InMemoryStorageLru ims;
77
78 Name name1("/insert/1");
79 shared_ptr<Data> data = makeData(name1);
80 ims.insert(*data);
81
82 Name name2("/insert/2");
83 shared_ptr<Data> data2 = makeData(name2);
84 ims.insert(*data2);
85
86 Name name3("/insert/3");
87 shared_ptr<Data> data3 = makeData(name3);
88 ims.insert(*data3);
89
90 shared_ptr<Interest> interest1 = makeInterest(name1);
91 shared_ptr<Interest> interest2 = makeInterest(name2);
92 shared_ptr<Interest> interest3 = makeInterest(name3);
93
94 ims.find(*interest1);
95 ims.find(*interest2);
96 ims.find(*interest3);
97 ims.find(*interest1);
98 ims.find(*interest3);
99 ims.find(*interest3);
100
101 ims.evictItem();
102 BOOST_CHECK_EQUAL(ims.size(), 2);
103
104 shared_ptr<const Data> found2 = ims.find(*interest2);
105 BOOST_CHECK(!static_cast<bool>(found2));
106
107 shared_ptr<const Data> found1 = ims.find(*interest1);
108 BOOST_CHECK_EQUAL(found1->getName(), name1);
109 shared_ptr<const Data> found3 = ims.find(*interest3);
110 BOOST_CHECK_EQUAL(found3->getName(), name3);
111
112 Name name4("/insert/4");
113 shared_ptr<Data> data4 = makeData(name4);
114 ims.insert(*data4);
115
116 shared_ptr<Interest> interest4 = makeInterest(name4);
117 ims.find(*interest4);
118 ims.find(*interest1);
119 ims.find(*interest3);
120
121 ims.evictItem();
122 BOOST_CHECK_EQUAL(ims.size(), 2);
123
124 shared_ptr<const Data> found4 = ims.find(*interest4);
125 BOOST_CHECK(!static_cast<bool>(found4));
126
127 found1 = ims.find(*interest1);
128 BOOST_CHECK_EQUAL(found1->getName(), name1);
129 found3 = ims.find(*interest3);
130 BOOST_CHECK_EQUAL(found3->getName(), name3);
131}
132
Alexander Afanasyev3ccc6f72014-10-12 12:19:09 -0700133BOOST_AUTO_TEST_SUITE_END() // Lru
134BOOST_AUTO_TEST_SUITE_END() // UtilInMemoryStorage
Jiewen Tan99135962014-09-20 02:18:53 -0700135
Spyridon Mastorakis429634f2015-02-19 17:35:33 -0800136} // namespace tests
Jiewen Tan99135962014-09-20 02:18:53 -0700137} // namespace util
138} // namespace ndn