Struct PriorityQueue

pub struct PriorityQueue<T: MoveType> {
    pub entries: MoveVec<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 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: MoveVec<Entry<T>>

Implementations

impl<T: MoveType> PriorityQueue<T>

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

Constructs a new PriorityQueue.

impl<T: MoveType> PriorityQueue<T>

pub fn move_instance(self, t: <T as MoveType>::TypeTag) -> MoveInstance<Self>

pub fn type_(t: <T as MoveType>::TypeTag) -> PriorityQueueTypeTag<T>

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

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

Formats the value using the given formatter.

impl<T: Hash + MoveType> 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> MoveStruct for PriorityQueue<T>

type StructTag = PriorityQueueTypeTag<T>

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

type TypeTag = PriorityQueueTypeTag<T>

fn from_bcs(bytes: &[u8]) -> Result<Self, Error>

Deserialize the contents of the Move type from BCS bytes.

fn into_bcs(self) -> Result<Vec<u8>, Error>

Consuming version of to_bcs.

fn to_bcs(&self) -> Result<Vec<u8>, Error>

Serialize the contents of the Move type to BCS bytes.

fn into_json(self) -> Value

Consuming version of to_json.

fn to_json(&self) -> Value

Serialize the contents of the Move type to JSON.

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

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T> Serialize for PriorityQueue<T>

where T: Serialize + MoveType,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

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

fn address() -> Address

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

fn module() -> Identifier

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

fn name() -> Identifier

impl<T: MoveType + StaticTypeTag> StaticTypeParams for PriorityQueue<T>

fn type_params() -> Vec<TypeTag>

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

const LENGTH: usize = 1usize

A length of fields and headers, which must be the same.

fn fields(&self) -> Vec<Cow<'_, str>>

Fields method must return a list of cells.

fn headers() -> Vec<Cow<'static, str>>

Headers must return a list of column names.

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

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