Struct DefragPlanner 

pub struct DefragPlanner { /* private fields */ }

Defragmentation planner: computes move operations to compact a pool.

The planner operates on logical block metadata only; it does not own any memory itself. Callers register their current allocation layout, then call plan_compaction() to receive a move list.

Implementations

impl DefragPlanner

pub fn new(total_capacity: usize) -> Self

Create a new planner for a pool of total_capacity bytes.

pub fn record_alloc(&mut self, offset: usize, size: usize)

Record an allocated block at offset with the given size.

pub fn record_free(&mut self, offset: usize, size: usize)

Record a free block at offset with the given size.

pub fn fragmentation_ratio(&self) -> f64

Compute the fragmentation ratio.

Returns (total_free - largest_contiguous_free) / total_free. Returns 0.0 when there are no free blocks.

pub fn plan_compaction(&self) -> Vec<(usize, usize, usize)>

Plan defragmentation: returns (from_offset, to_offset, size) moves that compact all allocations toward offset 0.

The returned moves are in application order; later moves may depend on earlier ones, so apply them in sequence.

pub fn execute_compaction(&self, buffer: &mut Vec<u8>) -> DefragStats

Execute the compaction plan on a flat byte buffer in place.

Returns statistics describing what was done. The buffer must be exactly total_capacity bytes long.

pub fn coalesce_free_blocks(&mut self) -> usize

Merge adjacent free blocks (coalescing).

Returns the number of merges performed.

pub fn total_capacity(&self) -> usize

Total capacity of the pool.

pub fn allocated_block_count(&self) -> usize

Number of currently tracked allocated blocks.

pub fn free_block_count(&self) -> usize

Number of currently tracked free blocks.

pub fn allocated_bytes(&self) -> usize

Total bytes in allocated blocks.