blob: 1fa8b835c9c2828d5b96aa2fd241a8f3cd6b822a [file] [log] [blame]
Jiewen Tan99135962014-09-20 02:18:53 -07001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
Junxiao Shic542f632017-07-18 14:20:32 +00002/*
Alexander Afanasyev4c9a3d52017-01-03 17:45:19 -08003 * Copyright (c) 2013-2017 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
Junxiao Shic542f632017-07-18 14:20:32 +000022#include "ims/in-memory-storage-lfu.hpp"
Jiewen Tan99135962014-09-20 02:18:53 -070023
24#include "boost-test.hpp"
Junxiao Shi2bea5c42017-08-14 20:10:32 +000025#include "make-interest-data.hpp"
Jiewen Tan99135962014-09-20 02:18:53 -070026
27namespace ndn {
Spyridon Mastorakis429634f2015-02-19 17:35:33 -080028namespace tests {
Jiewen Tan99135962014-09-20 02:18:53 -070029
Junxiao Shi85d90832016-08-04 03:19:46 +000030using namespace ndn::tests;
31
Junxiao Shic542f632017-07-18 14:20:32 +000032BOOST_AUTO_TEST_SUITE(Ims)
33BOOST_AUTO_TEST_SUITE(TestInMemoryStorageLfu)
Jiewen Tan99135962014-09-20 02:18:53 -070034
35BOOST_AUTO_TEST_CASE(FrequencyQueue)
36{
37 InMemoryStorageLfu 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);
Junxiao Shi85d90832016-08-04 03:19:46 +000066 BOOST_CHECK(found2 == nullptr);
Jiewen Tan99135962014-09-20 02:18:53 -070067
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(FrequencyQueue2)
75{
76 InMemoryStorageLfu ims;
77
78 Name name1("/insert/1");
79 shared_ptr<Data> data1 = makeData(name1);
80 ims.insert(*data1);
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);
Junxiao Shi85d90832016-08-04 03:19:46 +0000105 BOOST_CHECK(found2 == nullptr);
Jiewen Tan99135962014-09-20 02:18:53 -0700106
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
119 ims.evictItem();
120 BOOST_CHECK_EQUAL(ims.size(), 2);
121
122 shared_ptr<const Data> found4 = ims.find(*interest4);
Junxiao Shi85d90832016-08-04 03:19:46 +0000123 BOOST_CHECK(found4 == nullptr);
Jiewen Tan99135962014-09-20 02:18:53 -0700124
125 found1 = ims.find(*interest1);
126 BOOST_CHECK_EQUAL(found1->getName(), name1);
127 found3 = ims.find(*interest3);
128 BOOST_CHECK_EQUAL(found3->getName(), name3);
129}
130
Junxiao Shic542f632017-07-18 14:20:32 +0000131BOOST_AUTO_TEST_SUITE_END() // TestInMemoryStorageLfu
132BOOST_AUTO_TEST_SUITE_END() // Ims
Jiewen Tan99135962014-09-20 02:18:53 -0700133
Spyridon Mastorakis429634f2015-02-19 17:35:33 -0800134} // namespace tests
Jiewen Tan99135962014-09-20 02:18:53 -0700135} // namespace ndn