Struct BinaryHeap

pub struct BinaryHeap<T, const N: usize> { /* private fields */ }

An array-based binary heap, with N elements stored inline.

Implementations

impl<T: Clone + Copy + Ord, const N: usize> BinaryHeap<T, N>

pub const fn new() -> Self

Create a new empty binary heap.

pub fn push(&mut self, value: T) -> Result<(), KernelError>

Push a value onto the binary heap.

value - The value to push onto the binary heap.

Returns Ok(()) if the value was pushed onto the binary heap, or an error if the heap cannot be extended (e.g. OOM).

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

Pop the smallest value from the binary heap.

Returns the smallest value in the binary heap, or None if the heap is empty.

pub fn is_empty(&self) -> bool

Check if the binary heap is empty.

Returns true if the binary heap is empty, false otherwise.

pub fn peek(&self) -> Option<&T>

Peek at the smallest value in the binary heap.

Returns the smallest value in the binary heap, or None if the heap is empty.

pub fn len(&self) -> usize

Get the number of elements in the binary heap.