Struct DaryHeapI128 

pub struct DaryHeapI128 {
    root: u128,
    blocks: Vec<U128HeapBlock>,
    len: usize,
    backend: SimdBackend,
}

A cache-line-oriented 4-ary max-heap for large full-width 128-bit heaps. BinaryHeap can be faster for small heaps, monotone replacements, and heavily repeated keys.

Fields

root: u128

blocks: Vec<U128HeapBlock>

len: usize

backend: SimdBackend

Implementations

impl DaryHeapI128

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

pub fn push(&mut self, value: i128)

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

pub fn replace(&mut self, value: i128) -> Option<i128>

Unconditionally replaces the greatest value, or inserts into an empty heap.

pub fn clear(&mut self)

pub fn into_sorted_vec(self) -> Vec<i128>

fn empty(capacity: usize, backend: SimdBackend) -> Self

fn build(values: Vec<i128>, backend: SimdBackend) -> Self

fn encode(value: i128) -> u128

fn decode(value: u128) -> i128

fn key(&self, index: usize) -> u128

fn set_key(&mut self, index: usize, value: u128)

fn sift_down_by<F>(&mut self, hole: usize, value: u128, max_index: F)

where F: FnMut(&U128HeapBlock) -> usize,

fn heapify(&mut self)

impl DaryHeapI128

fn sift_down_scalar(&mut self, hole: usize, value: u128)

unsafe fn sift_down_avx2(&mut self, hole: usize, value: u128)

unsafe fn sift_down_avx512(&mut self, hole: usize, value: u128)

fn sift_down(&mut self, hole: usize, value: u128)

fn sift_down_after_pop(&mut self, hole: usize, value: u128)

Trait Implementations

impl Clone for DaryHeapI128

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DaryHeapI128

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

Formats the value using the given formatter.

impl Default for DaryHeapI128

fn default() -> Self

Returns the “default value” for a type.

impl Extend<i128> for DaryHeapI128

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = i128>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: T)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl From<Vec<i128>> for DaryHeapI128

fn from(values: Vec<i128>) -> Self

Converts to this type from the input type.

impl FromIterator<i128> for DaryHeapI128

fn from_iter<I>(iter: I) -> Self

where I: IntoIterator<Item = i128>,

Creates a value from an iterator.