forked from cawka/ndn.cxx
diff --git a/test/event-scheduler-tests.cc b/test/event-scheduler-tests.cc
new file mode 100644
index 0000000..fab5b76
--- /dev/null
+++ b/test/event-scheduler-tests.cc
@@ -0,0 +1,177 @@
+/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil -*- */
+/*
+ * Copyright (c) 2013, Regents of the University of California
+ * Alexander Afanasyev
+ * Zhenkai Zhu
+ *
+ * BSD license, See the LICENSE file for more information
+ *
+ * Author: Zhenkai Zhu <zhenkai@cs.ucla.edu>
+ * Alexander Afanasyev <alexander.afanasyev@ucla.edu>
+ */
+
+#include "scheduler/scheduler-all.h"
+
+#include <boost/test/unit_test.hpp>
+#include <boost/make_shared.hpp>
+#include <map>
+#include <unistd.h>
+
+using namespace boost;
+using namespace std;
+
+BOOST_AUTO_TEST_SUITE(SchedulerTests)
+
+map<string, int> table;
+
+void func(string str)
+{
+ map<string, int>::iterator it = table.find(str);
+ if (it == table.end())
+ {
+ table.insert(make_pair(str, 1));
+ }
+ else
+ {
+ int count = it->second;
+ count++;
+ table.erase(it);
+ table.insert(make_pair(str, count));
+ }
+}
+
+bool
+matcher(const TaskPtr &task)
+{
+ return task->tag() == "period" || task->tag() == "world";
+}
+
+BOOST_AUTO_TEST_CASE(SchedulerTest)
+{
+ SchedulerPtr scheduler(new Scheduler());
+ IntervalGeneratorPtr generator(new SimpleIntervalGenerator(0.2));
+
+ string tag1 = "hello";
+ string tag2 = "world";
+ string tag3 = "period";
+
+ TaskPtr task1(new OneTimeTask(boost::bind(func, tag1), tag1, scheduler, 0.5));
+ TaskPtr task2(new OneTimeTask(boost::bind(func, tag2), tag2, scheduler, 0.5));
+ TaskPtr task3(new PeriodicTask(boost::bind(func, tag3), tag3, scheduler, generator));
+
+ scheduler->start();
+ scheduler->addTask(task1);
+ scheduler->addTask(task2);
+ scheduler->addTask(task3);
+ BOOST_CHECK_EQUAL(scheduler->size(), 3);
+ usleep(600000);
+ BOOST_CHECK_EQUAL(scheduler->size(), 1);
+ scheduler->addTask(task1);
+ BOOST_CHECK_EQUAL(scheduler->size(), 2);
+ usleep(600000);
+ scheduler->addTask(task1);
+ BOOST_CHECK_EQUAL(scheduler->size(), 2);
+ usleep(400000);
+ scheduler->deleteTask(task1->tag());
+ BOOST_CHECK_EQUAL(scheduler->size(), 1);
+ usleep(200000);
+
+ scheduler->addTask(task1);
+ scheduler->addTask(task2);
+ BOOST_CHECK_EQUAL(scheduler->size(), 3);
+ usleep(100000);
+ scheduler->deleteTask(bind(matcher, _1));
+ BOOST_CHECK_EQUAL(scheduler->size(), 1);
+ usleep(1000000);
+
+ BOOST_CHECK_EQUAL(scheduler->size(), 0);
+ scheduler->addTask(task1);
+ usleep(400000);
+ BOOST_CHECK_EQUAL(scheduler->size(), 1);
+ scheduler->rescheduleTask(task1);
+ usleep(400000);
+ BOOST_CHECK_EQUAL(scheduler->size(), 1);
+ usleep(110000);
+ BOOST_CHECK_EQUAL(scheduler->size(), 0);
+
+
+ int hello = 0, world = 0, period = 0;
+
+ map<string, int>::iterator it;
+ it = table.find(tag1);
+ if (it != table.end())
+ {
+ hello = it->second;
+ }
+ it = table.find(tag2);
+ if (it != table.end())
+ {
+ world = it->second;
+ }
+ it = table.find(tag3);
+ if (it != table.end())
+ {
+ period = it->second;
+ }
+
+ // added five times, canceled once before invoking callback
+ BOOST_CHECK_EQUAL(hello, 4);
+ // added two times, canceled once by matcher before invoking callback
+ BOOST_CHECK_EQUAL(world, 1);
+ // invoked every 0.2 seconds before deleted by matcher
+ BOOST_CHECK_EQUAL(period, static_cast<int>((0.6 + 0.6 + 0.4 + 0.2 + 0.1) / 0.2));
+
+ scheduler->shutdown();
+}
+
+void reschedule();
+SchedulerPtr schd0(new Scheduler());
+int resCount;
+TaskPtr task0(new PeriodicTask(boost::bind(reschedule), "testtest", schd0, boost::make_shared<SimpleIntervalGenerator>(0.5)));
+void reschedule()
+{
+ schd0->rescheduleTask(task0);
+ resCount++;
+}
+
+BOOST_AUTO_TEST_CASE(RescheduleTest)
+{
+ resCount = 0;
+ schd0->start();
+ schd0->addTask(task0);
+ usleep(5100000);
+ BOOST_CHECK_EQUAL(resCount, 10);
+ schd0->shutdown();
+}
+
+BOOST_AUTO_TEST_CASE(GeneratorTest)
+{
+ double interval = 10;
+ double percent = 0.5;
+ int times = 10000;
+ IntervalGeneratorPtr generator(new RandomIntervalGenerator(interval, percent));
+ double sum = 0.0;
+ double min = 2 * interval;
+ double max = -1;
+ for (int i = 0; i < times; i++)
+ {
+ double next = generator->nextInterval();
+ sum += next;
+ if (next > max)
+ {
+ max = next;
+ }
+ if (next < min)
+ {
+ min = next;
+ }
+ }
+
+ BOOST_CHECK( abs(1.0 - (sum / static_cast<double>(times)) / interval) < 0.05);
+ BOOST_CHECK( min > interval * (1 - percent / 2.0));
+ BOOST_CHECK( max < interval * (1 + percent / 2.0));
+ BOOST_CHECK( abs(1.0 - ((max - min) / interval) / percent) < 0.05);
+
+}
+
+BOOST_AUTO_TEST_SUITE_END()