mirrors/scylladb
1
0
Fork 0
mirror of https://github.com/scylladb/scylladb.git synced 2026-06-03 21:47:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

tests: Add mutation_reader_test

Browse Source
This commit is contained in:
Tomasz Grabiec
2015-06-17 13:58:26 +02:00
parent df0243d90e
commit 370712f741
3 changed files with 143 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
configure.py
View File

@@ -168,6 +168,7 @@ urchin_tests = [
'tests/perf/perf_cql_parser',
'tests/perf/perf_simple_query',
'tests/urchin/cql_query_test',
'tests/urchin/mutation_reader_test',
'tests/test-serialization',
'tests/urchin/sstable_test',
'tests/urchin/sstable_mutation_test',
@@ -526,6 +527,7 @@ for t in urchin_tests:
deps['tests/urchin/mutation_test'] += boost_test_lib
deps['tests/urchin/cql_query_test'] += boost_test_lib
deps['tests/urchin/mutation_reader_test'] += boost_test_lib
deps['tests/urchin/commitlog_test'] += boost_test_lib
deps['tests/urchin/config_test'] += boost_test_lib
deps['tests/urchin/sstable_test'] += boost_test_lib + ['tests/urchin/sstable_datafile_test.cc']

1
test.py
View File

@@ -34,6 +34,7 @@ boost_tests = [
'urchin/types_test',
'urchin/keys_test',
'urchin/mutation_test',
'urchin/mutation_reader_test',
'urchin/cql_query_test',
'urchin/sstable_test',
'urchin/sstable_mutation_test',

140
tests/urchin/mutation_reader_test.cc Normal file
View File

@@ -0,0 +1,140 @@
/*
* Copyright 2015 Cloudius Systems
*/
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>
#include "tests/test-utils.hh"
#include "tests/urchin/mutation_assertions.hh"
#include "mutation_reader.hh"
#include "core/do_with.hh"
#include "schema_builder.hh"
static schema_ptr make_schema() {
return schema_builder("ks", "cf")
.with_column("pk", bytes_type, column_kind::partition_key)
.with_column("v", bytes_type, column_kind::regular_column)
.build();
}
static future<> require_produces_next(mutation_reader& reader, mutation m) {
return reader().then([m = std::move(m)] (mutation_opt&& mo) {
BOOST_REQUIRE(bool(mo));
assert_that(*mo).is_equal_to(m);
});
}
static future<> require_end_of_stream(mutation_reader& reader) {
return reader().then([] (mutation_opt&& mo) {
if (bool(mo)) {
BOOST_FAIL(sprint("Expected end of stream, got %s", *mo));
}
});
}
SEASTAR_TEST_CASE(test_combining_two_readers_with_the_same_row) {
auto s = make_schema();
mutation m1(partition_key::from_single_value(*s, "key1"), s);
m1.set_clustered_cell(clustering_key::make_empty(*s), "v", bytes("v1"), 1);
mutation m2(partition_key::from_single_value(*s, "key1"), s);
m2.set_clustered_cell(clustering_key::make_empty(*s), "v", bytes("v2"), 2);
return do_with(make_combined_reader({make_reader_returning(m1), make_reader_returning(m2)}), [m2] (auto& cr) {
return require_produces_next(cr, m2).then([&cr] {
return require_end_of_stream(cr);
});
});
}
SEASTAR_TEST_CASE(test_combining_two_non_overlapping_readers) {
auto s = make_schema();
mutation m1(partition_key::from_single_value(*s, "keyB"), s);
m1.set_clustered_cell(clustering_key::make_empty(*s), "v", bytes("v1"), 1);
mutation m2(partition_key::from_single_value(*s, "keyA"), s);
m2.set_clustered_cell(clustering_key::make_empty(*s), "v", bytes("v2"), 2);
return do_with(make_combined_reader({make_reader_returning(m1), make_reader_returning(m2)}), [m2, m1] (auto& cr) {
return require_produces_next(cr, m2).then([&cr, m1] {
return require_produces_next(cr, m1);
}).then([&cr] {
return require_end_of_stream(cr);
});
});
}
SEASTAR_TEST_CASE(test_combining_two_partially_overlapping_readers) {
auto s = make_schema();
mutation m1(partition_key::from_single_value(*s, "keyA"), s);
m1.set_clustered_cell(clustering_key::make_empty(*s), "v", bytes("v1"), 1);
mutation m2(partition_key::from_single_value(*s, "keyB"), s);
m2.set_clustered_cell(clustering_key::make_empty(*s), "v", bytes("v2"), 1);
mutation m3(partition_key::from_single_value(*s, "keyC"), s);
m3.set_clustered_cell(clustering_key::make_empty(*s), "v", bytes("v3"), 1);
return do_with(make_combined_reader({make_reader_returning_many({m1, m2}), make_reader_returning_many({m2, m3})}), [=] (auto& cr) {
return require_produces_next(cr, m1).then([&cr, m2] {
return require_produces_next(cr, m2);
}).then([&cr, m3] {
return require_produces_next(cr, m3);
}).then([&cr] {
return require_end_of_stream(cr);
});
});
}
SEASTAR_TEST_CASE(test_combining_one_reader_with_many_partitions) {
auto s = make_schema();
mutation m1(partition_key::from_single_value(*s, "keyA"), s);
m1.set_clustered_cell(clustering_key::make_empty(*s), "v", bytes("v1"), 1);
mutation m2(partition_key::from_single_value(*s, "keyB"), s);
m2.set_clustered_cell(clustering_key::make_empty(*s), "v", bytes("v2"), 1);
mutation m3(partition_key::from_single_value(*s, "keyC"), s);
m3.set_clustered_cell(clustering_key::make_empty(*s), "v", bytes("v3"), 1);
return do_with(make_combined_reader({make_reader_returning_many({m1, m2, m3})}), [=] (auto& cr) {
return require_produces_next(cr, m1).then([&cr, m2] {
return require_produces_next(cr, m2);
}).then([&cr, m3] {
return require_produces_next(cr, m3);
}).then([&cr] {
return require_end_of_stream(cr);
});
});
}
SEASTAR_TEST_CASE(test_combining_two_readers_with_one_reader_empty) {
auto s = make_schema();
mutation m1(partition_key::from_single_value(*s, "key1"), s);
m1.set_clustered_cell(clustering_key::make_empty(*s), "v", bytes("v1"), 1);
return do_with(make_combined_reader({make_reader_returning(m1), make_empty_reader()}), [m1] (auto& cr) {
return require_produces_next(cr, m1).then([&cr] {
return require_end_of_stream(cr);
});
});
}
SEASTAR_TEST_CASE(test_combining_two_empty_readers) {
return do_with(make_combined_reader({make_empty_reader(), make_empty_reader()}), [] (auto& cr) {
return require_end_of_stream(cr);
});
}
SEASTAR_TEST_CASE(test_combining_one_empty_reader) {
return do_with(make_combined_reader({make_empty_reader()}), [] (auto& cr) {
return require_end_of_stream(cr);
});
}