Struct algorithms_rs::heap_sort::Heap

source · [−]

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

Expand description

Heap

Implementations

source

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

source

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

create a heap from vector

source

pub fn len(&self) -> usize

the present heap size

source

pub fn is_empty(&self) -> bool

source

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

max heap heapify

source

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

the min heap heapify

source

pub fn build_max_heap(&mut self)

build Max Heap

source

pub fn build_min_heap(&mut self)

build Min Heap

source

pub fn heap_sort(&mut self)

asc sort by Max Heap

source

pub fn heap_sort_by_min_heap(&mut self)

dec sort by Min Heap

Trait Implementations

source

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

source

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

Formats the value using the given formatter. Read more

Auto Trait Implementations

impl<T> RefUnwindSafe for Heap<T> where
T: RefUnwindSafe,

impl<T> Send for Heap<T> where
T: Send,

impl<T> Sync for Heap<T> where
T: Sync,

impl<T> Unpin for Heap<T> where
T: Unpin,

impl<T> UnwindSafe for Heap<T> where
T: UnwindSafe,

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct algorithms_rs::heap_sort::Heap

Implementations

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

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

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

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

pub fn build_max_heap(&mut self)

pub fn build_min_heap(&mut self)

pub fn heap_sort(&mut self)

pub fn heap_sort_by_min_heap(&mut self)

Trait Implementations

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

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

Auto Trait Implementations

impl<T> RefUnwindSafe for Heap<T> where
T: RefUnwindSafe,

impl<T> Send for Heap<T> where
T: Send,

impl<T> Sync for Heap<T> where
T: Sync,

impl<T> Unpin for Heap<T> where
T: Unpin,

impl<T> UnwindSafe for Heap<T> where
T: UnwindSafe,

Blanket Implementations

impl<T> Any for T where
T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where
T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where
T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where
U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for T where
U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Struct algorithms_rs::heap_sort::Heap

Implementations

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

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

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

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

pub fn build_max_heap(&mut self)

pub fn build_min_heap(&mut self)

pub fn heap_sort(&mut self)

pub fn heap_sort_by_min_heap(&mut self)

Trait Implementations

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

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

Auto Trait Implementations

impl<T> RefUnwindSafe for Heap<T> where T: RefUnwindSafe,

impl<T> Send for Heap<T> where T: Send,

impl<T> Sync for Heap<T> where T: Sync,

impl<T> Unpin for Heap<T> where T: Unpin,

impl<T> UnwindSafe for Heap<T> where T: UnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<T> RefUnwindSafe for Heap<T> where
T: RefUnwindSafe,

impl<T> Send for Heap<T> where
T: Send,

impl<T> Sync for Heap<T> where
T: Sync,

impl<T> Unpin for Heap<T> where
T: Unpin,

impl<T> UnwindSafe for Heap<T> where
T: UnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,