row_cache: Fix bug in populate()

lower_bound() of course can return an iterator to an entry which has a different key.
scylladb · Jul 27, 2015 · 31d28c5 · 31d28c5
1 parent 3e76675
commit 31d28c5
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/row_cache.cc b/row_cache.cc
@@ -98,7 +98,7 @@ void row_cache::populate(const mutation& m) {
 
 void row_cache::populate(mutation&& m) {
     auto i = _partitions.lower_bound(m.decorated_key(), cache_entry::compare(_schema));
-    if (i == _partitions.end()) {
+    if (i == _partitions.end() || !i->key().equal(*_schema, m.decorated_key())) {
         cache_entry* entry = new cache_entry(m.decorated_key(), std::move(m.partition()));
         _tracker.insert(*entry);
         _partitions.insert(i, *entry);