Struct scratchstack_wrapper_aws_c_common::aws_priority_queue

#[repr(C)]
pub struct aws_priority_queue {
    pub pred: aws_priority_queue_compare_fn,
    pub container: aws_array_list,
    pub backpointers: aws_array_list,
}

Fields

pred: aws_priority_queue_compare_fn

predicate that determines the priority of the elements in the queue.

container: aws_array_list

The underlying container storing the queue elements.

backpointers: aws_array_list

An array of pointers to backpointer elements. This array is initialized when the first call to aws_priority_queue_push_bp is made, and is subsequently maintained through any heap node manipulations.

Each element is a struct aws_priority_queue_node *, pointing to a backpointer field owned by the calling code, or a NULL. The backpointer field is continually updated with information needed to locate and remove a specific node later on.

Trait Implementations

impl Clone for aws_priority_queue

fn clone(&self) -> aws_priority_queue

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for aws_priority_queue

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

Formats the value using the given formatter.

impl Default for aws_priority_queue

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq<aws_priority_queue> for aws_priority_queue

fn eq(&self, other: &aws_priority_queue) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for aws_priority_queue

impl Eq for aws_priority_queue

impl StructuralEq for aws_priority_queue

impl StructuralPartialEq for aws_priority_queue