blob: 60de483ded4b4909e1cb0095e089af716cab2faf [file] [log] [blame]
/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/*
* Copyright (c) 2014-2019, Regents of the University of California,
* Arizona Board of Regents,
* Colorado State University,
* University Pierre & Marie Curie, Sorbonne University,
* Washington University in St. Louis,
* Beijing Institute of Technology,
* The University of Memphis.
*
* This file is part of NFD (Named Data Networking Forwarding Daemon).
* See AUTHORS.md for complete list of NFD authors and contributors.
*
* NFD is free software: you can redistribute it and/or modify it under the terms
* of the GNU General Public License as published by the Free Software Foundation,
* either version 3 of the License, or (at your option) any later version.
*
* NFD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
* without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
* PURPOSE. See the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along with
* NFD, e.g., in COPYING.md file. If not, see <http://www.gnu.org/licenses/>.
*/
#include "common/counter.hpp"
#include "tests/test-common.hpp"
namespace nfd {
namespace tests {
BOOST_AUTO_TEST_SUITE(TestCounter)
BOOST_AUTO_TEST_CASE(PacketCnt)
{
PacketCounter counter;
uint64_t observation = counter; // implicit conversion
BOOST_CHECK_EQUAL(observation, 0);
++counter;
BOOST_CHECK_EQUAL(counter, 1);
++counter;
++counter;
BOOST_CHECK_EQUAL(counter, 3);
counter.set(2);
BOOST_CHECK_EQUAL(counter, 2);
}
BOOST_AUTO_TEST_CASE(ByteCnt)
{
ByteCounter counter;
uint64_t observation = counter; // implicit conversion
BOOST_CHECK_EQUAL(observation, 0);
counter += 20;
BOOST_CHECK_EQUAL(counter, 20);
counter += 80;
counter += 90;
BOOST_CHECK_EQUAL(counter, 190);
counter.set(21);
BOOST_CHECK_EQUAL(counter, 21);
}
BOOST_AUTO_TEST_CASE(SizeCnt)
{
std::vector<int> v;
SizeCounter<std::vector<int>> counter1(&v);
SizeCounter<std::vector<int>> counter2;
counter2.observe(&v);
size_t observation1 = counter1; // implicit conversion
size_t observation2 = counter2;
BOOST_CHECK_EQUAL(observation1, 0);
BOOST_CHECK_EQUAL(observation2, 0);
v.resize(249);
BOOST_CHECK_EQUAL(counter1, 249);
BOOST_CHECK_EQUAL(counter2, 249);
v.resize(98);
BOOST_CHECK_EQUAL(counter1, 98);
BOOST_CHECK_EQUAL(counter2, 98);
}
BOOST_AUTO_TEST_SUITE_END() // TestCounter
} // namespace tests
} // namespace nfd