mirror of
https://github.com/scylladb/scylladb.git
synced 2026-05-31 03:56:42 +00:00
a0d748c71c
Replace range_tombstone::feed_hash() with the specialization of appending_hash, so that we can use the general feed_hash() function. Signed-off-by: Duarte Nunes <duarte@scylladb.com>
89 lines
2.8 KiB
C++
89 lines
2.8 KiB
C++
/*
|
|
* Copyright (C) 2015 ScyllaDB
|
|
*/
|
|
|
|
/*
|
|
* 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/>.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include "mutation_partition_visitor.hh"
|
|
#include "hashing.hh"
|
|
#include "schema.hh"
|
|
#include "atomic_cell_hash.hh"
|
|
#include "keys.hh"
|
|
#include "counters.hh"
|
|
|
|
// Calculates a hash of a mutation_partition which is consistent with
|
|
// mutation equality. For any equal mutations, no matter which schema
|
|
// version they were generated under, the hash fed will be the same for both of them.
|
|
template<typename Hasher>
|
|
class hashing_partition_visitor : public mutation_partition_visitor {
|
|
Hasher& _h;
|
|
const schema& _s;
|
|
public:
|
|
hashing_partition_visitor(Hasher& h, const schema& s)
|
|
: _h(h)
|
|
, _s(s)
|
|
{ }
|
|
|
|
virtual void accept_partition_tombstone(tombstone t) {
|
|
feed_hash(_h, t);
|
|
}
|
|
|
|
virtual void accept_static_cell(column_id id, atomic_cell_view cell) {
|
|
auto&& col = _s.static_column_at(id);
|
|
feed_hash(_h, col.name());
|
|
feed_hash(_h, col.type->name());
|
|
feed_hash(_h, cell, col);
|
|
}
|
|
|
|
virtual void accept_static_cell(column_id id, collection_mutation_view cell) {
|
|
auto&& col = _s.static_column_at(id);
|
|
feed_hash(_h, col.name());
|
|
feed_hash(_h, col.type->name());
|
|
feed_hash(_h, cell, col);
|
|
}
|
|
|
|
virtual void accept_row_tombstone(const range_tombstone& rt) {
|
|
feed_hash(_h, rt, _s);
|
|
}
|
|
|
|
virtual void accept_row(position_in_partition_view pos, const row_tombstone& deleted_at, const row_marker& rm, is_dummy dummy, is_continuous continuous) override {
|
|
if (dummy) {
|
|
return;
|
|
}
|
|
feed_hash(_h, pos.key(), _s);
|
|
feed_hash(_h, deleted_at);
|
|
feed_hash(_h, rm);
|
|
}
|
|
|
|
virtual void accept_row_cell(column_id id, atomic_cell_view cell) {
|
|
auto&& col = _s.regular_column_at(id);
|
|
feed_hash(_h, col.name());
|
|
feed_hash(_h, col.type->name());
|
|
feed_hash(_h, cell, col);
|
|
}
|
|
|
|
virtual void accept_row_cell(column_id id, collection_mutation_view cell) {
|
|
auto&& col = _s.regular_column_at(id);
|
|
feed_hash(_h, col.name());
|
|
feed_hash(_h, col.type->name());
|
|
feed_hash(_h, cell, col);
|
|
}
|
|
};
|