Struct PooledLinkedList 

pub struct PooledLinkedList { /* private fields */ }

Pooled linked list - uses nodes from global pool

This maintains only the list structure (head/tail/len), while all nodes are allocated from the global pool.

Implementations

impl PooledLinkedList

pub const fn new() -> Self

Create a new empty pooled linked list

pub fn insert_sorted( &mut self, pool: &mut GlobalNodePool, data: BuddyBlock, ) -> bool

Insert element in sorted order (ascending by address) This is used for buddy free lists to enable efficient contiguity checking

pub fn has_block_in_range( &self, pool: &GlobalNodePool, start: usize, end: usize, ) -> bool

Check if any block in the list falls within the given address range [start, end)

pub fn pop_front(&mut self, pool: &mut GlobalNodePool) -> Option<BuddyBlock>

Pop an element from the front of the list

pub fn is_empty(&self) -> bool

Check if the list is empty

pub fn len(&self) -> usize

Get the length of the list

pub fn find_by_addr( &self, pool: &GlobalNodePool, addr: usize, ) -> Option<(usize, Option<usize>)>

Find a node by address (for buddy system)

Returns (node_idx, prev_idx) where prev_idx is the node before it (or None if head)

pub fn remove(&mut self, pool: &mut GlobalNodePool, node_idx: usize) -> bool

Remove a node at the given index

pub fn remove_with_prev( &mut self, pool: &mut GlobalNodePool, node_idx: usize, prev_idx: Option<usize>, ) -> bool

Remove a node using known prev_idx (O(1) operation)

This is used when we already know the previous node index from find_by_addr(), avoiding a second traversal of the list.

pub fn iter<'a>(&'a self, pool: &'a GlobalNodePool) -> PooledListIter<'a>

Get iterator over elements

pub fn clear(&mut self, pool: &mut GlobalNodePool)

Clear all nodes from the list

Returns all nodes to the global pool

Trait Implementations

impl Default for PooledLinkedList

fn default() -> Self

Returns the “default value” for a type.