Alex Hultman
122 lines
3.4 KiB
C++
122 lines
3.4 KiB
C++
#include "../src/TopicTree.h"
|
|
|
|
#include <cassert>
|
|
#include <iostream>
|
|
|
|
void testUnsubscribeInside() {
|
|
std::cout << "TestUnsubscribeInside" << std::endl;
|
|
|
|
uWS::TopicTree *topicTree;
|
|
std::map<void *, std::pair<std::string, std::string>> expectedResult;
|
|
|
|
topicTree = new uWS::TopicTree([&topicTree, &expectedResult](uWS::Subscriber *s, std::pair<std::string_view, std::string_view> dataChannels) {
|
|
std::string_view data = dataChannels.second;
|
|
|
|
/* Check for unexpected subscribers */
|
|
assert(expectedResult.find(s) != expectedResult.end());
|
|
|
|
/* Check for unexpected data */
|
|
assert(expectedResult[s].first == dataChannels.first && expectedResult[s].second == dataChannels.second);
|
|
|
|
/* This one causes mess-up */
|
|
topicTree->unsubscribeAll(s);
|
|
|
|
/* We actually don't use this one */
|
|
return 0;
|
|
});
|
|
|
|
uWS::Subscriber *s1 = new uWS::Subscriber(nullptr);
|
|
uWS::Subscriber *s2 = new uWS::Subscriber(nullptr);
|
|
|
|
/* Fill out expectedResult */
|
|
expectedResult = {
|
|
{s1, {"Ett!", "Ett!"}},
|
|
{s2, {"Två!", "Två!"}}
|
|
};
|
|
|
|
/* Make sure s1 < s2 */
|
|
if (s2 < s1) {
|
|
uWS::Subscriber *tmp = s1;
|
|
s1 = s2;
|
|
s2 = tmp;
|
|
}
|
|
|
|
/* This order does not matter as it fills a tree */
|
|
topicTree->subscribe("2", s2);
|
|
topicTree->subscribe("1", s1);
|
|
|
|
/* This order matters, as it fills triggeredTopics array in order */
|
|
topicTree->publish("1", {std::string_view("Ett!"), std::string_view("Ett!")});
|
|
topicTree->publish("2", {std::string_view("Två!"), std::string_view("Ett!")});
|
|
|
|
topicTree->drain();
|
|
|
|
/* Release resources */
|
|
topicTree->unsubscribeAll(s1);
|
|
topicTree->unsubscribeAll(s2);
|
|
|
|
delete s1;
|
|
delete s2;
|
|
|
|
delete topicTree;
|
|
}
|
|
|
|
void testPublisherHoles() {
|
|
std::cout << "TestPublisherHoles" << std::endl;
|
|
|
|
uWS::TopicTree *topicTree;
|
|
std::map<void *, std::pair<std::string, std::string>> expectedResult;
|
|
|
|
topicTree = new uWS::TopicTree([&topicTree, &expectedResult](uWS::Subscriber *s, std::pair<std::string_view, std::string_view> dataChannels) {
|
|
|
|
/* Check for unexpected subscribers */
|
|
assert(expectedResult.find(s) != expectedResult.end());
|
|
|
|
/* Check for unexpected data */
|
|
assert(expectedResult[s].first == dataChannels.first && expectedResult[s].second == dataChannels.second);
|
|
|
|
/* We actually don't use this one */
|
|
return 0;
|
|
});
|
|
|
|
uWS::Subscriber *s1 = new uWS::Subscriber(nullptr);
|
|
uWS::Subscriber *s2 = new uWS::Subscriber(nullptr);
|
|
|
|
/* Fill out expectedResult */
|
|
expectedResult = {
|
|
{s1, {"Två!", "Två!"}}, // todo: this one should not receive what he sent himself
|
|
{s2, {"Två!", "Två!"}}
|
|
};
|
|
|
|
/* Make sure s1 < s2 */
|
|
if (s2 < s1) {
|
|
uWS::Subscriber *tmp = s1;
|
|
s1 = s2;
|
|
s2 = tmp;
|
|
}
|
|
|
|
/* This order does not matter as it fills a tree */
|
|
topicTree->subscribe("1", s2);
|
|
topicTree->subscribe("1", s1);
|
|
|
|
/* This order matters, as it fills triggeredTopics array in order */
|
|
//topicTree->publish("1", {std::string_view("Ett!"), std::string_view("Ett!")});
|
|
topicTree->publish("1", {std::string_view("Två!"), std::string_view("Två!")});
|
|
|
|
topicTree->drain();
|
|
|
|
/* Release resources */
|
|
topicTree->unsubscribeAll(s1);
|
|
topicTree->unsubscribeAll(s2);
|
|
|
|
delete s1;
|
|
delete s2;
|
|
|
|
delete topicTree;
|
|
}
|
|
|
|
int main() {
|
|
//testUnsubscribeInside();
|
|
|
|
testPublisherHoles();
|
|
} |