Struct PartitionedWrite 

pub struct PartitionedWrite<'a, V> { /* private fields */ }

Write operations for partitioned tables.

Provides read-write access to partitioned data with the ability to modify values.

Implementations

impl<'a, V> PartitionedWrite<'a, V>

pub fn new( table: &'a PartitionedTable<V>, txn: &'a mut WriteTransaction, ) -> Self

Creates a new write handle.

pub fn read_segment_data( &self, segment_info: &SegmentInfo, ) -> Result<Option<(SegmentInfo, Vec<u8>)>>

Reads segment data for the given segment info.

If segment_info already contains data, it’s returned directly. Otherwise, the data is read from the database.

Arguments

• segment_info - Information about the segment to read

Returns

Option containing (segment_info, segment_data) or None if segment doesn’t exist

pub fn table(&self) -> &PartitionedTable<V>

Gets the table reference.

pub fn find_head_segment_scan( &self, base_key: &[u8], shard: u16, ) -> Result<Option<u16>>

Finds the head segment using scan method (when meta table is disabled).

This method scans all segments for the given (base_key, shard) pair and returns the one with the highest segment ID.

Arguments

• base_key - The base key to search for
• shard - The shard ID

Returns

The head segment ID, or None if no segments exist

pub fn write_segment_data(&self, segment_key: &[u8], data: &[u8]) -> Result<()>

Writes data to a specific segment.

This method overwrites any existing data at the segment key.

Arguments

• segment_key - The encoded segment key
• data - The data to write

Returns

Ok on success, error on failure

pub fn create_new_segment( &self, base_key: &[u8], shard: u16, segment_id: u16, data: &[u8], ) -> Result<()>

Creates a new segment with the given data.

The segment_id should be the next available ID for this shard.

Arguments

• base_key - The base key
• shard - The shard ID
• segment_id - The segment ID
• data - The segment data

Returns

Ok on success, error on failure

pub fn update_head_segment( &self, base_key: &[u8], shard: u16, data: &[u8], ) -> Result<(bool, u16)>

Updates the head segment with new data, rolling if necessary.

This method checks if the new data fits in the current head segment. If it doesn’t fit, a new segment is created.

Arguments

• base_key - The base key
• shard - The shard ID
• data - The new segment data

Returns

Tuple of (was_rolled, new_segment_id) where:

• was_rolled: true if a new segment was created
• new_segment_id: ID of the segment that now contains the data