CavalliumDBEngine/src/main/java/it/cavallium/dbengine/database/disk/LLLocalDictionary.java

package it.cavallium.dbengine.database.disk;

import io.netty.buffer.ByteBuf;
import io.netty.buffer.ByteBufAllocator;
import io.netty.util.ReferenceCounted;
import it.cavallium.dbengine.database.Delta;
import it.cavallium.dbengine.database.LLDictionary;
import it.cavallium.dbengine.database.LLDictionaryResultType;
import it.cavallium.dbengine.database.LLRange;
import it.cavallium.dbengine.database.LLSnapshot;
import it.cavallium.dbengine.database.LLUtils;
import it.cavallium.dbengine.database.UpdateMode;
import it.cavallium.dbengine.database.UpdateReturnMode;
import it.unimi.dsi.fastutil.ints.IntArrayList;
import it.unimi.dsi.fastutil.objects.ObjectArrayList;
import java.io.IOException;
import java.nio.ByteBuffer;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Objects;
import java.util.concurrent.Callable;
import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.ForkJoinTask;
import java.util.concurrent.locks.StampedLock;
import java.util.function.Function;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import org.apache.commons.lang3.tuple.Pair;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
import org.rocksdb.AbstractSlice;
import org.rocksdb.CappedWriteBatch;
import org.rocksdb.ColumnFamilyHandle;
import org.rocksdb.CompactRangeOptions;
import org.rocksdb.DirectSlice;
import org.rocksdb.FlushOptions;
import org.rocksdb.Holder;
import org.rocksdb.ReadOptions;
import org.rocksdb.RocksDB;
import org.rocksdb.RocksDBException;
import org.rocksdb.RocksIterator;
import org.rocksdb.Slice;
import org.rocksdb.Snapshot;
import org.rocksdb.WriteBatch;
import org.rocksdb.WriteOptions;
import org.warp.commonutils.concurrency.atomicity.NotAtomic;
import org.warp.commonutils.locks.Striped;
import org.warp.commonutils.log.Logger;
import org.warp.commonutils.log.LoggerFactory;
import reactor.core.publisher.Flux;
import reactor.core.publisher.Mono;
import reactor.core.scheduler.Scheduler;
import reactor.util.function.Tuple3;
import reactor.util.function.Tuples;
import static io.netty.buffer.Unpooled.*;

@NotAtomic
public class LLLocalDictionary implements LLDictionary {

	protected static final Logger logger = LoggerFactory.getLogger(LLLocalDictionary.class);
	private static final boolean USE_CURRENT_FASTSIZE_FOR_OLD_SNAPSHOTS = false;
	static final int RESERVED_WRITE_BATCH_SIZE = 2 * 1024 * 1024; // 2MiB
	static final long MAX_WRITE_BATCH_SIZE = 1024L * 1024L * 1024L; // 1GiB
	static final int CAPPED_WRITE_BATCH_CAP = 50000; // 50K operations
	static final int MULTI_GET_WINDOW = 500;
	static final ReadOptions EMPTY_READ_OPTIONS = new ReadOptions();
	static final WriteOptions EMPTY_WRITE_OPTIONS = new WriteOptions();
	static final WriteOptions BATCH_WRITE_OPTIONS = new WriteOptions();
	static final boolean PREFER_SEEK_TO_FIRST = false;
	static final boolean VERIFY_CHECKSUMS_WHEN_NOT_NEEDED = false;
	public static final boolean DEBUG_PREFIXES_WHEN_ASSERTIONS_ARE_ENABLED = true;
	/**
	 * Default: true. Use false to debug problems with windowing.
	 */
	static final boolean USE_WINDOW_IN_SET_RANGE = true;
	/**
	 * Default: true. Use false to debug problems with write batches.
	 */
	static final boolean USE_WRITE_BATCHES_IN_PUT_MULTI = true;
	/**
	 * Default: true. Use false to debug problems with write batches.
	 */
	static final boolean USE_WRITE_BATCHES_IN_SET_RANGE = true;
	/**
	 * Default: true. Use false to debug problems with capped write batches.
	 */
	static final boolean USE_CAPPED_WRITE_BATCH_IN_SET_RANGE = true;
	/**
	 * Default: true. Use false to debug problems with write batches deletes.
	 */
	static final boolean USE_WRITE_BATCH_IN_SET_RANGE_DELETE = false;
	static final boolean PARALLEL_EXACT_SIZE = true;

	private static final int STRIPES = 512;
	private static final byte[] FIRST_KEY = new byte[]{};
	private static final byte[] NO_DATA = new byte[0];

	private static final boolean ASSERTIONS_ENABLED;
	/**
	 * Default: true
	 */
	private static final boolean USE_DIRECT_BUFFER_BOUNDS = true;
	private static final int INITIAL_DIRECT_READ_BYTE_BUF_SIZE_BYTES = 4096;

	static {
		boolean assertionsEnabled = false;
		//noinspection AssertWithSideEffects
		assert (assertionsEnabled = true);
		//noinspection ConstantConditions
		ASSERTIONS_ENABLED = assertionsEnabled;
	}

	private final RocksDB db;
	private final ColumnFamilyHandle cfh;
	private final String databaseName;
	private final Scheduler dbScheduler;
	private final Function<LLSnapshot, Snapshot> snapshotResolver;
	private final Striped<StampedLock> itemsLock = Striped.readWriteStampedLock(STRIPES);
	private final UpdateMode updateMode;
	private final ByteBufAllocator alloc;
	private final String getRangeMultiDebugName;
	private final String getRangeKeysMultiDebugName;

	public LLLocalDictionary(
			ByteBufAllocator allocator,
			@NotNull RocksDB db,
			@NotNull ColumnFamilyHandle columnFamilyHandle,
			String databaseName,
			String columnDisplayName,
			Scheduler dbScheduler,
			Function<LLSnapshot, Snapshot> snapshotResolver,
			UpdateMode updateMode) {
		Objects.requireNonNull(db);
		this.db = db;
		Objects.requireNonNull(columnFamilyHandle);
		this.cfh = columnFamilyHandle;
		this.databaseName = databaseName;
		this.dbScheduler = dbScheduler;
		this.snapshotResolver = snapshotResolver;
		this.updateMode = updateMode;
		this.getRangeMultiDebugName = databaseName + "(" + columnDisplayName + ")" + "::getRangeMulti";
		this.getRangeKeysMultiDebugName = databaseName + "(" + columnDisplayName + ")" + "::getRangeKeysMulti";
		alloc = allocator;
	}

	@Override
	public String getDatabaseName() {
		return databaseName;
	}

	private ReadOptions resolveSnapshot(LLSnapshot snapshot) {
		if (snapshot != null) {
			return getReadOptions(snapshotResolver.apply(snapshot));
		} else {
			return EMPTY_READ_OPTIONS;
		}
	}

	private ReadOptions getReadOptions(Snapshot snapshot) {
		if (snapshot != null) {
			return new ReadOptions().setSnapshot(snapshot);
		} else {
			return EMPTY_READ_OPTIONS;
		}
	}

	private int getLockIndex(ByteBuf key) {
		return Math.abs(LLUtils.hashCode(key) % STRIPES);
	}

	private IntArrayList getLockIndices(List<ByteBuf> keys) {
		var list = new IntArrayList(keys.size());
		for (ByteBuf key : keys) {
			list.add(getLockIndex(key));
		}
		return list;
	}

	private IntArrayList getLockIndicesEntries(List<Entry<ByteBuf, ByteBuf>> keys) {
		var list = new IntArrayList(keys.size());
		for (Entry<ByteBuf, ByteBuf> key : keys) {
			list.add(getLockIndex(key.getKey()));
		}
		return list;
	}

	@Override
	public ByteBufAllocator getAllocator() {
		return alloc;
	}

	@Override
	public Mono<ByteBuf> get(@Nullable LLSnapshot snapshot, ByteBuf key, boolean existsAlmostCertainly) {
		try {
			return Mono
					.fromCallable(() -> {
						StampedLock lock;
						long stamp;
						if (updateMode == UpdateMode.ALLOW) {
							lock = itemsLock.getAt(getLockIndex(key));

							stamp = lock.readLock();
						} else {
							lock = null;
							stamp = 0;
						}
						try {
							if (logger.isTraceEnabled()) {
								logger.trace("Reading {}", LLUtils.toStringSafe(key));
							}
							return dbGet(cfh, resolveSnapshot(snapshot), key.retain(), existsAlmostCertainly);
						} finally {
							if (updateMode == UpdateMode.ALLOW) {
								lock.unlockRead(stamp);
							}
						}
					})
					.subscribeOn(dbScheduler)
					.onErrorMap(cause -> new IOException("Failed to read " + LLUtils.toStringSafe(key), cause))
					.doFirst(key::retain)
					.doAfterTerminate(key::release);
		} finally {
			key.release();
		}
	}

