270 lines
10 KiB
C++
270 lines
10 KiB
C++
/*
|
|
* Copyright 2015 Cloudius Systems
|
|
*/
|
|
|
|
/*
|
|
* This file is part of Scylla.
|
|
*
|
|
* Scylla is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Affero General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* Scylla 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 Scylla. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#define BOOST_TEST_DYN_LINK
|
|
#define BOOST_TEST_MODULE core
|
|
|
|
#include <boost/test/unit_test.hpp>
|
|
#include "query-request.hh"
|
|
#include "schema_builder.hh"
|
|
|
|
static
|
|
bool includes_token(const schema& s, const query::partition_range& r, const dht::token& tok) {
|
|
dht::ring_position_comparator cmp(s);
|
|
|
|
if (r.is_wrap_around(cmp)) {
|
|
auto sub = r.unwrap();
|
|
return includes_token(s, sub.first, tok)
|
|
|| includes_token(s, sub.second, tok);
|
|
}
|
|
|
|
return !r.before(dht::ring_position(tok, dht::ring_position::token_bound::end), cmp)
|
|
&& !r.after(dht::ring_position(tok, dht::ring_position::token_bound::start), cmp);
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(test_range_with_positions_within_the_same_token) {
|
|
auto s = schema_builder("ks", "cf")
|
|
.with_column("key", bytes_type, column_kind::partition_key)
|
|
.with_column("v", bytes_type)
|
|
.build();
|
|
|
|
dht::token tok = dht::global_partitioner().get_random_token();
|
|
|
|
auto key1 = dht::decorated_key{tok,
|
|
partition_key::from_single_value(*s, bytes_type->decompose(bytes("key1")))};
|
|
|
|
auto key2 = dht::decorated_key{tok,
|
|
partition_key::from_single_value(*s, bytes_type->decompose(bytes("key2")))};
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
dht::ring_position(key2),
|
|
dht::ring_position(key1));
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
dht::ring_position(key1),
|
|
dht::ring_position(key2));
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(!r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position(key2), false},
|
|
{dht::ring_position(key1), false});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(!r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(!r.contains(key2, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position(key1), false},
|
|
{dht::ring_position(key2), false});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(!r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(!r.contains(key2, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(!r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position::starting_at(tok), false},
|
|
{dht::ring_position(key2), true});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(!r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position::ending_at(tok), false},
|
|
{dht::ring_position(key2), true});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position::ending_at(tok), false},
|
|
{dht::ring_position(key1), true});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(!r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position(key1), false},
|
|
{dht::ring_position::starting_at(tok), true});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(!r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position::starting_at(tok), true},
|
|
{dht::ring_position::ending_at(tok), true});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(!r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position::ending_at(tok), true},
|
|
{dht::ring_position::starting_at(tok), true});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(!r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(!r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(test_range_with_equal_value_but_opposite_inclusiveness_is_a_full_wrap_around) {
|
|
auto s = schema_builder("ks", "cf")
|
|
.with_column("key", bytes_type, column_kind::partition_key)
|
|
.with_column("v", bytes_type)
|
|
.build();
|
|
|
|
dht::token tok = dht::global_partitioner().get_random_token();
|
|
|
|
auto key1 = dht::decorated_key{
|
|
tok, partition_key::from_single_value(*s, bytes_type->decompose(bytes("key1")))};
|
|
|
|
auto key2 = dht::decorated_key{
|
|
tok, partition_key::from_single_value(*s, bytes_type->decompose(bytes("key2")))};
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position::starting_at(tok), true},
|
|
{dht::ring_position::starting_at(tok), false});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position::starting_at(tok), false},
|
|
{dht::ring_position::starting_at(tok), true});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position::ending_at(tok), false},
|
|
{dht::ring_position::ending_at(tok), true});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position::ending_at(tok), true},
|
|
{dht::ring_position::ending_at(tok), false});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position(key1), true},
|
|
{dht::ring_position(key1), false});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position(key1), false},
|
|
{dht::ring_position(key1), true});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position(key1), false},
|
|
{dht::ring_position(key1), false});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(!r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
|
|
{
|
|
auto r = query::partition_range::make(
|
|
{dht::ring_position(key2), false},
|
|
{dht::ring_position(key2), false});
|
|
|
|
BOOST_REQUIRE(includes_token(*s, r, tok));
|
|
BOOST_REQUIRE(r.is_wrap_around(dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(r.contains(key1, dht::ring_position_comparator(*s)));
|
|
BOOST_REQUIRE(!r.contains(key2, dht::ring_position_comparator(*s)));
|
|
}
|
|
}
|