Struct BoundedBinaryHeap

Source
pub struct BoundedBinaryHeap<T> { /* private fields */ }
Expand description

Binary heap with bound

Implementations§

Source§

impl<T: PartialOrd + Clone> BoundedBinaryHeap<T>

Source

pub fn new(capacity: usize) -> BoundedBinaryHeap<T>

Constructor, create a new BoundedBinaryHeap with capacity

extern crate rust_heap;
use rust_heap::heap::BoundedBinaryHeap;
let h:BoundedBinaryHeap<i32> = BoundedBinaryHeap::new(3);
assert_eq!(h.capacity(), 3);
assert_eq!(h.len(), 0);
assert!(h.is_empty());
Source

pub fn from(slice: &[T]) -> BoundedBinaryHeap<T>

Constructor, create a new BoundedBinaryHeap from the content of a slice

extern crate rust_heap;
use rust_heap::heap::BoundedBinaryHeap;
let h = BoundedBinaryHeap::from(&[1,2,3,4,5]);
assert_eq!(h.capacity(), 5);
assert_eq!(h.len(), 5);
Source

pub fn from_slice_with_capacity( slice: &[T], capacity: usize, ) -> BoundedBinaryHeap<T>

Constructor, create a new BoundedBinaryHeap from the content of a slice with given capacity

extern crate rust_heap;
use rust_heap::heap::BoundedBinaryHeap;
let h = BoundedBinaryHeap::from_slice_with_capacity(&[1,2,3], 5);
assert_eq!(h.capacity(), 5);
assert_eq!(h.len(), 3);
Source

pub fn push(&mut self, elem: T) -> Option<T>

Push a value into heap if value>=root and keep heap structure Overflow and return the smallest element when heap is full

extern crate rust_heap;
use rust_heap::heap::BoundedBinaryHeap;
let mut h = BoundedBinaryHeap::from(&[1,2,3]);
assert_eq!(h.push(4).unwrap(), 1);
assert_eq!(h.len(), 3);
Source

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

Pop the smallest value from heap

extern crate rust_heap;
use rust_heap::heap::BoundedBinaryHeap;
let mut h = BoundedBinaryHeap::from(&[3,2,1]);
assert_eq!(h.pop().unwrap(), 1);
Source

pub fn len(&self) -> usize

Return the number of elements in the heap

Source

pub fn is_empty(&self) -> bool

Return true if the heap is empty

Source

pub fn capacity(&self) -> usize

Return the number of elements the heap can store

Source

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

Return the smallest element or None if the heap is empty

Auto Trait Implementations§

§

impl<T> Freeze for BoundedBinaryHeap<T>

§

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

§

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

§

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

§

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

§

impl<T> UnwindSafe for BoundedBinaryHeap<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,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

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

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<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

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

Source§

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

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.