add fetch-task-db and integrate it with fetch-manager
diff --git a/test/test-fetch-task-db.cc b/test/test-fetch-task-db.cc
new file mode 100644
index 0000000..1e647af
--- /dev/null
+++ b/test/test-fetch-task-db.cc
@@ -0,0 +1,165 @@
+/* -*- Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil -*- */
+/*
+ * Copyright (c) 2012 University of California, Los Angeles
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License version 2 as
+ * published by the Free Software Foundation;
+ *
+ * This program 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 this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ * Author: Alexander Afanasyev <alexander.afanasyev@ucla.edu>
+ * Zhenkai Zhu <zhenkai@cs.ucla.edu>
+ */
+
+#include "logging.h"
+#include "fetch-task-db.h"
+
+#include <boost/filesystem.hpp>
+#include <boost/filesystem/fstream.hpp>
+#include <boost/function.hpp>
+#include <boost/bind.hpp>
+
+#include <boost/test/unit_test.hpp>
+#include <unistd.h>
+#include <boost/make_shared.hpp>
+#include <iostream>
+#include <iterator>
+#include <map>
+#include <utility>
+
+INIT_LOGGER ("Test.FetchTaskDb");
+
+using namespace Ccnx;
+using namespace std;
+using namespace boost;
+namespace fs = boost::filesystem;
+
+BOOST_AUTO_TEST_SUITE(TestFetchTaskDb)
+
+class Checker
+{
+public:
+ Checker(const Name &deviceName, const Name &baseName, uint64_t minSeqNo, uint64_t maxSeqNo, int priority)
+ : m_deviceName(deviceName), m_baseName(baseName), m_minSeqNo(minSeqNo), m_maxSeqNo(maxSeqNo), m_priority(priority)
+ {}
+
+ Checker(const Checker &other)
+ : m_deviceName(other.m_deviceName), m_baseName(other.m_baseName), m_minSeqNo(other.m_minSeqNo), m_maxSeqNo(other.m_maxSeqNo), m_priority(other.m_priority)
+ {}
+
+ bool
+ operator==(const Checker &other) { return m_deviceName == other.m_deviceName && m_baseName == other.m_baseName && m_minSeqNo == other.m_minSeqNo && m_maxSeqNo == other.m_maxSeqNo && m_priority == other.m_priority; }
+
+ void show()
+ {
+ cout << m_deviceName <<", " << m_baseName << ", " << m_minSeqNo << ", " << m_maxSeqNo << ", " << m_priority << endl;
+ }
+
+ Name m_deviceName;
+ Name m_baseName;
+ uint64_t m_minSeqNo;
+ uint64_t m_maxSeqNo;
+ int m_priority;
+};
+
+map<Name, Checker> checkers;
+int g_counter = 0;
+
+void
+getChecker(const Name &deviceName, const Name &baseName, uint64_t minSeqNo, uint64_t maxSeqNo, int priority)
+{
+ Checker checker(deviceName, baseName, minSeqNo, maxSeqNo, priority);
+ g_counter ++;
+ if (checkers.find(checker.m_deviceName + checker.m_baseName) != checkers.end())
+ {
+ BOOST_FAIL("duplicated checkers");
+ }
+ checkers.insert(make_pair(checker.m_deviceName + checker.m_baseName, checker));
+}
+
+BOOST_AUTO_TEST_CASE (FetchTaskDbTest)
+{
+ INIT_LOGGERS ();
+ fs::path folder("TaskDbTest");
+ fs::create_directories(folder / ".chronoshare");
+
+ FetchTaskDbPtr db = make_shared<FetchTaskDb>(folder, "test");
+
+ map<Name, Checker> m1;
+ g_counter = 0;
+
+ checkers.clear();
+
+ Name deviceNamePrefix("/device");
+ Name baseNamePrefix("/device/base");
+
+ // add 10 tasks
+ for (uint64_t i = 0; i < 10; i++)
+ {
+ Name d = deviceNamePrefix;
+ Name b = baseNamePrefix;
+ Checker c(d.appendComp(i), b.appendComp(i), i, 11, 1);
+ m1.insert(make_pair(d + b, c));
+ db->addTask(c.m_deviceName, c.m_baseName, c.m_minSeqNo, c.m_maxSeqNo, c.m_priority);
+ }
+
+ // delete the latter 5
+ for (uint64_t i = 5; i < 10; i++)
+ {
+ Name d = deviceNamePrefix;
+ Name b = baseNamePrefix;
+ d.appendComp(i);
+ b.appendComp(i);
+ db->deleteTask(d, b);
+ }
+
+ // add back 3 to 7, 3 and 4 should not be added twice
+
+ for (uint64_t i = 3; i < 8; i++)
+ {
+ Name d = deviceNamePrefix;
+ Name b = baseNamePrefix;
+ Checker c(d.appendComp(i), b.appendComp(i), i, 11, 1);
+ db->addTask(c.m_deviceName, c.m_baseName, c.m_minSeqNo, c.m_maxSeqNo, c.m_priority);
+ }
+
+ db->foreachTask(bind(getChecker, _1, _2, _3, _4, _5));
+
+ BOOST_CHECK_EQUAL(g_counter, 8);
+
+ map<Name, Checker>::iterator it = checkers.begin();
+ while (it != checkers.end())
+ {
+ map<Name, Checker>::iterator mt = m1.find(it->first);
+ if (mt == m1.end())
+ {
+ BOOST_FAIL("unknown task found");
+ }
+ else
+ {
+ Checker c1 = it->second;
+ Checker c2 = mt->second;
+ BOOST_CHECK(c1 == c2);
+ if (! (c1 == c2))
+ {
+ cout << "C1: " << endl;
+ c1.show();
+ cout << "C2: " << endl;
+ c2.show();
+ }
+ }
+ ++it;
+ }
+ fs::remove_all(folder);
+}
+
+
+BOOST_AUTO_TEST_SUITE_END()