Struct SliceHeap 

pub struct SliceHeap<'a, T: Ord + Copy> { /* private fields */ }

A fixed-size heap data structure that operates in place on non-empty mutable slices.

The heap size never changes after creation, and only supports updating the maximum element.

Implementations

impl<'a, T: Ord + Copy> SliceHeap<'a, T>

pub fn new(data: &'a mut [T]) -> Result<Self, EmptySlice>

Creates a new SliceHeap from a mutable slice. The slice is assumed to be unordered initially and will be heapified.

Errors

Returns EmptySlice if the input slice is empty.

pub fn new_unchecked(data: &'a mut [T]) -> Result<Self, EmptySlice>

Creates a new SliceHeap from a mutable slice without heapifying. Use this if you know the slice is already in heap order.

Errors

Returns EmptySlice if the input slice is empty.

pub fn len(&self) -> usize

Returns the number of elements in the heap.

pub fn is_empty(&self) -> bool

Always returns false as the heap can never be empty

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

Returns a reference to the greatest element in the heap, or None if empty.

pub fn update_root<F>(&mut self, update_fn: F)

where F: FnOnce(&mut T),

Updates the root element in place and restores the heap property. This allows direct mutation of the maximum element.

Since the heap cannot be empty (enforced by construction), this operation always succeeds.

pub fn heapify(&mut self)

Converts the entire slice into a heap.

pub fn as_slice(&self) -> &[T]

Returns a slice of all heap elements in heap order (not sorted order).