	private ByteBuf dbGet(ColumnFamilyHandle cfh,
			@Nullable ReadOptions readOptions,
			ByteBuf key,
			boolean existsAlmostCertainly) throws RocksDBException {
		try {
			if (key.isDirect()) {

				//todo: implement keyMayExist if existsAlmostCertainly is false.
				// Unfortunately it's not feasible until RocksDB implements keyMayExist with buffers

				// Create the key nio buffer to pass to RocksDB
				if (!key.isDirect()) {
					throw new RocksDBException("Key buffer must be direct");
				}
				ByteBuffer keyNioBuffer = LLUtils.toDirect(key);
				assert keyNioBuffer.isDirect();
				// Create a direct result buffer because RocksDB works only with direct buffers
				ByteBuf resultBuf = alloc.directBuffer(LLLocalDictionary.INITIAL_DIRECT_READ_BYTE_BUF_SIZE_BYTES);
				try {
					int valueSize;
					int assertionReadData = -1;
					ByteBuffer resultNioBuf;
					do {
						// Create the result nio buffer to pass to RocksDB
						resultNioBuf = resultBuf.nioBuffer(0, resultBuf.capacity());
						assert keyNioBuffer.isDirect();
						assert resultNioBuf.isDirect();
						valueSize = db.get(cfh,
								Objects.requireNonNullElse(readOptions, EMPTY_READ_OPTIONS),
								keyNioBuffer.position(0),
								resultNioBuf
						);
						if (valueSize != RocksDB.NOT_FOUND) {
							// todo: check if position is equal to data that have been read
							// todo: check if limit is equal to value size or data that have been read
							assert valueSize <= 0 || resultNioBuf.limit() > 0;

							// If the locking is enabled the data is safe, so since we are appending data to the end,
							// we need to check if it has been appended correctly or it it has been overwritten.
							// We must not do this check otherwise because if there is no locking the data can be
							// overwritten with a smaller value the next time.
							if (updateMode == UpdateMode.ALLOW) {
								// Check if read data is larger than previously read data.
								// If it's smaller or equals it means that RocksDB is overwriting the beginning of the result buffer.
								assert resultNioBuf.limit() > assertionReadData;
								if (ASSERTIONS_ENABLED) {
									assertionReadData = resultNioBuf.limit();
								}
							}

							// Check if read data is not bigger than the total value size.
							// If it's bigger it means that RocksDB is writing the start of the result into the result
							// buffer more than once.
							assert resultNioBuf.limit() <= valueSize;

							if (valueSize <= resultNioBuf.limit()) {
								// Return the result ready to be read
								return resultBuf.setIndex(0, valueSize).retain();
							} else {
								// If the locking is enabled the data is safe, so we can append the next read data.
								// Otherwise we need to re-read everything.
								if (updateMode == UpdateMode.ALLOW) {
									// Update the resultBuf writerIndex with the new position
									resultBuf.writerIndex(resultNioBuf.limit());
								}
								//noinspection UnusedAssignment
								resultNioBuf = null;
							}
							// Rewind the keyNioBuf position, making it readable again for the next loop iteration
							keyNioBuffer.rewind();
							if (resultBuf.capacity() < valueSize) {
								// Expand the resultBuf size if the result is bigger than the current result buffer size
								resultBuf.capacity(valueSize);
							}
						}
						// Repeat if the result has been found but it's still not finished
					} while (valueSize != RocksDB.NOT_FOUND);
					// If the value is not found return null
					return null;
				} finally {
					resultBuf.release();
				}
			} else {
				byte[] keyArray = LLUtils.toArray(key);
				Objects.requireNonNull(keyArray);
				Holder<byte[]> data = existsAlmostCertainly ? null : new Holder<>();
				if (existsAlmostCertainly || db.keyMayExist(cfh,
						Objects.requireNonNullElse(readOptions, EMPTY_READ_OPTIONS),
						keyArray,
						data
				)) {
					if (!existsAlmostCertainly && data.getValue() != null) {
						return wrappedBuffer(data.getValue());
					} else {
						byte[] result = db.get(cfh, Objects.requireNonNullElse(readOptions, EMPTY_READ_OPTIONS), keyArray);
						if (result == null) {
							return null;
						} else {
							return wrappedBuffer(result);
						}
					}
				} else {
					return null;
				}
			}
		} finally {
			key.release();
		}
	}

	private void dbPut(ColumnFamilyHandle cfh, @Nullable WriteOptions writeOptions, ByteBuf key, ByteBuf value)
			throws RocksDBException {
		try {
			if (key.isDirect() && value.isDirect()) {
				if (!key.isDirect()) {
					throw new RocksDBException("Key buffer must be direct");
				}
				if (!value.isDirect()) {
					throw new RocksDBException("Value buffer must be direct");
				}
					var keyNioBuffer = LLUtils.toDirect(key);
					assert keyNioBuffer.isDirect();


					var valueNioBuffer = LLUtils.toDirect(value);
					assert valueNioBuffer.isDirect();
					db.put(cfh, Objects.requireNonNullElse(writeOptions, EMPTY_WRITE_OPTIONS), keyNioBuffer, valueNioBuffer);
			} else {
				db.put(cfh, Objects.requireNonNullElse(writeOptions, EMPTY_WRITE_OPTIONS), LLUtils.toArray(key), LLUtils.toArray(value));
			}
		} finally {
			key.release();
			value.release();
		}
	}

