Creates a new ring buffer channel with a specified size and initial value. # Arguments `size` - Number of items to pre-allocate in the channel `t` -

Inserts a cache position for a given key. # Arguments `cache_key` - The key to associate with the position `cache_pos` - The position value to store

Retrieves the element at the specified index. # Arguments `idx` - The index of the element to retrieve. # Returns The element at the specified ind

Returns an iterator over the list's elements. # Returns An iterator that yields pairs of (index, value) for each element.

Insert a value with the given ID. If the slot is occupied by a different ID, the array will be resized. # Note Write operations should be externall

Append a new element and updates 'offsets_idx' When 'offsets_idx' changes, fill a offset of 'elements' into 'offsets'

Computes the hash for a key, excluding null and sentry entries.

Removes all elements from the list. After calling this method, the list will be empty but retain its current storage mode (Array or Vector).

Reconstructs the full array from the diff representation. This method expands the compressed diff format back into a full array containing all elemen

Adds an operation without an old value. # Arguments `op_type` - Type of operation (create, read, write, delete) `shard_id` - ID of the shard this op

Returns the total length of the serialized entry.

Maps a byte value to a shard ID. This function distributes keys across shards by mapping the first byte of a key to a shard ID. The mapping ensures a

Returns the serial number of this entry.

Removes the integer `value` from the set. # Arguments `value` - The integer to remove from the set. # Returns `true` if the integer was present in

Sorts operations by shard ID, key hash, and operation type. This method also updates the shard start indices and operation counts.

Returns whether this `HPFile` is empty.

Submits a read request and waits for completion (async version for tokio tasks). # Returns - `Ok(0)`: Error (I/O failure or insufficient bytes for he

Writes a batch of operations (corresponding to one transaction). # Important - Each key should appear at most once in the batch (later inserts overw

Checks if the list contains a specific element. # Arguments `elem` - The element to search for. # Returns `true` if the element is found in the li

Calculates the shard index and key for a given twig ID This function is used for sharding twig data across multiple storage locations to improve conc

Serializes an entry to bytes for testing purposes. This is a convenience function that combines entry serialization with buffer management for testin

Gets a slice of bytes for a specific page (for hashing) # Arguments `page_num` - The page number to get `page_size` - The size of each page in bytes

Read data from file at `offset` to fill `bz` # Parameters - `offset`: the start position of a byteslice that was written before # Returns A `Resul

Serializes this entry into the provided buffer. # Arguments `b` - The buffer to write the serialized entry to. `deactived_sn_list` - List of deactiv

Returns a reference to the key bytes of this entry.

Returns a reference to the next key hash bytes.

Append a byteslice to the file. This byteslice may be temporarily held in `buffer` before flushing. # Parameters - `bz`: the byteslice to append. It

Sets a bit to active (1) at the specified offset # Arguments `offset` - The bit position to set (0-2047) # Panics Panics if offset is greater than L

Synchronizes the Merkle tree for the youngest twig # Arguments `recover_mode` - Whether to run in recovery mode

Fills a buffer with the provided bytes and returns its position. This method handles buffer allocation and management automatically, creating new buf

Calculates the total serialized length of this entry. # Arguments `deactived_sn_count` - Number of deactivated serial numbers to include. # Returns

Creates a new test entry.

Creates a new Updater instance for testing. # Arguments `prefix` - Prefix for temporary directory name # Returns A tuple containing: - Temporary dir

Appends a new element to the list if it's not already present. If the list is in array mode and adding the element would exceed the array capacity (2

16b-idx, 64b-k, 48b-v

Advances the LFSR by one step and returns the new state. This method: 1. Checks if the lowest bit is set 2. If set, XORs the state with the tap posit

Returns the node index at this level

Remove a value from the slot.

Synchronizes a level 1 (level 8 if seeing the tree from the left) node in the active bits Merkle tree # Arguments `pos` - Position of the node to syn

Adds a task to be processed. # Arguments `task_id` - ID of the task to add

Verifies the consistency of a Merkle tree within a twig This function checks that each parent node correctly hashes its children throughout the tree,