Priority Queue

struct RankedQueue{T <: Real, S <: Any}
    rank :: Array{T, 1}
    data :: Array{S, 1}
end

Maintains a priority queue of data. Each datum has a rank that determines it's priority in the queue. rank and data are sorted in ascending order.

insert!(q::RankedQueue{T}, data::S, rank::T) where {T <: Real, S <: Any}

Push a new element data with priority rank onto the ranked queue q. Rotates the queue until priority is sorted in ascending order.

take!(q::RankedQueue)

Pop off the element with element with lowest rank/highest priority.

left(i)

Return the index of the left child of node i.

parent(i)

Return the index of the parent of node i.

right(i)

Return the index of the right child of node i.

rotatedown!(q::RankedQueue, i)

Modify the ranked queue by pushing down the node at index i until the priority is sorted.

rotatedown!(q::RankedQueue)

Modify the ranked queue by pushing down the root until the priority is sorted.

rotateup!(q::RankedQueue, i)

Modify the ranked queue by pushing up the node at index i until the priority is sorted again.

rotateup!(q::RankedQueue)

Modify the ranked queue by pushing up the last element until the priority is sorted.

update!(q::RankedQueue{T, S}, data::S, new::T) where {T <: Real, S <: Any}

Change the priority of element data to rank new. Will panic if data is not contained in queue q.