Struct PriorityQueue 

pub struct PriorityQueue<T> {
    pub entries: Vec<Entry<T>>,
}

Struct representing a priority queue. The entries vector represents a max heap structure, where entries[0] is the root, entries[1] and entries[2] are the left child and right child of the root, etc. More generally, the children of entries[i] are at i * 2 + 1 and i * 2 + 2. The max heap should have the invariant that the parent node’s priority is always higher than its child nodes’ priorities.

Fields

entries: Vec<Entry<T>>

Implementations

impl<T: MoveType> PriorityQueue<T>

pub const fn type_tag(type_t: T::TypeTag) -> PriorityQueueTypeTag<T::TypeTag>

Create this type’s specialized type tag.

impl<T> PriorityQueue<T>

pub const fn new(entries: Vec<Entry<T>>) -> Self

Trait Implementations

impl<T: Clone> Clone for PriorityQueue<T>

fn clone(&self) -> PriorityQueue<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: ConstTypeTag> ConstStructTag for PriorityQueue<T>

const STRUCT_TAG: PriorityQueueTypeTag<T::TypeTag>

impl<T: Debug> Debug for PriorityQueue<T>

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for PriorityQueue<T>

where T: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Eq> Eq for PriorityQueue<T>

impl<T: Hash> Hash for PriorityQueue<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: MoveType> MoveDatatype for PriorityQueue<T>

type StructTag = PriorityQueueTypeTag<<T as MoveType>::TypeTag>

impl<T: MoveType> MoveType for PriorityQueue<T>

type TypeTag = PriorityQueueTypeTag<<T as MoveType>::TypeTag>

impl<T: PartialEq> PartialEq for PriorityQueue<T>

fn eq(&self, other: &PriorityQueue<T>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<T> Serialize for PriorityQueue<T>

where T: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: PartialEq> StructuralPartialEq for PriorityQueue<T>