536 lines
22 KiB
C++
536 lines
22 KiB
C++
|
#include "../test.h"
|
||
|
|
#include <rxcpp/operators/rx-reduce.hpp>
|
||
|
|
#include <rxcpp/operators/rx-filter.hpp>
|
||
|
|
#include <rxcpp/operators/rx-map.hpp>
|
||
|
|
#include <rxcpp/operators/rx-take.hpp>
|
||
|
|
#include <rxcpp/operators/rx-concat_map.hpp>
|
||
|
|
#include <rxcpp/operators/rx-observe_on.hpp>
|
||
|
|
|
||
|
|
static const int static_tripletCount = 100;
|
||
|
|
|
||
|
|
SCENARIO("concat_transform pythagorian ranges", "[!hide][range][concat_transform][pythagorian][perf]"){
|
||
|
|
const int& tripletCount = static_tripletCount;
|
||
|
|
GIVEN("some ranges"){
|
||
|
|
WHEN("generating pythagorian triplets"){
|
||
|
|
using namespace std::chrono;
|
||
|
|
typedef steady_clock clock;
|
||
|
|
|
||
|
|
auto sc = rxsc::make_immediate();
|
||
|
|
//auto sc = rxsc::make_current_thread();
|
||
|
|
auto so = rx::identity_one_worker(sc);
|
||
|
|
|
||
|
|
int c = 0;
|
||
|
|
int ct = 0;
|
||
|
|
int n = 1;
|
||
|
|
auto start = clock::now();
|
||
|
|
auto triples =
|
||
|
|
rxs::range(1, so)
|
||
|
|
.concat_transform(
|
||
|
|
[&c, so](int z){
|
||
|
|
return rxs::range(1, z, 1, so)
|
||
|
|
.concat_transform(
|
||
|
|
[&c, so, z](int x){
|
||
|
|
return rxs::range(x, z, 1, so)
|
||
|
|
.filter([&c, z, x](int y){++c; return x*x + y*y == z*z;})
|
||
|
|
.transform([z, x](int y){return std::make_tuple(x, y, z);})
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
.as_dynamic();},
|
||
|
|
[](int /*x*/, std::tuple<int,int,int> triplet){return triplet;})
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
.as_dynamic();},
|
||
|
|
[](int /*z*/, std::tuple<int,int,int> triplet){return triplet;});
|
||
|
|
triples
|
||
|
|
.take(tripletCount)
|
||
|
|
.subscribe(
|
||
|
|
rxu::apply_to([&ct](int /*x*/,int /*y*/,int /*z*/){++ct;}),
|
||
|
|
[](rxu::error_ptr){abort();});
|
||
|
|
auto finish = clock::now();
|
||
|
|
auto msElapsed = duration_cast<milliseconds>(finish.time_since_epoch()) -
|
||
|
|
duration_cast<milliseconds>(start.time_since_epoch());
|
||
|
|
std::cout << "concat pythagorian range : " << n << " subscribed, " << c << " filtered to, " << ct << " triplets, " << msElapsed.count() << "ms elapsed " << c / (msElapsed.count() / 1000.0) << " ops/sec" << std::endl;
|
||
|
|
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
SCENARIO("synchronize concat_transform pythagorian ranges", "[!hide][range][concat_transform][synchronize][pythagorian][perf]"){
|
||
|
|
const int& tripletCount = static_tripletCount;
|
||
|
|
GIVEN("some ranges"){
|
||
|
|
WHEN("generating pythagorian triplets"){
|
||
|
|
using namespace std::chrono;
|
||
|
|
typedef steady_clock clock;
|
||
|
|
|
||
|
|
auto so = rx::synchronize_event_loop();
|
||
|
|
|
||
|
|
int c = 0;
|
||
|
|
int n = 1;
|
||
|
|
auto start = clock::now();
|
||
|
|
auto triples =
|
||
|
|
rxs::range(1, so)
|
||
|
|
.concat_transform(
|
||
|
|
[&c, so](int z){
|
||
|
|
return rxs::range(1, z, 1, so)
|
||
|
|
.concat_transform(
|
||
|
|
[&c, so, z](int x){
|
||
|
|
return rxs::range(x, z, 1, so)
|
||
|
|
.filter([&c, z, x](int y){
|
||
|
|
++c;
|
||
|
|
if (x*x + y*y == z*z) {
|
||
|
|
return true;}
|
||
|
|
else {
|
||
|
|
return false;}})
|
||
|
|
.transform([z, x](int y){return std::make_tuple(x, y, z);})
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
.as_dynamic();},
|
||
|
|
[](int /*x*/, std::tuple<int,int,int> triplet){return triplet;},
|
||
|
|
so)
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
.as_dynamic();},
|
||
|
|
[](int /*z*/, std::tuple<int,int,int> triplet){return triplet;},
|
||
|
|
so);
|
||
|
|
int ct = triples
|
||
|
|
.take(tripletCount)
|
||
|
|
.as_blocking()
|
||
|
|
.count();
|
||
|
|
|
||
|
|
auto finish = clock::now();
|
||
|
|
auto msElapsed = duration_cast<milliseconds>(finish.time_since_epoch()) -
|
||
|
|
duration_cast<milliseconds>(start.time_since_epoch());
|
||
|
|
std::cout << "concat sync pythagorian range : " << n << " subscribed, " << c << " filtered to, " << ct << " triplets, " << msElapsed.count() << "ms elapsed " << c / (msElapsed.count() / 1000.0) << " ops/sec" << std::endl;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
SCENARIO("observe_on concat_transform pythagorian ranges", "[!hide][range][concat_transform][observe_on][pythagorian][perf]"){
|
||
|
|
const int& tripletCount = static_tripletCount;
|
||
|
|
GIVEN("some ranges"){
|
||
|
|
WHEN("generating pythagorian triplets"){
|
||
|
|
using namespace std::chrono;
|
||
|
|
typedef steady_clock clock;
|
||
|
|
|
||
|
|
auto so = rx::observe_on_event_loop();
|
||
|
|
|
||
|
|
int c = 0;
|
||
|
|
int n = 1;
|
||
|
|
auto start = clock::now();
|
||
|
|
auto triples =
|
||
|
|
rxs::range(1, so)
|
||
|
|
.concat_transform(
|
||
|
|
[&c, so](int z){
|
||
|
|
return rxs::range(1, z, 1, so)
|
||
|
|
.concat_transform(
|
||
|
|
[&c, so, z](int x){
|
||
|
|
return rxs::range(x, z, 1, so)
|
||
|
|
.filter([&c, z, x](int y){
|
||
|
|
++c;
|
||
|
|
if (x*x + y*y == z*z) {
|
||
|
|
return true;}
|
||
|
|
else {
|
||
|
|
return false;}})
|
||
|
|
.transform([z, x](int y){return std::make_tuple(x, y, z);})
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
.as_dynamic();},
|
||
|
|
[](int /*x*/, std::tuple<int,int,int> triplet){return triplet;},
|
||
|
|
so)
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
.as_dynamic();},
|
||
|
|
[](int /*z*/, std::tuple<int,int,int> triplet){return triplet;},
|
||
|
|
so);
|
||
|
|
|
||
|
|
int ct = triples
|
||
|
|
.take(tripletCount)
|
||
|
|
.as_blocking()
|
||
|
|
.count();
|
||
|
|
|
||
|
|
auto finish = clock::now();
|
||
|
|
auto msElapsed = duration_cast<milliseconds>(finish.time_since_epoch()) -
|
||
|
|
duration_cast<milliseconds>(start.time_since_epoch());
|
||
|
|
std::cout << "concat observe_on pythagorian range : " << n << " subscribed, " << c << " filtered to, " << ct << " triplets, " << msElapsed.count() << "ms elapsed " << c / (msElapsed.count() / 1000.0) << " ops/sec" << std::endl;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
SCENARIO("serialize concat_transform pythagorian ranges", "[!hide][range][concat_transform][serialize][pythagorian][perf]"){
|
||
|
|
const int& tripletCount = static_tripletCount;
|
||
|
|
GIVEN("some ranges"){
|
||
|
|
WHEN("generating pythagorian triplets"){
|
||
|
|
using namespace std::chrono;
|
||
|
|
typedef steady_clock clock;
|
||
|
|
|
||
|
|
auto so = rx::serialize_event_loop();
|
||
|
|
|
||
|
|
int c = 0;
|
||
|
|
int n = 1;
|
||
|
|
auto start = clock::now();
|
||
|
|
auto triples =
|
||
|
|
rxs::range(1, so)
|
||
|
|
.concat_transform(
|
||
|
|
[&c, so](int z){
|
||
|
|
return rxs::range(1, z, 1, so)
|
||
|
|
.concat_transform(
|
||
|
|
[&c, so, z](int x){
|
||
|
|
return rxs::range(x, z, 1, so)
|
||
|
|
.filter([&c, z, x](int y){
|
||
|
|
++c;
|
||
|
|
if (x*x + y*y == z*z) {
|
||
|
|
return true;}
|
||
|
|
else {
|
||
|
|
return false;}})
|
||
|
|
.transform([z, x](int y){return std::make_tuple(x, y, z);})
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
.as_dynamic();},
|
||
|
|
[](int /*x*/, std::tuple<int,int,int> triplet){return triplet;},
|
||
|
|
so)
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
.as_dynamic();},
|
||
|
|
[](int /*z*/, std::tuple<int,int,int> triplet){return triplet;},
|
||
|
|
so);
|
||
|
|
|
||
|
|
int ct = triples
|
||
|
|
.take(tripletCount)
|
||
|
|
.as_blocking()
|
||
|
|
.count();
|
||
|
|
|
||
|
|
auto finish = clock::now();
|
||
|
|
auto msElapsed = duration_cast<milliseconds>(finish.time_since_epoch()) -
|
||
|
|
duration_cast<milliseconds>(start.time_since_epoch());
|
||
|
|
std::cout << "concat serial pythagorian range : " << n << " subscribed, " << c << " filtered to, " << ct << " triplets, " << msElapsed.count() << "ms elapsed " << c / (msElapsed.count() / 1000.0) << " ops/sec" << std::endl;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
SCENARIO("concat_map completes", "[concat_map][transform][map][operators]"){
|
||
|
|
GIVEN("two cold observables. one of ints. one of strings."){
|
||
|
|
auto sc = rxsc::make_test();
|
||
|
|
auto w = sc.create_worker();
|
||
|
|
const rxsc::test::messages<int> i_on;
|
||
|
|
const rxsc::test::messages<std::string> s_on;
|
||
|
|
|
||
|
|
auto xs = sc.make_cold_observable({
|
||
|
|
i_on.next(100, 4),
|
||
|
|
i_on.next(200, 2),
|
||
|
|
i_on.completed(500)
|
||
|
|
});
|
||
|
|
|
||
|
|
auto ys = sc.make_cold_observable({
|
||
|
|
s_on.next(50, "foo"),
|
||
|
|
s_on.next(100, "bar"),
|
||
|
|
s_on.next(150, "baz"),
|
||
|
|
s_on.next(200, "qux"),
|
||
|
|
s_on.completed(250)
|
||
|
|
});
|
||
|
|
|
||
|
|
WHEN("each int is mapped to the strings"){
|
||
|
|
|
||
|
|
auto res = w.start(
|
||
|
|
[&]() {
|
||
|
|
return xs
|
||
|
|
| rxo::concat_map(
|
||
|
|
[&](int){
|
||
|
|
return ys;},
|
||
|
|
[](int, std::string s){
|
||
|
|
return s;})
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
| rxo::as_dynamic();
|
||
|
|
}
|
||
|
|
);
|
||
|
|
|
||
|
|
THEN("the output contains strings repeated for each int"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
s_on.next(350, "foo"),
|
||
|
|
s_on.next(400, "bar"),
|
||
|
|
s_on.next(450, "baz"),
|
||
|
|
s_on.next(500, "qux"),
|
||
|
|
s_on.next(600, "foo"),
|
||
|
|
s_on.next(650, "bar"),
|
||
|
|
s_on.next(700, "baz"),
|
||
|
|
s_on.next(750, "qux"),
|
||
|
|
s_on.completed(800)
|
||
|
|
});
|
||
|
|
auto actual = res.get_observer().messages();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
|
||
|
|
THEN("there was one subscription and one unsubscription to the ints"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
i_on.subscribe(200, 700)
|
||
|
|
});
|
||
|
|
auto actual = xs.subscriptions();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
|
||
|
|
THEN("there were 2 subscription and unsubscription to the strings"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
s_on.subscribe(300, 550),
|
||
|
|
s_on.subscribe(550, 800)
|
||
|
|
});
|
||
|
|
auto actual = ys.subscriptions();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
SCENARIO("concat_transform completes", "[concat_transform][transform][map][operators]"){
|
||
|
|
GIVEN("two cold observables. one of ints. one of strings."){
|
||
|
|
auto sc = rxsc::make_test();
|
||
|
|
auto w = sc.create_worker();
|
||
|
|
const rxsc::test::messages<int> i_on;
|
||
|
|
const rxsc::test::messages<std::string> s_on;
|
||
|
|
|
||
|
|
auto xs = sc.make_cold_observable({
|
||
|
|
i_on.next(100, 4),
|
||
|
|
i_on.next(200, 2),
|
||
|
|
i_on.completed(500)
|
||
|
|
});
|
||
|
|
|
||
|
|
auto ys = sc.make_cold_observable({
|
||
|
|
s_on.next(50, "foo"),
|
||
|
|
s_on.next(100, "bar"),
|
||
|
|
s_on.next(150, "baz"),
|
||
|
|
s_on.next(200, "qux"),
|
||
|
|
s_on.completed(250)
|
||
|
|
});
|
||
|
|
|
||
|
|
WHEN("each int is mapped to the strings"){
|
||
|
|
|
||
|
|
auto res = w.start(
|
||
|
|
[&]() {
|
||
|
|
return xs
|
||
|
|
| rxo::concat_transform(
|
||
|
|
[&](int){
|
||
|
|
return ys;},
|
||
|
|
[](int, std::string s){
|
||
|
|
return s;})
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
| rxo::as_dynamic();
|
||
|
|
}
|
||
|
|
);
|
||
|
|
|
||
|
|
THEN("the output contains strings repeated for each int"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
s_on.next(350, "foo"),
|
||
|
|
s_on.next(400, "bar"),
|
||
|
|
s_on.next(450, "baz"),
|
||
|
|
s_on.next(500, "qux"),
|
||
|
|
s_on.next(600, "foo"),
|
||
|
|
s_on.next(650, "bar"),
|
||
|
|
s_on.next(700, "baz"),
|
||
|
|
s_on.next(750, "qux"),
|
||
|
|
s_on.completed(800)
|
||
|
|
});
|
||
|
|
auto actual = res.get_observer().messages();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
|
||
|
|
THEN("there was one subscription and one unsubscription to the ints"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
i_on.subscribe(200, 700)
|
||
|
|
});
|
||
|
|
auto actual = xs.subscriptions();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
|
||
|
|
THEN("there were 2 subscription and unsubscription to the strings"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
s_on.subscribe(300, 550),
|
||
|
|
s_on.subscribe(550, 800)
|
||
|
|
});
|
||
|
|
auto actual = ys.subscriptions();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
WHEN("each int is mapped to the strings with coordinator"){
|
||
|
|
|
||
|
|
auto res = w.start(
|
||
|
|
[&]() {
|
||
|
|
return xs
|
||
|
|
.concat_transform(
|
||
|
|
[&](int){
|
||
|
|
return ys;},
|
||
|
|
[](int, std::string s){
|
||
|
|
return s;},
|
||
|
|
rx::identity_current_thread())
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
.as_dynamic();
|
||
|
|
}
|
||
|
|
);
|
||
|
|
|
||
|
|
THEN("the output contains strings repeated for each int"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
s_on.next(350, "foo"),
|
||
|
|
s_on.next(400, "bar"),
|
||
|
|
s_on.next(450, "baz"),
|
||
|
|
s_on.next(500, "qux"),
|
||
|
|
s_on.next(600, "foo"),
|
||
|
|
s_on.next(650, "bar"),
|
||
|
|
s_on.next(700, "baz"),
|
||
|
|
s_on.next(750, "qux"),
|
||
|
|
s_on.completed(800)
|
||
|
|
});
|
||
|
|
auto actual = res.get_observer().messages();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
|
||
|
|
THEN("there was one subscription and one unsubscription to the ints"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
i_on.subscribe(200, 700)
|
||
|
|
});
|
||
|
|
auto actual = xs.subscriptions();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
|
||
|
|
THEN("there were 2 subscription and unsubscription to the strings"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
s_on.subscribe(300, 550),
|
||
|
|
s_on.subscribe(550, 800)
|
||
|
|
});
|
||
|
|
auto actual = ys.subscriptions();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
SCENARIO("concat_transform, no result selector, no coordination", "[concat_transform][transform][map][operators]"){
|
||
|
|
GIVEN("two cold observables. one of ints. one of strings."){
|
||
|
|
auto sc = rxsc::make_test();
|
||
|
|
auto w = sc.create_worker();
|
||
|
|
const rxsc::test::messages<int> i_on;
|
||
|
|
const rxsc::test::messages<std::string> s_on;
|
||
|
|
|
||
|
|
auto xs = sc.make_cold_observable({
|
||
|
|
i_on.next(100, 4),
|
||
|
|
i_on.next(200, 2),
|
||
|
|
i_on.completed(500)
|
||
|
|
});
|
||
|
|
|
||
|
|
auto ys = sc.make_cold_observable({
|
||
|
|
s_on.next(50, "foo"),
|
||
|
|
s_on.next(100, "bar"),
|
||
|
|
s_on.next(150, "baz"),
|
||
|
|
s_on.next(200, "qux"),
|
||
|
|
s_on.completed(250)
|
||
|
|
});
|
||
|
|
|
||
|
|
WHEN("each int is mapped to the strings"){
|
||
|
|
|
||
|
|
auto res = w.start(
|
||
|
|
[&]() {
|
||
|
|
return xs
|
||
|
|
.concat_transform(
|
||
|
|
[&](int){
|
||
|
|
return ys;})
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
.as_dynamic();
|
||
|
|
}
|
||
|
|
);
|
||
|
|
|
||
|
|
THEN("the output contains strings repeated for each int"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
s_on.next(350, "foo"),
|
||
|
|
s_on.next(400, "bar"),
|
||
|
|
s_on.next(450, "baz"),
|
||
|
|
s_on.next(500, "qux"),
|
||
|
|
s_on.next(600, "foo"),
|
||
|
|
s_on.next(650, "bar"),
|
||
|
|
s_on.next(700, "baz"),
|
||
|
|
s_on.next(750, "qux"),
|
||
|
|
s_on.completed(800)
|
||
|
|
});
|
||
|
|
auto actual = res.get_observer().messages();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
|
||
|
|
THEN("there was one subscription and one unsubscription to the ints"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
i_on.subscribe(200, 700)
|
||
|
|
});
|
||
|
|
auto actual = xs.subscriptions();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
|
||
|
|
THEN("there were 2 subscription and unsubscription to the strings"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
s_on.subscribe(300, 550),
|
||
|
|
s_on.subscribe(550, 800)
|
||
|
|
});
|
||
|
|
auto actual = ys.subscriptions();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
SCENARIO("concat_transform, no result selector, with coordination", "[concat_transform][transform][map][operators]"){
|
||
|
|
GIVEN("two cold observables. one of ints. one of strings."){
|
||
|
|
auto sc = rxsc::make_test();
|
||
|
|
auto w = sc.create_worker();
|
||
|
|
const rxsc::test::messages<int> i_on;
|
||
|
|
const rxsc::test::messages<std::string> s_on;
|
||
|
|
|
||
|
|
auto xs = sc.make_cold_observable({
|
||
|
|
i_on.next(100, 4),
|
||
|
|
i_on.next(200, 2),
|
||
|
|
i_on.completed(500)
|
||
|
|
});
|
||
|
|
|
||
|
|
auto ys = sc.make_cold_observable({
|
||
|
|
s_on.next(50, "foo"),
|
||
|
|
s_on.next(100, "bar"),
|
||
|
|
s_on.next(150, "baz"),
|
||
|
|
s_on.next(200, "qux"),
|
||
|
|
s_on.completed(250)
|
||
|
|
});
|
||
|
|
|
||
|
|
WHEN("each int is mapped to the strings"){
|
||
|
|
|
||
|
|
auto res = w.start(
|
||
|
|
[&]() {
|
||
|
|
return xs
|
||
|
|
.concat_transform(
|
||
|
|
[&](int){
|
||
|
|
return ys;},
|
||
|
|
rx::identity_current_thread())
|
||
|
|
// forget type to workaround lambda deduction bug on msvc 2013
|
||
|
|
.as_dynamic();
|
||
|
|
}
|
||
|
|
);
|
||
|
|
|
||
|
|
THEN("the output contains strings repeated for each int"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
s_on.next(350, "foo"),
|
||
|
|
s_on.next(400, "bar"),
|
||
|
|
s_on.next(450, "baz"),
|
||
|
|
s_on.next(500, "qux"),
|
||
|
|
s_on.next(600, "foo"),
|
||
|
|
s_on.next(650, "bar"),
|
||
|
|
s_on.next(700, "baz"),
|
||
|
|
s_on.next(750, "qux"),
|
||
|
|
s_on.completed(800)
|
||
|
|
});
|
||
|
|
auto actual = res.get_observer().messages();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
|
||
|
|
THEN("there was one subscription and one unsubscription to the ints"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
i_on.subscribe(200, 700)
|
||
|
|
});
|
||
|
|
auto actual = xs.subscriptions();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
|
||
|
|
THEN("there were 2 subscription and unsubscription to the strings"){
|
||
|
|
auto required = rxu::to_vector({
|
||
|
|
s_on.subscribe(300, 550),
|
||
|
|
s_on.subscribe(550, 800)
|
||
|
|
});
|
||
|
|
auto actual = ys.subscriptions();
|
||
|
|
REQUIRE(required == actual);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|