Method clear

fdbclient/WriteMap.cpp:160–203

}

void WriteMap::clear(KeyRangeRef keys, bool addConflict) {
	writeMapEmpty = false;
	if (!addConflict) {
		clearNoConflict(keys);
		return;
	}

	auto& it = scratch_iterator;
	it.reset(writes, ver);
	it.skip(keys.begin);

	bool insert_begin = !it.is_cleared_range() || !it.is_conflict_range() || it.is_unreadable();

	if (it.endKey() == keys.end) {
		++it;
	} else if (it.endKey() < keys.end) {
		it.skip(keys.end);
	}

	bool insert_end = (it.is_unmodified_range() || !it.is_conflict_range() || it.is_unreadable()) &&
	                  (!it.keyAtBegin() || it.beginKey() != keys.end);
	bool end_coalesce_clear =
	    it.is_cleared_range() && it.beginKey() == keys.end && it.is_conflict_range() && !it.is_unreadable();
	bool end_conflict = it.is_conflict_range();
	bool end_cleared = it.is_cleared_range();
	bool end_unreadable = it.is_unreadable();

	it.tree.clear();

	PTreeImpl::remove(writes,
	                  ver,
	                  ExtStringRef(keys.begin, !insert_begin ? 1 : 0),
	                  ExtStringRef(keys.end, end_coalesce_clear ? 1 : 0));

	if (insert_begin)
		PTreeImpl::insert(writes, ver, WriteMapEntry(keys.begin, OperationStack(), true, true, true, false, false));

	if (insert_end)
		PTreeImpl::insert(
		    writes,
		    ver,
		    WriteMapEntry(
		        keys.end, OperationStack(), end_cleared, end_conflict, end_conflict, end_unreadable, end_unreadable));
}

void WriteMap::addUnmodifiedAndUnreadableRange(KeyRangeRef keys) {
	auto& it = scratch_iterator;