Method addConflictRange

fdbclient/WriteMap.cpp:244–303

}

void WriteMap::addConflictRange(KeyRangeRef keys) {
	writeMapEmpty = false;
	auto& it = scratch_iterator;
	it.reset(writes, ver);
	it.skip(keys.begin);

	std::vector<ExtStringRef> removals;
	std::vector<WriteMapEntry> insertions;

	if (!it.entry().following_keys_conflict || !it.entry().is_conflict) {
		if (it.keyAtBegin() && it.beginKey() == keys.begin) {
			removals.push_back(keys.begin);
		}
		insertions.push_back(WriteMapEntry(keys.begin,
		                                   it.is_operation() ? OperationStack(it.op()) : OperationStack(),
		                                   it.entry().following_keys_cleared,
		                                   true,
		                                   true,
		                                   it.entry().following_keys_unreadable,
		                                   it.entry().is_unreadable));
	}

	while (it.endKey() < keys.end) {
		++it;
		if (it.keyAtBegin() && (!it.entry().following_keys_conflict || !it.entry().is_conflict)) {
			WriteMapEntry e(it.entry());
			e.following_keys_conflict = true;
			e.is_conflict = true;
			removals.push_back(e.key);
			insertions.push_back(std::move(e));
		}
	}

	ASSERT(it.beginKey() != keys.end);
	if (!it.entry().following_keys_conflict || !it.entry().is_conflict) {
		bool isCleared = it.entry().following_keys_cleared;
		bool isUnreadable = it.entry().is_unreadable;
		bool followingUnreadable = it.entry().following_keys_unreadable;
		++it;

		if (!it.keyAtBegin() || it.beginKey() != keys.end) {
			insertions.push_back(
			    WriteMapEntry(keys.end, OperationStack(), isCleared, false, false, followingUnreadable, isUnreadable));
		}
	}

	it.tree.clear();

	// SOMEDAY: optimize this code by having a PTree removal/insertion that takes and returns an iterator
	for (int i = 0; i < removals.size(); i++) {
		PTreeImpl::remove(
		    writes,
		    ver,
		    removals[i]); // FIXME: Make PTreeImpl::insert do this automatically (see also VersionedMap.h FIXME)
	}

	for (int i = 0; i < insertions.size(); i++) {
		PTreeImpl::insert(writes, ver, std::move(insertions[i]));