Struct algorithms_rs::heap_sort::Heap

pub struct Heap<T> { /* private fields */ }

Heap

Implementations

impl<T: Clone + PartialOrd + Default + Display + Debug> Heap<T>

pub fn from_vector(array: &[T]) -> Self

create a heap from vector

pub fn len(&self) -> usize

the present heap size

pub fn is_empty(&self) -> bool

the heap is empty

pub fn max_heapify(&mut self, index: usize)

max heap heapify

pub fn min_heapify(&mut self, index: usize)

the min heap heapify

pub fn min_sift_up(&mut self, index: usize)

the min heap siftup

pub fn max_sift_up(&mut self, index: usize)

the max heap siftup

pub fn min_sift_down(&mut self, heap_len: usize)

the min shift down

pub fn max_sift_down(&mut self, heap_len: usize)

the max sift down

pub fn build_max_heap_by_max_heapify(&mut self)

build Max Heap

pub fn build_max_heap_by_shift_up(&mut self)

build Max Heap by max shift up

pub fn build_min_heap_by_min_heapify(&mut self)

build Min Heap

pub fn build_min_heap_by_siftup(&mut self)

buikd Min heap by min shift up

pub fn heap_sort_by_max_heap(&mut self)

asc sort by Max Heap

pub fn heap_sort_by_min_heap(&mut self)

dec sort by Min Heap

pub fn dec_sort_with_min_sift(&mut self)

dec sort by Min Heap

pub fn asc_sort_with_max_sift(&mut self)

asc sort by Max Heap

Trait Implementations

impl<T: Debug> Debug for Heap<T>

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

Formats the value using the given formatter.