priority_queue

priority_queue

Declarations

Rebuilt from the module interface. No verified source is published, and function bodies are only available as bytecode.

module priority_queue;

struct Entry<T0: drop> has drop, store {

priority: u64,

value: T0,

}

struct PriorityQueue<T0: drop> has drop, store {

entries: vector<Entry<T0>>,

}

public fun create_entries<T0: drop>(vector<u64>, vector<T0>): vector<Entry<T0>>

public fun insert<T0: drop>(&mut PriorityQueue<T0>,u64,T0)

fun max_heapify_recursive<T0: drop>(&mut vector<Entry<T0>>,u64,u64)

public fun new<T0: drop>(vector<Entry<T0>>): PriorityQueue<T0>

public fun new_entry<T0: drop>(u64, T0): Entry<T0>

public fun pop_max<T0: drop>(&mut PriorityQueue<T0>): (u64, T0)

public fun priorities<T0: drop>(&PriorityQueue<T0>): vector<u64>

fun restore_heap_recursive<T0: drop>(&mut vector<Entry<T0>>,u64)