blob: 428d2e37961112bb10e46da767c123b6d64d9314 [file] [log] [blame]
Jiewen Tan99135962014-09-20 02:18:53 -07001/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
2/**
3 * Copyright (c) 2013-2014 Regents of the University of California.
4 *
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-lfu.hpp"
23#include "security/key-chain.hpp"
24
25#include "boost-test.hpp"
26#include "../test-make-interest-data.hpp"
27
28namespace ndn {
29namespace util {
30
Alexander Afanasyev3ccc6f72014-10-12 12:19:09 -070031BOOST_AUTO_TEST_SUITE(UtilInMemoryStorage)
32BOOST_AUTO_TEST_SUITE(Lfu)
Jiewen Tan99135962014-09-20 02:18:53 -070033
34BOOST_AUTO_TEST_CASE(FrequencyQueue)
35{
36 InMemoryStorageLfu ims;
37
38 Name name1("/insert/1");
39 shared_ptr<Data> data1 = makeData(name1);
40 ims.insert(*data1);
41
42 Name name2("/insert/2");
43 shared_ptr<Data> data2 = makeData(name2);
44 ims.insert(*data2);
45
46 Name name3("/insert/3");
47 shared_ptr<Data> data3 = makeData(name3);
48 ims.insert(*data3);
49
50 shared_ptr<Interest> interest1 = makeInterest(name1);
51 shared_ptr<Interest> interest2 = makeInterest(name2);
52 shared_ptr<Interest> interest3 = makeInterest(name3);
53
54 ims.find(*interest1);
55 ims.find(*interest2);
56 ims.find(*interest3);
57 ims.find(*interest1);
58 ims.find(*interest3);
59 ims.find(*interest3);
60
61 ims.evictItem();
62 BOOST_CHECK_EQUAL(ims.size(), 2);
63
64 shared_ptr<const Data> found2 = ims.find(*interest2);
65 BOOST_CHECK(!static_cast<bool>(found2));
66
67 shared_ptr<const Data> found1 = ims.find(*interest1);
68 BOOST_CHECK_EQUAL(found1->getName(), name1);
69 shared_ptr<const Data> found3 = ims.find(*interest3);
70 BOOST_CHECK_EQUAL(found3->getName(), name3);
71}
72
73BOOST_AUTO_TEST_CASE(FrequencyQueue2)
74{
75 InMemoryStorageLfu ims;
76
77 Name name1("/insert/1");
78 shared_ptr<Data> data1 = makeData(name1);
79 ims.insert(*data1);
80
81 Name name2("/insert/2");
82 shared_ptr<Data> data2 = makeData(name2);
83 ims.insert(*data2);
84
85 Name name3("/insert/3");
86 shared_ptr<Data> data3 = makeData(name3);
87 ims.insert(*data3);
88
89 shared_ptr<Interest> interest1 = makeInterest(name1);
90 shared_ptr<Interest> interest2 = makeInterest(name2);
91 shared_ptr<Interest> interest3 = makeInterest(name3);
92
93 ims.find(*interest1);
94 ims.find(*interest2);
95 ims.find(*interest3);
96 ims.find(*interest1);
97 ims.find(*interest3);
98 ims.find(*interest3);
99
100 ims.evictItem();
101 BOOST_CHECK_EQUAL(ims.size(), 2);
102
103 shared_ptr<const Data> found2 = ims.find(*interest2);
104 BOOST_CHECK(!static_cast<bool>(found2));
105
106 shared_ptr<const Data> found1 = ims.find(*interest1);
107 BOOST_CHECK_EQUAL(found1->getName(), name1);
108 shared_ptr<const Data> found3 = ims.find(*interest3);
109 BOOST_CHECK_EQUAL(found3->getName(), name3);
110
111 Name name4("/insert/4");
112 shared_ptr<Data> data4 = makeData(name4);
113 ims.insert(*data4);
114
115 shared_ptr<Interest> interest4 = makeInterest(name4);
116 ims.find(*interest4);
117
118 ims.evictItem();
119 BOOST_CHECK_EQUAL(ims.size(), 2);
120
121 shared_ptr<const Data> found4 = ims.find(*interest4);
122 BOOST_CHECK(!static_cast<bool>(found4));
123
124 found1 = ims.find(*interest1);
125 BOOST_CHECK_EQUAL(found1->getName(), name1);
126 found3 = ims.find(*interest3);
127 BOOST_CHECK_EQUAL(found3->getName(), name3);
128}
129
Alexander Afanasyev3ccc6f72014-10-12 12:19:09 -0700130BOOST_AUTO_TEST_SUITE_END() // Lfu
131BOOST_AUTO_TEST_SUITE_END() // UtilInMemoryStorage
Jiewen Tan99135962014-09-20 02:18:53 -0700132
133} // namesapce util
134} // namespace ndn