Stop metering and log the result.

Compares a serialized entry with an entry struct for equality. This function is useful for testing and validation purposes. # Arguments `bz` - The

Returns reference to entry files.

Internal comparison implementation. If `compare_old_value` is true, compares old_value fields. If `compare_old_value` is false, requires other's old_v

Fills the compaction channel with active entries that need to be rewritten. This method implements the core compaction logic: 1. Monitors entry count

Generate key-value pair for a given number

Fill the 'start', 'end', 'lead_byte', 'next_idx' and 'valid' fields of Range.

Finalize the hash and write any number of output bytes.

Flushes buffered data and updates the Merkle tree. This method implements the core shard flushing logic: 1. Buffer Processing: - Reads buffered entri

Internal flush with EOF padding option. When `eof=true`, padding bytes are added to align the file size to 512 bytes. This is only used internally du

Generate a hover block with random key selection - `op_type`: OP_DELETE, OP_CREATE, OP_WRITE, or OP_READ - `base`: Base offset for key numbers - `ran

Generate a hover block with sequential stride pattern - `op_type`: OP_DELETE, OP_CREATE, OP_WRITE, or OP_READ - `base`: Base offset for key numbers -

Generate a subblock containing `count` tasks.

Gets the value at the specified index in the logical array. This method uses binary search to efficiently find the most recent change point before or

Checks if a specific entry is active # Arguments `sn` - Serial number of the entry to check # Returns true if the entry is active, false otherwise

Gets the active status of a bit at the specified offset # Arguments `offset` - The bit position to check (0-2047) # Returns true if the bit is activ

Gets a buffer from the pool, or allocates a new one if pool is empty. This is more efficient than `alloc_buffer()` for high-frequency reads because i

Gets the position of the first entry in a twig For twig_id > 0, this is the end position of the last entry in the previous twig. # Arguments `twig_i

Gets the root hash of a twig # Arguments `twig_id` - ID of the twig `buf` - Buffer to store the root hash

Gets hash values for a list of positions in the tree # Arguments `pos_list` - List of (level, position) pairs to get hashes for # Returns List of ha

Generates the left (entry) side of a proof path using a hash function # Arguments `sn` - Serial number of the entry `get_hash` - Function that return

get the previous entry from the previous KH2E record

Gets the total number of sub-jobs. # Returns Number of sub-jobs in this job

Gets the twig file size for a shard. # Arguments `shard_id` - ID of the shard # Returns The current twig file size # Performance - Direct access -

Returns the starting position and length of the value in the serialized data. # Returns A tuple of (start_position, value_length).

Gets the youngest twig ID for a shard. # Arguments `shard_id` - ID of the shard # Returns The ID of the most recently created twig # Performance -

Checks if there are free buffers available. # Returns `true` if there are free buffers, `false` otherwise

Inserts extra data at a specific block height. # Arguments `height` - Block height to insert at `data` - Extra data to insert

Checks if the list is empty. # Returns `true` if the list contains no elements, `false` otherwise.

Returns whether the entry is empty.

Looks up an entry in a position list that satisfies the given predicate. # Arguments `pos_list` - Iterator of positions to search through `read_entry

Calculate ops per block for hover operations

Sends an item to the consumer. # Arguments `t` - Item to send # Returns Ok(()) if successful, or SendError if the channel is disconnected

Prunes the head of the twig file # Arguments `off` - Offset to prune from # Panics If the prune operation fails

Puts an entry in the cache. # Arguments `updater` - Updater instance `file_pos` - Position in the file `entry` - Entry to cache `dsn_list` - List of

Submits a read request and blocks until completion (sync version for regular threads). # Returns - `Ok(0)`: Error (I/O failure or insufficient bytes

Receives a returned item from the consumer. # Returns Ok(T) if an item was received, or RecvError if the channel is disconnected

Recycles a job object after completion. # Arguments `job` - Job to recycle `bz` - Buffer containing entry data

Reinitializes this sub-job with new values. # Arguments `sub_id` - New sub-job ID `shard_id` - New shard ID `file_pos` - New file position

Runs a task job for prefetching. # Arguments `task_id` - ID of the task to process

Returns an item back to the producer. # Arguments `t` - Item to return # Panics If the channel is disconnected

Sets the current block height. # Arguments `h` - New block height # State Changes - Updates current height - Triggers pruning checks - Updates histo

Sets the edge nodes for a shard's Merkle tree. # Arguments `shard_id` - ID of the shard `bz` - Edge node bytes to store # State Changes - Updates ed