a2functionalTest.cc 1.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
  1. #include "a2functional.h"
  2. #include <string>
  3. #include <numeric>
  4. #include <algorithm>
  5. #include <cppunit/extensions/HelperMacros.h>
  6. namespace aria2 {
  7. class a2functionalTest : public CppUnit::TestFixture {
  8. CPPUNIT_TEST_SUITE(a2functionalTest);
  9. CPPUNIT_TEST(testStrjoin);
  10. CPPUNIT_TEST(testLeastRecentAccess);
  11. CPPUNIT_TEST_SUITE_END();
  12. public:
  13. void testStrjoin();
  14. void testLeastRecentAccess();
  15. struct LastAccess {
  16. time_t lastAccess_;
  17. LastAccess(time_t lastAccess) : lastAccess_(lastAccess) {}
  18. time_t getLastAccessTime() const { return lastAccess_; }
  19. };
  20. };
  21. CPPUNIT_TEST_SUITE_REGISTRATION(a2functionalTest);
  22. void a2functionalTest::testStrjoin()
  23. {
  24. std::vector<std::string> v;
  25. CPPUNIT_ASSERT_EQUAL(std::string(""), strjoin(v.begin(), v.end(), " "));
  26. v.push_back("A");
  27. CPPUNIT_ASSERT_EQUAL(std::string("A"), strjoin(v.begin(), v.end(), " "));
  28. v.push_back("hero");
  29. v.push_back("is");
  30. v.push_back("lonely");
  31. CPPUNIT_ASSERT_EQUAL(std::string("A hero is lonely"),
  32. strjoin(v.begin(), v.end(), " "));
  33. }
  34. void a2functionalTest::testLeastRecentAccess()
  35. {
  36. std::vector<LastAccess> v;
  37. for (int i = 99; i >= 0; --i) {
  38. v.push_back(LastAccess(i));
  39. }
  40. std::sort(v.begin(), v.end(), LeastRecentAccess<LastAccess>());
  41. for (int i = 0; i < 100; ++i) {
  42. CPPUNIT_ASSERT_EQUAL((time_t)i, v[i].lastAccess_);
  43. }
  44. }
  45. } // namespace aria2