Struct buddy_system_allocator::linked_list::LinkedList

pub struct LinkedList { /* fields omitted */ }

An intrusive linked list

A clean room implementation of the one used in CS140e 2018 Winter

Thanks Sergio Benitez for his excellent work, See CS140e for more information

Methods

impl LinkedList

pub const fn new() -> LinkedList

Create a new LinkedList

pub fn is_empty(&self) -> bool

Return true if the list is empty

pub unsafe fn push(&mut self, item: *mut usize)

Push item to the front of the list

pub fn pop(&mut self) -> Option<*mut usize>

Try to remove the first item in the list

Important traits for Iter<'a>

impl<'a> Iterator for Iter<'a> type Item = *mut usize;

pub fn iter(&self) -> Iter

Return an iterator over the items in the list

Important traits for IterMut<'a>

impl<'a> Iterator for IterMut<'a> type Item = ListNode;

pub fn iter_mut(&mut self) -> IterMut

Return an mutable iterator over the items in the list

Trait Implementations

impl Clone for LinkedList

fn clone(&self) -> LinkedList

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LinkedList

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Send for LinkedList

impl Copy for LinkedList