Struct RadixHeapU32 

pub struct RadixHeapU32<T> {
    buckets: [Vec<(u32, T)>; 33],
    last: u32,
    len: usize,
}

A min-priority queue whose removed keys are monotonically nondecreasing.

Values with equal keys have no specified removal order.

Fields

buckets: [Vec<(u32, T)>; 33]

last: u32

len: usize

Implementations

impl<T> RadixHeapU32<T>

pub fn new() -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn push(&mut self, key: u32, value: T)

Inserts a value whose key is not less than the key most recently removed.

Panics

Panics if key is less than the key most recently removed.

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

pub fn clear(&mut self)

fn bucket_index(key: u32, last: u32) -> usize

Trait Implementations

impl<T: Clone> Clone for RadixHeapU32<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for RadixHeapU32<T>

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

Formats the value using the given formatter.

impl<T> Default for RadixHeapU32<T>

fn default() -> Self

Returns the “default value” for a type.