	@Override
	public Mono<Boolean> isRangeEmpty(@Nullable LLSnapshot snapshot, LLRange range) {
		try {
			return Mono
					.defer(() -> {
						if (range.isSingle()) {
							return this.containsKey(snapshot, range.getSingle().retain());
						} else {
							return this.containsRange(snapshot, range.retain());
						}
					})
					.map(isContained -> !isContained)
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	public Mono<Boolean> containsRange(@Nullable LLSnapshot snapshot, LLRange range) {
		try {
			return Mono
					.fromCallable(() -> {
						var readOpts = resolveSnapshot(snapshot);
						readOpts.setVerifyChecksums(VERIFY_CHECKSUMS_WHEN_NOT_NEEDED);
						readOpts.setFillCache(false);
						if (range.hasMin()) {
							if (range.getMin().isDirect()) {
								readOpts.setIterateLowerBound(new DirectSlice(Objects.requireNonNull(LLUtils.toDirect(range.getMin()),
										"This range must use direct buffers"
								)));
							} else {
								readOpts.setIterateLowerBound(new Slice(LLUtils.toArray(range.getMin())));
							}
						}
						if (range.hasMax()) {
							if (range.getMax().isDirect()) {
								readOpts.setIterateUpperBound(new DirectSlice(Objects.requireNonNull(LLUtils.toDirect(range.getMax()),
										"This range must use direct buffers"
								)));
							} else {
								readOpts.setIterateUpperBound(new Slice(LLUtils.toArray(range.getMax())));
							}
						}
						try (RocksIterator rocksIterator = db.newIterator(cfh, readOpts)) {
							if (!LLLocalDictionary.PREFER_SEEK_TO_FIRST && range.hasMin()) {
								if (range.getMin().isDirect()) {
									rocksIterator.seek(Objects.requireNonNull(LLUtils.toDirect(range.getMin()),
											"This range must use direct buffers"
									));
								} else {
									rocksIterator.seek(LLUtils.toArray(range.getMin()));
								}
							} else {
								rocksIterator.seekToFirst();
							}
							return rocksIterator.isValid();
						}
					})
					.onErrorMap(cause -> new IOException("Failed to read range " + range.toString(), cause))
					.subscribeOn(dbScheduler)
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	private Mono<Boolean> containsKey(@Nullable LLSnapshot snapshot, ByteBuf key) {
		try {
			return Mono
					.fromCallable(() -> {
						StampedLock lock;
						long stamp;
						if (updateMode == UpdateMode.ALLOW) {
							lock = itemsLock.getAt(getLockIndex(key));

							stamp = lock.readLock();
						} else {
							lock = null;
							stamp = 0;
						}
						try {
							int size = RocksDB.NOT_FOUND;
							byte[] keyBytes = LLUtils.toArray(key);
							Holder<byte[]> data = new Holder<>();
							if (db.keyMayExist(cfh, resolveSnapshot(snapshot), keyBytes, data)) {
								if (data.getValue() != null) {
									size = data.getValue().length;
								} else {
									size = db.get(cfh, resolveSnapshot(snapshot), keyBytes, NO_DATA);
								}
							}
							return size != RocksDB.NOT_FOUND;
						} finally {
							if (updateMode == UpdateMode.ALLOW) {
								lock.unlockRead(stamp);
							}
						}
					})
					.onErrorMap(cause -> new IOException("Failed to read " + LLUtils.toStringSafe(key), cause))
					.subscribeOn(dbScheduler)
					.doFirst(key::retain)
					.doAfterTerminate(key::release);
		} finally {
			key.release();
		}
	}

	@Override
	public Mono<ByteBuf> put(ByteBuf key, ByteBuf value, LLDictionaryResultType resultType) {
		try {
			return Mono
					.defer(() -> getPreviousData(key.retain(), resultType))
					.concatWith(Mono
							.<ByteBuf>fromCallable(() -> {
								StampedLock lock;
								long stamp;
								if (updateMode == UpdateMode.ALLOW) {
									lock = itemsLock.getAt(getLockIndex(key));

									stamp = lock.writeLock();
								} else {
									lock = null;
									stamp = 0;
								}
								try {
									if (logger.isTraceEnabled()) {
										logger.trace("Writing {}: {}", LLUtils.toStringSafe(key), LLUtils.toStringSafe(value));
									}
									dbPut(cfh, null, key.retain(), value.retain());
									return null;
								} finally {
									if (updateMode == UpdateMode.ALLOW) {
										lock.unlockWrite(stamp);
									}
								}
							})
							.subscribeOn(dbScheduler)
							.onErrorMap(cause -> new IOException("Failed to write " + LLUtils.toStringSafe(key), cause))
					)
					.singleOrEmpty()
					.doFirst(() -> {
						key.retain();
						value.retain();
					})
					.doAfterTerminate(() -> {
						key.release();
						value.release();
					});
		} finally {
			key.release();
			value.release();
		}
	}

	@Override
	public Mono<UpdateMode> getUpdateMode() {
		return Mono.fromSupplier(() -> updateMode);
	}

	// Remember to change also updateAndGetDelta() if you are modifying this function
	@SuppressWarnings("DuplicatedCode")
	@Override
	public Mono<ByteBuf> update(ByteBuf key,
			Function<@Nullable ByteBuf, @Nullable ByteBuf> updater,
			UpdateReturnMode updateReturnMode,
			boolean existsAlmostCertainly) {
		try {
			return Mono
					.fromCallable(() -> {
						if (updateMode == UpdateMode.DISALLOW) {
							throw new UnsupportedOperationException("update() is disallowed");
						}
						StampedLock lock;
						long stamp;
						if (updateMode == UpdateMode.ALLOW) {
							lock = itemsLock.getAt(getLockIndex(key));

							stamp = lock.readLock();
						} else {
							lock = null;
							stamp = 0;
						}
						try {
							if (logger.isTraceEnabled()) {
								logger.trace("Reading {}", LLUtils.toStringSafe(key));
							}
							while (true) {
								@Nullable ByteBuf prevData;
								var prevDataHolder = existsAlmostCertainly ? null : new Holder<byte[]>();
								if (existsAlmostCertainly || db.keyMayExist(cfh, LLUtils.toArray(key), prevDataHolder)) {
									if (!existsAlmostCertainly && prevDataHolder.getValue() != null) {
										byte @Nullable [] prevDataBytes = prevDataHolder.getValue();
										if (prevDataBytes != null) {
											prevData = wrappedBuffer(prevDataBytes);
										} else {
											prevData = null;
										}
									} else {
										prevData = dbGet(cfh, null, key.retain(), existsAlmostCertainly);
									}
								} else {
									prevData = null;
								}
								try {
									@Nullable ByteBuf newData;
									ByteBuf prevDataToSendToUpdater = prevData == null ? null : prevData.retainedSlice();
									try {
										newData = updater.apply(prevDataToSendToUpdater == null ? null : prevDataToSendToUpdater.retain());
										if (!(prevDataToSendToUpdater == null
												|| prevDataToSendToUpdater.readerIndex() == 0
												|| !prevDataToSendToUpdater.isReadable())) {
											throw new IllegalStateException("The updater has read the previous data partially"
													+ " (read bytes: " + prevDataToSendToUpdater.readerIndex()
													+ " unread bytes: " + prevDataToSendToUpdater.readableBytes() + ")."
													+ " The only allowed options are reading the data fully or not reading it at all");
										}
									} finally {
										if (prevDataToSendToUpdater != null) {
											prevDataToSendToUpdater.release();
										}
									}
									try {
										if (prevData != null && newData == null) {
											//noinspection DuplicatedCode
											if (updateMode == UpdateMode.ALLOW) {
												var ws = lock.tryConvertToWriteLock(stamp);
												if (ws != 0) {
													stamp = ws;
												} else {
													lock.unlockRead(stamp);

													stamp = lock.writeLock();
													continue;
												}
											}
											if (logger.isTraceEnabled()) {
												logger.trace("Deleting {}", LLUtils.toStringSafe(key));
											}
											dbDelete(cfh, null, key.retain());
										} else if (newData != null
												&& (prevData == null || !LLUtils.equals(prevData, newData))) {
											//noinspection DuplicatedCode
											if (updateMode == UpdateMode.ALLOW) {
												var ws = lock.tryConvertToWriteLock(stamp);
												if (ws != 0) {
													stamp = ws;
												} else {
													lock.unlockRead(stamp);

													stamp = lock.writeLock();
													continue;
												}
											}
											if (logger.isTraceEnabled()) {
												logger.trace("Writing {}: {}", LLUtils.toStringSafe(key), LLUtils.toStringSafe(newData));
											}
											dbPut(cfh, null, key.retain(), newData.retain());
										}
										return switch (updateReturnMode) {
											case GET_NEW_VALUE -> newData != null ? newData.retain() : null;
											case GET_OLD_VALUE -> prevData != null ? prevData.retain() : null;
											case NOTHING -> null;
											//noinspection UnnecessaryDefault
											default -> throw new IllegalArgumentException();
										};
									} finally {
										if (newData != null) {
											newData.release();
										}
									}
								} finally {
									if (prevData != null) {
										prevData.release();
									}
								}
							}
						} finally {
							if (updateMode == UpdateMode.ALLOW) {
								lock.unlock(stamp);
							}
						}
					})
					.onErrorMap(cause -> new IOException("Failed to read or write " + LLUtils.toStringSafe(key), cause))
					.subscribeOn(dbScheduler)
					.doFirst(key::retain)
					.doAfterTerminate(key::release);
		} finally {
			key.release();
		}
	}

	// Remember to change also update() if you are modifying this function
	@SuppressWarnings("DuplicatedCode")
	@Override
	public Mono<Delta<ByteBuf>> updateAndGetDelta(ByteBuf key,
			Function<@Nullable ByteBuf, @Nullable ByteBuf> updater,
			boolean existsAlmostCertainly) {
		try {
			return Mono
					.fromCallable(() -> {
						if (updateMode == UpdateMode.DISALLOW) throw new UnsupportedOperationException("update() is disallowed");
						StampedLock lock;
						long stamp;
						if (updateMode == UpdateMode.ALLOW) {
							lock = itemsLock.getAt(getLockIndex(key));

							stamp = lock.readLock();
						} else {
							lock = null;
							stamp = 0;
						}
						try {
							if (logger.isTraceEnabled()) {
								logger.trace("Reading {}", LLUtils.toStringSafe(key));
							}
							while (true) {
								@Nullable ByteBuf prevData;
								var prevDataHolder = existsAlmostCertainly ? null : new Holder<byte[]>();
								if (existsAlmostCertainly || db.keyMayExist(cfh, LLUtils.toArray(key), prevDataHolder)) {
									if (!existsAlmostCertainly && prevDataHolder.getValue() != null) {
										byte @Nullable [] prevDataBytes = prevDataHolder.getValue();
										if (prevDataBytes != null) {
											prevData = wrappedBuffer(prevDataBytes);
										} else {
											prevData = null;
										}
									} else {
										prevData = dbGet(cfh, null, key.retain(), existsAlmostCertainly);
									}
								} else {
									prevData = null;
								}
								try {
									@Nullable ByteBuf newData;
									ByteBuf prevDataToSendToUpdater = prevData == null ? null : prevData.retainedSlice();
									try {
										newData = updater.apply(prevDataToSendToUpdater == null ? null : prevDataToSendToUpdater.retain());
										assert prevDataToSendToUpdater == null
												|| prevDataToSendToUpdater.readerIndex() == 0
												|| !prevDataToSendToUpdater.isReadable();
									} finally {
										if (prevDataToSendToUpdater != null) {
											prevDataToSendToUpdater.release();
										}
									}
									try {
										if (prevData != null && newData == null) {
											//noinspection DuplicatedCode
											if (updateMode == UpdateMode.ALLOW) {
												var ws = lock.tryConvertToWriteLock(stamp);
												if (ws != 0) {
													stamp = ws;
												} else {
													lock.unlockRead(stamp);

													stamp = lock.writeLock();
													continue;
												}
											}
											if (logger.isTraceEnabled()) {
												logger.trace("Deleting {}", LLUtils.toStringSafe(key));
											}
											dbDelete(cfh, null, key.retain());
										} else if (newData != null
												&& (prevData == null || !LLUtils.equals(prevData, newData))) {
											//noinspection DuplicatedCode
											if (updateMode == UpdateMode.ALLOW) {
												var ws = lock.tryConvertToWriteLock(stamp);
												if (ws != 0) {
													stamp = ws;
												} else {
													lock.unlockRead(stamp);

													stamp = lock.writeLock();
													continue;
												}
											}
											if (logger.isTraceEnabled()) {
												logger.trace("Writing {}: {}", LLUtils.toStringSafe(key), LLUtils.toStringSafe(newData));
											}
											dbPut(cfh, null, key.retain(), newData.retain());
										}
										return new Delta<>(
												prevData != null ? prevData.retain() : null,
												newData != null ? newData.retain() : null
										);
									} finally {
										if (newData != null) {
											newData.release();
										}
									}
								} finally {
									if (prevData != null) {
										prevData.release();
									}
								}
							}
						} finally {
							if (updateMode == UpdateMode.ALLOW) {
								lock.unlock(stamp);
							}
						}
					})
					.onErrorMap(cause -> new IOException("Failed to read or write " + LLUtils.toStringSafe(key), cause))
					.subscribeOn(dbScheduler)
					.doFirst(key::retain)
					.doAfterTerminate(key::release);
		} finally {
			key.release();
		}
	}

	private void dbDelete(ColumnFamilyHandle cfh, @Nullable WriteOptions writeOptions, ByteBuf key)
			throws RocksDBException {
		try {
			if (key.isDirect()) {
				if (!key.isDirect()) {
					throw new IllegalArgumentException("Key must be a direct buffer");
				}
				var keyNioBuffer = LLUtils.toDirect(key);
				db.delete(cfh, Objects.requireNonNullElse(writeOptions, EMPTY_WRITE_OPTIONS), keyNioBuffer);
			} else {
				db.delete(cfh, Objects.requireNonNullElse(writeOptions, EMPTY_WRITE_OPTIONS), LLUtils.toArray(key));
			}
		} finally {
			key.release();
		}
	}

	@Override
	public Mono<ByteBuf> remove(ByteBuf key, LLDictionaryResultType resultType) {
		try {
			return Mono
					.defer(() -> getPreviousData(key.retain(), resultType))
					.concatWith(Mono
							.fromCallable(() -> {
								StampedLock lock;
								long stamp;
								if (updateMode == UpdateMode.ALLOW) {
									lock = itemsLock.getAt(getLockIndex(key));

									stamp = lock.writeLock();
								} else {
									lock = null;
									stamp = 0;
								}
								try {
									if (logger.isTraceEnabled()) {
										logger.trace("Deleting {}", LLUtils.toStringSafe(key));
									}
									dbDelete(cfh, null, key.retain());
									return null;
								} finally {
									if (updateMode == UpdateMode.ALLOW) {
										lock.unlockWrite(stamp);
									}
								}
							})
							.onErrorMap(cause -> new IOException("Failed to delete " + LLUtils.toStringSafe(key), cause))
							.subscribeOn(dbScheduler)
							.then(Mono.empty())
					)
					.singleOrEmpty()
					.doFirst(key::retain)
					.doAfterTerminate(key::release);
		} finally {
			key.release();
		}
	}

	private Mono<ByteBuf> getPreviousData(ByteBuf key, LLDictionaryResultType resultType) {
		try {
			return Mono
					.defer(() -> {
						switch (resultType) {
							case PREVIOUS_VALUE_EXISTENCE:
								return this
										.containsKey(null, key.retain())
										.single()
										.map(LLUtils::booleanToResponseByteBuffer)
										.doAfterTerminate(() -> {
											assert key.refCnt() > 0;
										});
							case PREVIOUS_VALUE:
								return Mono
										.fromCallable(() -> {
											StampedLock lock;
											long stamp;
											if (updateMode == UpdateMode.ALLOW) {
												lock = itemsLock.getAt(getLockIndex(key));

												stamp = lock.readLock();
											} else {
												lock = null;
												stamp = 0;
											}
											try {
												if (logger.isTraceEnabled()) {
													logger.trace("Reading {}", LLUtils.toArray(key));
												}
												var data = new Holder<byte[]>();
												if (db.keyMayExist(cfh, LLUtils.toArray(key), data)) {
													if (data.getValue() != null) {
														return wrappedBuffer(data.getValue());
													} else {
														try {
															return dbGet(cfh, null, key.retain(), true);
														} finally {
															assert key.refCnt() > 0;
														}
													}
												} else {
													return null;
												}
											} finally {
												if (updateMode == UpdateMode.ALLOW) {
													lock.unlockRead(stamp);
												}
											}
										})
										.onErrorMap(cause -> new IOException("Failed to read " + LLUtils.toStringSafe(key), cause))
										.subscribeOn(dbScheduler);
							case VOID:
								return Mono.empty();
							default:
								return Mono.error(new IllegalStateException("Unexpected value: " + resultType));
						}
					})
					.doFirst(key::retain)
					.doAfterTerminate(key::release);
		} finally {
			key.release();
		}
	}

	@Override
	public Flux<Entry<ByteBuf, ByteBuf>> getMulti(@Nullable LLSnapshot snapshot,
			Flux<ByteBuf> keys,
			boolean existsAlmostCertainly) {
		return keys
				.window(MULTI_GET_WINDOW)
				.flatMap(keysWindowFlux -> keysWindowFlux
						.collectList()
						.doOnDiscard(Entry.class, discardedEntry -> {
							//noinspection unchecked
							var entry = (Entry<ByteBuf, ByteBuf>) discardedEntry;
							entry.getKey().release();
							entry.getValue().release();
						})
						.flatMapMany(keysWindow -> Mono
								.fromCallable(() -> {
									Iterable<StampedLock> locks;
									ArrayList<Long> stamps;
									if (updateMode == UpdateMode.ALLOW) {
										locks = itemsLock.bulkGetAt(getLockIndices(keysWindow));
										stamps = new ArrayList<>();
										for (var lock : locks) {
											
											stamps.add(lock.readLock());
										}
									} else {
										locks = null;
										stamps = null;
									}
									try {
										var handlesArray = new ColumnFamilyHandle[keysWindow.size()];
										Arrays.fill(handlesArray, cfh);
										var handles = ObjectArrayList.wrap(handlesArray, handlesArray.length);
										var results = db.multiGetAsList(resolveSnapshot(snapshot), handles, LLUtils.toArray(keysWindow));
										var mappedResults = new ArrayList<Entry<ByteBuf, ByteBuf>>(results.size());
										for (int i = 0; i < results.size(); i++) {
											var val = results.get(i);
											if (val != null) {
												results.set(i, null);
												mappedResults.add(Map.entry(keysWindow.get(i).retain(), wrappedBuffer(val)));
											}
										}
										return mappedResults;
									} finally {
										if (updateMode == UpdateMode.ALLOW) {
											int index = 0;
											for (var lock : locks) {
												lock.unlockRead(stamps.get(index));
												index++;
											}
										}
									}
								})
								.subscribeOn(dbScheduler)
								.flatMapMany(entries -> Flux.fromIterable(entries))
								.onErrorMap(cause -> new IOException("Failed to read keys "
										+ Arrays.deepToString(keysWindow.toArray(ByteBuf[]::new)), cause))
								.doAfterTerminate(() -> keysWindow.forEach(ReferenceCounted::release))
						)
				)
				.doOnDiscard(Entry.class, discardedEntry -> {
					//noinspection unchecked
					var entry = (Entry<ByteBuf, ByteBuf>) discardedEntry;
					entry.getKey().release();
					entry.getValue().release();
				});
	}

	@Override
	public Flux<Entry<ByteBuf, ByteBuf>> putMulti(Flux<Entry<ByteBuf, ByteBuf>> entries, boolean getOldValues) {
		return entries
				.window(Math.min(MULTI_GET_WINDOW, CAPPED_WRITE_BATCH_CAP))
				.doOnDiscard(Entry.class, entry -> {
					if (entry.getKey() instanceof ByteBuf && entry.getValue() instanceof ByteBuf) {
						//noinspection unchecked
						var castedEntry = (Entry<ByteBuf, ByteBuf>) entry;
						castedEntry.getKey().release();
						castedEntry.getValue().release();
					}
				})
				.flatMap(Flux::collectList)
				.doOnDiscard(Entry.class, entry -> {
					if (entry.getKey() instanceof ByteBuf && entry.getValue() instanceof ByteBuf) {
						//noinspection unchecked
						var castedEntry = (Entry<ByteBuf, ByteBuf>) entry;
						castedEntry.getKey().release();
						castedEntry.getValue().release();
					}
				})
				.map(Collections::unmodifiableList)
				.flatMap(ew -> Mono
						.using(
								() -> ew,
								entriesWindow -> Mono
										.<Entry<ByteBuf, ByteBuf>>fromCallable(() -> {
											Iterable<StampedLock> locks;
											ArrayList<Long> stamps;
											if (updateMode == UpdateMode.ALLOW) {
												locks = itemsLock.bulkGetAt(getLockIndicesEntries(entriesWindow));
												stamps = new ArrayList<>();
												for (var lock : locks) {
													stamps.add(lock.writeLock());
												}
											} else {
												locks = null;
												stamps = null;
											}
											try {
												if (USE_WRITE_BATCHES_IN_PUT_MULTI) {
													var batch = new CappedWriteBatch(db,
															CAPPED_WRITE_BATCH_CAP,
															RESERVED_WRITE_BATCH_SIZE,
															MAX_WRITE_BATCH_SIZE,
															BATCH_WRITE_OPTIONS
													);
													for (Entry<ByteBuf, ByteBuf> entry : entriesWindow) {
														batch.put(cfh, entry.getKey().retain(), entry.getValue().retain());
													}
													batch.writeToDbAndClose();
													batch.close();
												} else {
													for (Entry<ByteBuf, ByteBuf> entry : entriesWindow) {
														db.put(cfh, EMPTY_WRITE_OPTIONS, entry.getKey().nioBuffer(), entry.getValue().nioBuffer());
													}
												}
												return null;
											} finally {
												if (updateMode == UpdateMode.ALLOW) {
													int index = 0;
													for (var lock : locks) {
														lock.unlockWrite(stamps.get(index));
														index++;
													}
												}
											}
										})
										.subscribeOn(dbScheduler)

										// Prepend everything to get previous elements
										.transformDeferred(transformer -> {
											if (getOldValues) {
												return this
														.getMulti(null, Flux
																.fromIterable(entriesWindow)
																.map(Entry::getKey)
																.map(ByteBuf::retain), false)
														.publishOn(dbScheduler)
														.then(transformer);
											} else {
												return transformer;
											}
										}),
								entriesWindow -> {
									for (Entry<ByteBuf, ByteBuf> entry : entriesWindow) {
										entry.getKey().release();
										entry.getValue().release();
									}
								}
						)
				)
				.doOnDiscard(Collection.class, obj -> {
					//noinspection unchecked
					var castedEntries = (Collection<Entry<ByteBuf, ByteBuf>>) obj;
					for (Entry<ByteBuf, ByteBuf> entry : castedEntries) {
						entry.getKey().release();
						entry.getValue().release();
					}
				});
	}

	@Override
	public Flux<Entry<ByteBuf, ByteBuf>> getRange(@Nullable LLSnapshot snapshot,
			LLRange range,
			boolean existsAlmostCertainly) {
		try {
			return Flux
					.defer(() -> {
						if (range.isSingle()) {
							return getRangeSingle(snapshot, range.getMin().retain(), existsAlmostCertainly);
						} else {
							return getRangeMulti(snapshot, range.retain());
						}
					})
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	@Override
	public Flux<List<Entry<ByteBuf, ByteBuf>>> getRangeGrouped(@Nullable LLSnapshot snapshot,
			LLRange range,
			int prefixLength, boolean existsAlmostCertainly) {
		try {
			return Flux
					.defer(() -> {
						if (range.isSingle()) {
							return getRangeSingle(snapshot, range.getMin().retain(), existsAlmostCertainly).map(List::of);
						} else {
							return getRangeMultiGrouped(snapshot, range.retain(), prefixLength);
						}
					})
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	private Flux<Entry<ByteBuf, ByteBuf>> getRangeSingle(LLSnapshot snapshot, ByteBuf key, boolean existsAlmostCertainly) {
		try {
			return Mono
					.defer(() -> this.get(snapshot, key.retain(), existsAlmostCertainly))
					.map(value -> Map.entry(key.retain(), value))
					.flux()
					.doFirst(key::retain)
					.doAfterTerminate(key::release);
		} finally {
			key.release();
		}
	}

	@SuppressWarnings("Convert2MethodRef")
	private Flux<Entry<ByteBuf, ByteBuf>> getRangeMulti(LLSnapshot snapshot, LLRange range) {
		try {
			return Flux
					.using(
							() -> new LLLocalEntryReactiveRocksIterator(db,
									alloc,
									cfh,
									range.retain(),
									resolveSnapshot(snapshot),
									getRangeMultiDebugName
							),
							llLocalEntryReactiveRocksIterator -> llLocalEntryReactiveRocksIterator.flux(),
							LLLocalReactiveRocksIterator::release
					)
					.doOnDiscard(Entry.class, entry -> {
						//noinspection unchecked
						var castedEntry = (Entry<ByteBuf, ByteBuf>) entry;
						castedEntry.getKey().release();
						castedEntry.getValue().release();
					})
					.subscribeOn(dbScheduler)
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	@SuppressWarnings("Convert2MethodRef")
	private Flux<List<Entry<ByteBuf, ByteBuf>>> getRangeMultiGrouped(LLSnapshot snapshot, LLRange range, int prefixLength) {
		try {
			return Flux
					.using(
							() -> new LLLocalGroupedEntryReactiveRocksIterator(db,
									alloc,
									cfh,
									prefixLength,
									range.retain(),
									resolveSnapshot(snapshot),
									"getRangeMultiGrouped"
							),
							llLocalGroupedEntryReactiveRocksIterator -> llLocalGroupedEntryReactiveRocksIterator.flux(),
							LLLocalGroupedReactiveRocksIterator::release
					)
					.subscribeOn(dbScheduler)
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	@Override
	public Flux<ByteBuf> getRangeKeys(@Nullable LLSnapshot snapshot, LLRange range) {
		try {
			return Flux
					.defer(() -> {
						if (range.isSingle()) {
							return this.getRangeKeysSingle(snapshot, range.getMin().retain());
						} else {
							return this.getRangeKeysMulti(snapshot, range.retain());
						}
					})
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	@Override
	public Flux<List<ByteBuf>> getRangeKeysGrouped(@Nullable LLSnapshot snapshot, LLRange range, int prefixLength) {
		try {
			return Flux
					.using(
							() -> new LLLocalGroupedKeyReactiveRocksIterator(db,
									alloc,
									cfh,
									prefixLength,
									range.retain(),
									resolveSnapshot(snapshot),
									"getRangeKeysGrouped"
							),
							LLLocalGroupedReactiveRocksIterator::flux,
							LLLocalGroupedReactiveRocksIterator::release
					)
					.subscribeOn(dbScheduler)
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	@Override
	public Flux<ByteBuf> getRangeKeyPrefixes(@Nullable LLSnapshot snapshot, LLRange range, int prefixLength) {
		try {
			return Flux
					.using(
							() -> new LLLocalKeyPrefixReactiveRocksIterator(db,
									alloc,
									cfh,
									prefixLength,
									range.retain(),
									resolveSnapshot(snapshot),
									true,
									"getRangeKeysGrouped"
							),
							LLLocalKeyPrefixReactiveRocksIterator::flux,
							LLLocalKeyPrefixReactiveRocksIterator::release
					)
					.subscribeOn(dbScheduler)
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	private Flux<ByteBuf> getRangeKeysSingle(LLSnapshot snapshot, ByteBuf key) {
		try {
			return Mono
					.defer(() -> this.containsKey(snapshot, key.retain()))
					.flux()
					.<ByteBuf>handle((contains, sink) -> {
						if (contains) {
							sink.next(key.retain());
						} else {
							sink.complete();
						}
					})
					.doOnDiscard(ByteBuf.class, ReferenceCounted::release)
					.doFirst(key::retain)
					.doAfterTerminate(key::release);
		} finally {
			key.release();
		}
	}

	@SuppressWarnings("Convert2MethodRef")
	private Flux<ByteBuf> getRangeKeysMulti(LLSnapshot snapshot, LLRange range) {
		try {
			return Flux
					.using(
							() -> new LLLocalKeyReactiveRocksIterator(db,
									alloc,
									cfh,
									range.retain(),
									resolveSnapshot(snapshot),
									getRangeKeysMultiDebugName
							),
							llLocalKeyReactiveRocksIterator -> llLocalKeyReactiveRocksIterator.flux(),
							LLLocalReactiveRocksIterator::release
					)
					.doOnDiscard(ByteBuf.class, ReferenceCounted::release)
					.subscribeOn(dbScheduler)
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	@Override
	public Mono<Void> setRange(LLRange range, Flux<Entry<ByteBuf, ByteBuf>> entries) {
		try {
			if (USE_WINDOW_IN_SET_RANGE) {
				return Mono
						.<Void>fromCallable(() -> {
							if (!USE_WRITE_BATCH_IN_SET_RANGE_DELETE || !USE_WRITE_BATCHES_IN_SET_RANGE) {
								var opts = new ReadOptions(EMPTY_READ_OPTIONS);
								ReleasableSlice minBound;
								if (range.hasMin()) {
									minBound = setIterateBound(opts, IterateBound.LOWER, range.getMin().retain());
								} else {
									minBound = emptyReleasableSlice();
								}
								try {
									ReleasableSlice maxBound;
									if (range.hasMax()) {
										maxBound = setIterateBound(opts, IterateBound.UPPER, range.getMax().retain());
									} else {
										maxBound = emptyReleasableSlice();
									}
									try (RocksIterator it = db.newIterator(cfh, opts)) {
										if (!PREFER_SEEK_TO_FIRST && range.hasMin()) {
											rocksIterSeekTo(it, range.getMin().retain());
										} else {
											it.seekToFirst();
										}
										while (it.isValid()) {
											db.delete(cfh, it.key());
											it.next();
										}
									} finally {
										maxBound.release();
									}
								} finally {
									minBound.release();
								}
							} else if (USE_CAPPED_WRITE_BATCH_IN_SET_RANGE) {
								try (var batch = new CappedWriteBatch(db,
										CAPPED_WRITE_BATCH_CAP,
										RESERVED_WRITE_BATCH_SIZE,
										MAX_WRITE_BATCH_SIZE,
										BATCH_WRITE_OPTIONS
								)) {
									if (range.isSingle()) {
										batch.delete(cfh, range.getSingle().retain());
									} else {
										deleteSmallRangeWriteBatch(batch, range.retain());
									}
									batch.writeToDbAndClose();
								}
							} else {
								try (var batch = new WriteBatch(RESERVED_WRITE_BATCH_SIZE)) {
									if (range.isSingle()) {
										batch.delete(cfh, LLUtils.toArray(range.getSingle()));
									} else {
										deleteSmallRangeWriteBatch(batch, range.retain());
									}
									db.write(EMPTY_WRITE_OPTIONS, batch);
									batch.clear();
								}
							}
							return null;
						})
						.subscribeOn(dbScheduler)
						.thenMany(entries
								.window(MULTI_GET_WINDOW)
						)
						.flatMap(keysWindowFlux -> keysWindowFlux
								.collectList()
								.doOnDiscard(Entry.class, discardedEntry -> {
									//noinspection unchecked
									var entry = (Entry<ByteBuf, ByteBuf>) discardedEntry;
									entry.getKey().release();
									entry.getValue().release();
								})
								.flatMap(entriesList -> Mono
										.<Void>fromCallable(() -> {
											try {
												if (!USE_WRITE_BATCHES_IN_SET_RANGE) {
													for (Entry<ByteBuf, ByteBuf> entry : entriesList) {
														db.put(cfh, EMPTY_WRITE_OPTIONS, entry.getKey().nioBuffer(), entry.getValue().nioBuffer());
													}
												} else if (USE_CAPPED_WRITE_BATCH_IN_SET_RANGE) {
													try (var batch = new CappedWriteBatch(db,
															CAPPED_WRITE_BATCH_CAP,
															RESERVED_WRITE_BATCH_SIZE,
															MAX_WRITE_BATCH_SIZE,
															BATCH_WRITE_OPTIONS
													)) {
														for (Entry<ByteBuf, ByteBuf> entry : entriesList) {
															batch.put(cfh, entry.getKey().retain(), entry.getValue().retain());
														}
														batch.writeToDbAndClose();
													}
												} else {
													try (var batch = new WriteBatch(RESERVED_WRITE_BATCH_SIZE)) {
														for (Entry<ByteBuf, ByteBuf> entry : entriesList) {
															batch.put(cfh, LLUtils.toArray(entry.getKey()), LLUtils.toArray(entry.getValue()));
														}
														db.write(EMPTY_WRITE_OPTIONS, batch);
														batch.clear();
													}
												}
												return null;
											} finally {
												for (Entry<ByteBuf, ByteBuf> entry : entriesList) {
													entry.getKey().release();
													entry.getValue().release();
												}
											}
										})
										.subscribeOn(dbScheduler)
								)
						)
						.then()
						.onErrorMap(cause -> new IOException("Failed to write range", cause))
						.doFirst(range::retain)
						.doAfterTerminate(range::release);
			} else {
				if (USE_WRITE_BATCHES_IN_SET_RANGE) {
					return Mono.fromCallable(() -> {
						throw new UnsupportedOperationException("Can't use write batches in setRange without window. Please fix params");
					});
				}
				return Flux
						.defer(() -> this.getRange(null, range.retain(), false))
						.flatMap(oldValue -> Mono
								.<Void>fromCallable(() -> {
									try {
										dbDelete(cfh, EMPTY_WRITE_OPTIONS, oldValue.getKey().retain());
										return null;
									} finally {
										oldValue.getKey().release();
										oldValue.getValue().release();
									}
								})
								.subscribeOn(dbScheduler)
						)
						.then(entries
								.flatMap(entry -> this.put(entry.getKey(), entry.getValue(), LLDictionaryResultType.VOID))
								.doOnNext(ReferenceCounted::release)
								.then(Mono.<Void>empty())
						)
						.onErrorMap(cause -> new IOException("Failed to write range", cause))
						.doFirst(range::retain)
						.doAfterTerminate(range::release);
			}
		} finally {
			range.release();
		}
	}

	//todo: this is broken, check why
	private void deleteSmallRangeWriteBatch(CappedWriteBatch writeBatch, LLRange range)
			throws RocksDBException {
		try {
			var readOpts = getReadOptions(null);
			readOpts.setFillCache(false);
			ReleasableSlice minBound;
			if (range.hasMin()) {
				minBound = setIterateBound(readOpts, IterateBound.LOWER, range.getMin().retain());
			} else {
				minBound = emptyReleasableSlice();
			}
			try {
				ReleasableSlice maxBound;
				if (range.hasMax()) {
					maxBound = setIterateBound(readOpts, IterateBound.UPPER, range.getMax().retain());
				} else {
					maxBound = emptyReleasableSlice();
				}
				try (var rocksIterator = db.newIterator(cfh, readOpts)) {
					if (!LLLocalDictionary.PREFER_SEEK_TO_FIRST && range.hasMin()) {
						rocksIterSeekTo(rocksIterator, range.getMin().retain());
					} else {
						rocksIterator.seekToFirst();
					}
					while (rocksIterator.isValid()) {
						writeBatch.delete(cfh, LLUtils.readDirectNioBuffer(alloc, rocksIterator::key));
						rocksIterator.next();
					}
				} finally {
					maxBound.release();
				}
			} finally {
				minBound.release();
			}
		} finally {
			range.release();
		}
	}

	private void deleteSmallRangeWriteBatch(WriteBatch writeBatch, LLRange range)
			throws RocksDBException {
		try {
			var readOpts = getReadOptions(null);
			readOpts.setFillCache(false);
			ReleasableSlice minBound;
			if (range.hasMin()) {
				minBound = setIterateBound(readOpts, IterateBound.LOWER, range.getMin().retain());
			} else {
				minBound = emptyReleasableSlice();
			}
			try {
				ReleasableSlice maxBound;
				if (range.hasMax()) {
					maxBound = setIterateBound(readOpts, IterateBound.UPPER, range.getMax().retain());
				} else {
					maxBound = emptyReleasableSlice();
				}
				try (var rocksIterator = db.newIterator(cfh, readOpts)) {
					if (!LLLocalDictionary.PREFER_SEEK_TO_FIRST && range.hasMin()) {
						rocksIterSeekTo(rocksIterator, range.getMin().retain());
					} else {
						rocksIterator.seekToFirst();
					}
					while (rocksIterator.isValid()) {
						writeBatch.delete(cfh, rocksIterator.key());
						rocksIterator.next();
					}
				} finally {
					maxBound.release();
				}
			} finally {
				minBound.release();
			}
		} finally {
			range.release();
		}
	}

	private static void rocksIterSeekTo(RocksIterator rocksIterator, ByteBuf buffer) {
		try {
			if (buffer.isDirect()) {
				ByteBuffer nioBuffer = LLUtils.toDirect(buffer);
				assert nioBuffer.isDirect();
				rocksIterator.seek(nioBuffer);
			} else if (buffer.hasArray() && buffer.array().length == buffer.readableBytes()) {
				rocksIterator.seek(buffer.array());
			} else {
				rocksIterator.seek(LLUtils.toArray(buffer));
			}
		} finally {
			buffer.release();
		}
	}

	private static ReleasableSlice setIterateBound(ReadOptions readOpts, IterateBound boundType, ByteBuf buffer) {
		try {
			Objects.requireNonNull(buffer);
			AbstractSlice<?> slice;
			if (LLLocalDictionary.USE_DIRECT_BUFFER_BOUNDS && buffer.isDirect()) {
				ByteBuffer nioBuffer = LLUtils.toDirect(buffer);
				assert nioBuffer.isDirect();
				slice = new DirectSlice(nioBuffer, buffer.readableBytes());
				assert slice.size() == buffer.readableBytes();
				assert slice.compare(new Slice(LLUtils.toArray(buffer))) == 0;
				if (boundType == IterateBound.LOWER) {
					readOpts.setIterateLowerBound(slice);
				} else {
					readOpts.setIterateUpperBound(slice);
				}
				return new ReleasableSliceImpl(slice, buffer.retain(), nioBuffer);
			} else {
				slice = new Slice(Objects.requireNonNull(LLUtils.toArray(buffer)));
				if (boundType == IterateBound.LOWER) {
					readOpts.setIterateLowerBound(slice);
				} else {
					readOpts.setIterateUpperBound(slice);
				}
				return new ReleasableSliceImpl(slice, null, null);
			}
		} finally {
			buffer.release();
		}
	}

	private static ReleasableSlice emptyReleasableSlice() {
		var arr = new byte[0];

		return new SimpleSliceWithoutRelease(new Slice(arr), null, arr);
	}

	public static record SimpleSliceWithoutRelease(AbstractSlice<?> slice, @Nullable ByteBuf byteBuf,
																								 @Nullable Object additionalData) implements ReleasableSlice {}

	public static record ReleasableSliceImpl(AbstractSlice<?> slice, @Nullable ByteBuf byteBuf,
																					 @Nullable Object additionalData) implements ReleasableSlice {

		@Override
		public void release() {
			slice.clear();
			if (byteBuf != null) {
				byteBuf.release();
			}
		}
	}

	public Mono<Void> clear() {
		return Mono
				.<Void>fromCallable(() -> {
					var readOpts = getReadOptions(null);
					readOpts.setVerifyChecksums(VERIFY_CHECKSUMS_WHEN_NOT_NEEDED);

					// readOpts.setIgnoreRangeDeletions(true);
					readOpts.setFillCache(false);
					readOpts.setReadaheadSize(32 * 1024); // 32KiB
					try (CappedWriteBatch writeBatch = new CappedWriteBatch(db,
							CAPPED_WRITE_BATCH_CAP,
							RESERVED_WRITE_BATCH_SIZE,
							MAX_WRITE_BATCH_SIZE,
							BATCH_WRITE_OPTIONS
					)) {

						byte[] firstDeletedKey = null;
						byte[] lastDeletedKey = null;
						try (RocksIterator iter = db.newIterator(cfh, readOpts)) {
							iter.seekToLast();

							if (iter.isValid()) {
								firstDeletedKey = FIRST_KEY;
								lastDeletedKey = iter.key();
								writeBatch.deleteRange(cfh, FIRST_KEY, iter.key());
								writeBatch.delete(cfh, iter.key());
							}
						}

						writeBatch.writeToDbAndClose();


						// Compact range
						db.suggestCompactRange(cfh);
						if (firstDeletedKey != null && lastDeletedKey != null) {
							db.compactRange(cfh,
									firstDeletedKey,
									lastDeletedKey,
									new CompactRangeOptions()
											.setAllowWriteStall(false)
											.setExclusiveManualCompaction(false)
											.setChangeLevel(false)
							);
						}

						db.flush(new FlushOptions().setWaitForFlush(true).setAllowWriteStall(true), cfh);
						db.flushWal(true);
					}
					return null;
				})
				.onErrorMap(cause -> new IOException("Failed to clear", cause))
				.subscribeOn(dbScheduler);

	}

	@Override
	public Mono<Long> sizeRange(@Nullable LLSnapshot snapshot, LLRange range, boolean fast) {
		try {
			return Mono
					.defer(() -> {
						if (range.isAll()) {
							return Mono
									.fromCallable(() -> fast ? fastSizeAll(snapshot) : exactSizeAll(snapshot))
									.onErrorMap(IOException::new)
									.subscribeOn(dbScheduler);
						} else {
							return Mono
									.fromCallable(() -> {
										var readOpts = resolveSnapshot(snapshot);
										readOpts.setFillCache(false);
										readOpts.setVerifyChecksums(VERIFY_CHECKSUMS_WHEN_NOT_NEEDED);
										ReleasableSlice minBound;
										if (range.hasMin()) {
											minBound = setIterateBound(readOpts, IterateBound.LOWER, range.getMin().retain());
										} else {
											minBound = emptyReleasableSlice();
										}
										try {
											ReleasableSlice maxBound;
											if (range.hasMax()) {
												maxBound = setIterateBound(readOpts, IterateBound.UPPER, range.getMax().retain());
											} else {
												maxBound = emptyReleasableSlice();
											}
											try {
												if (fast) {
													readOpts.setIgnoreRangeDeletions(true);

												}
												try (var rocksIterator = db.newIterator(cfh, readOpts)) {
													if (!LLLocalDictionary.PREFER_SEEK_TO_FIRST && range.hasMin()) {
														rocksIterSeekTo(rocksIterator, range.getMin().retain());
													} else {
														rocksIterator.seekToFirst();
													}
													long i = 0;
													while (rocksIterator.isValid()) {
														rocksIterator.next();
														i++;
													}
													return i;
												}
											} finally {
												maxBound.release();
											}
										} finally {
											minBound.release();
										}
									})
									.onErrorMap(cause -> new IOException("Failed to get size of range "
											+ range.toString(), cause))
									.subscribeOn(dbScheduler);
						}
					})
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	@Override
	public Mono<Entry<ByteBuf, ByteBuf>> getOne(@Nullable LLSnapshot snapshot, LLRange range) {
		try {
			return Mono
					.fromCallable(() -> {
						var readOpts = resolveSnapshot(snapshot);
						ReleasableSlice minBound;
						if (range.hasMin()) {
							minBound = setIterateBound(readOpts, IterateBound.LOWER, range.getMin().retain());
						} else {
							minBound = emptyReleasableSlice();
						}
						try {
							ReleasableSlice maxBound;
							if (range.hasMax()) {
								maxBound = setIterateBound(readOpts, IterateBound.UPPER, range.getMax().retain());
							} else {
								maxBound = emptyReleasableSlice();
							}
							try (var rocksIterator = db.newIterator(cfh, readOpts)) {
								if (!LLLocalDictionary.PREFER_SEEK_TO_FIRST && range.hasMin()) {
									rocksIterSeekTo(rocksIterator, range.getMin().retain());
								} else {
									rocksIterator.seekToFirst();
								}
								if (rocksIterator.isValid()) {
									ByteBuf key = LLUtils.readDirectNioBuffer(alloc, rocksIterator::key);
									try {
										ByteBuf value = LLUtils.readDirectNioBuffer(alloc, rocksIterator::value);
										try {
											return Map.entry(key.retain(), value.retain());
										} finally {
											value.release();
										}
									} finally {
										key.release();
									}
								} else {
									return null;
								}
							} finally {
								maxBound.release();
							}
						} finally {
							minBound.release();
						}
					})
					.subscribeOn(dbScheduler)
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	@Override
	public Mono<ByteBuf> getOneKey(@Nullable LLSnapshot snapshot, LLRange range) {
		try {
			return Mono
					.fromCallable(() -> {
						var readOpts = resolveSnapshot(snapshot);
						ReleasableSlice minBound;
						if (range.hasMin()) {
							minBound = setIterateBound(readOpts, IterateBound.LOWER, range.getMin().retain());
						} else {
							minBound = emptyReleasableSlice();
						}
						try {
							ReleasableSlice maxBound;
							if (range.hasMax()) {
								maxBound = setIterateBound(readOpts, IterateBound.UPPER, range.getMax().retain());
							} else {
								maxBound = emptyReleasableSlice();
							}
							try (var rocksIterator = db.newIterator(cfh, readOpts)) {
								if (!LLLocalDictionary.PREFER_SEEK_TO_FIRST && range.hasMin()) {
									rocksIterSeekTo(rocksIterator, range.getMin().retain());
								} else {
									rocksIterator.seekToFirst();
								}
								ByteBuf key;
								if (rocksIterator.isValid()) {
									key = LLUtils.readDirectNioBuffer(alloc, rocksIterator::key);
									return key;
								} else {
									return null;
								}
							} finally {
								maxBound.release();
							}
						} finally {
							minBound.release();
						}
					})
					.subscribeOn(dbScheduler)
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	private long fastSizeAll(@Nullable LLSnapshot snapshot) {
		var rocksdbSnapshot = resolveSnapshot(snapshot);
		if (USE_CURRENT_FASTSIZE_FOR_OLD_SNAPSHOTS || rocksdbSnapshot.snapshot() == null) {
			try {
				return db.getLongProperty(cfh, "rocksdb.estimate-num-keys");
			} catch (RocksDBException e) {
				e.printStackTrace();
				return 0;
			}
		} else if (PARALLEL_EXACT_SIZE) {
			return exactSizeAll(snapshot);
		} else {
			rocksdbSnapshot.setFillCache(false);
			rocksdbSnapshot.setVerifyChecksums(VERIFY_CHECKSUMS_WHEN_NOT_NEEDED);
			rocksdbSnapshot.setIgnoreRangeDeletions(true);
			long count = 0;
			try (RocksIterator iter = db.newIterator(cfh, rocksdbSnapshot)) {
				iter.seekToFirst();
				// If it's a fast size of a snapshot, count only up to 100'000 elements
				while (iter.isValid() && count < 100_000) {
					count++;
					iter.next();
				}
				return count;
			}
		}
	}

	private long exactSizeAll(@Nullable LLSnapshot snapshot) {
		var readOpts = resolveSnapshot(snapshot);
		readOpts.setFillCache(false);
		readOpts.setReadaheadSize(32 * 1024); // 32KiB
		readOpts.setVerifyChecksums(VERIFY_CHECKSUMS_WHEN_NOT_NEEDED);

		if (PARALLEL_EXACT_SIZE) {
			var commonPool = ForkJoinPool.commonPool();
			var futures = IntStream
					.range(-1, LLUtils.LEXICONOGRAPHIC_ITERATION_SEEKS.length)
					.mapToObj(idx -> Pair.of(idx == -1 ? new byte[0] : LLUtils.LEXICONOGRAPHIC_ITERATION_SEEKS[idx],
							idx + 1 >= LLUtils.LEXICONOGRAPHIC_ITERATION_SEEKS.length ? null
									: LLUtils.LEXICONOGRAPHIC_ITERATION_SEEKS[idx + 1]
					))
					.map(range -> (Callable<Long>) () -> {
						long partialCount = 0;
						var rangeReadOpts = new ReadOptions(readOpts);
						Slice sliceBegin;
						if (range.getKey() != null) {
							sliceBegin = new Slice(range.getKey());
						} else {
							sliceBegin = null;
						}
						Slice sliceEnd;
						if (range.getValue() != null) {
							sliceEnd = new Slice(range.getValue());
						} else {
							sliceEnd = null;
						}
						try {
							if (sliceBegin != null) {
								rangeReadOpts.setIterateLowerBound(sliceBegin);
							}
							if (sliceBegin != null) {
								rangeReadOpts.setIterateUpperBound(sliceEnd);
							}
							try (RocksIterator iter = db.newIterator(cfh, rangeReadOpts)) {
								iter.seekToFirst();
								while (iter.isValid()) {
									partialCount++;
									iter.next();
								}
								return partialCount;
							}
						} finally {
							if (sliceBegin != null) {
								sliceBegin.close();
							}
							if (sliceEnd != null) {
								sliceEnd.close();
							}
						}
					})
					.map(commonPool::submit)
					.collect(Collectors.toList());
			long count = 0;
			for (ForkJoinTask<Long> future : futures) {
				count += future.join();
			}
			return count;
		} else {
			long count = 0;
			try (RocksIterator iter = db.newIterator(cfh, readOpts)) {
				iter.seekToFirst();
				while (iter.isValid()) {
					count++;
					iter.next();
				}
				return count;
			}
		}
	}

	@Override
	public Mono<Entry<ByteBuf, ByteBuf>> removeOne(LLRange range) {
		try {
			return Mono
					.fromCallable(() -> {
						var readOpts = getReadOptions(null);
						ReleasableSlice minBound;
						if (range.hasMin()) {
							minBound = setIterateBound(readOpts, IterateBound.LOWER, range.getMin().retain());
						} else {
							minBound = emptyReleasableSlice();
						}
						try {
							ReleasableSlice maxBound;
							if (range.hasMax()) {
								maxBound = setIterateBound(readOpts, IterateBound.UPPER, range.getMax().retain());
							} else {
								maxBound = emptyReleasableSlice();
							}
							try (RocksIterator rocksIterator = db.newIterator(cfh, readOpts)) {
								if (!LLLocalDictionary.PREFER_SEEK_TO_FIRST && range.hasMin()) {
									rocksIterSeekTo(rocksIterator, range.getMin().retain());
								} else {
									rocksIterator.seekToFirst();
								}
								if (!rocksIterator.isValid()) {
									return null;
								}
								ByteBuf key = LLUtils.readDirectNioBuffer(alloc, rocksIterator::key);
								ByteBuf value = LLUtils.readDirectNioBuffer(alloc, rocksIterator::value);
								dbDelete(cfh, null, key);
								return Map.entry(key, value);
							} finally {
								maxBound.release();
							}
						} finally {
							minBound.release();
						}
					})
					.onErrorMap(cause -> new IOException("Failed to delete " + range.toString(), cause))
					.subscribeOn(dbScheduler)
					.doFirst(range::retain)
					.doAfterTerminate(range::release);
		} finally {
			range.release();
		}
	}

	@NotNull
	public static Tuple3<RocksIterator, ReleasableSlice, ReleasableSlice> getRocksIterator(ReadOptions readOptions,
			LLRange range,
			RocksDB db,
			ColumnFamilyHandle cfh) {
		try {
			ReleasableSlice sliceMin;
			ReleasableSlice sliceMax;
			if (range.hasMin()) {
				sliceMin = setIterateBound(readOptions, IterateBound.LOWER, range.getMin().retain());
			} else {
				sliceMin = emptyReleasableSlice();
			}
			if (range.hasMax()) {
				sliceMax = setIterateBound(readOptions, IterateBound.UPPER, range.getMax().retain());
			} else {
				sliceMax = emptyReleasableSlice();
			}
			var rocksIterator = db.newIterator(cfh, readOptions);
			if (!PREFER_SEEK_TO_FIRST && range.hasMin()) {
				rocksIterSeekTo(rocksIterator, range.getMin().retain());
			} else {
				rocksIterator.seekToFirst();
			}
			return Tuples.of(rocksIterator, sliceMin, sliceMax);
		} finally {
			range.release();
		}
	}
}