Priority queue: Difference between revisions
Content deleted Content added
m →{{header|PureBasic}}: {{out}} |
|||
Line 3,137:
</pre>
=={{header|PureBasic}}==
The priority queue is implemented using a binary heap array and a map.
The map stores the elements of a given priority in a FIFO list.
Priorities can be any signed 32 value.
<lang purebasic>Structure taskList
List description.s() ;implements FIFO queue
Line 3,257 ⟶ 3,259:
CloseConsole()
EndIf</lang>
{{out}}
<pre>Solve RC tasks
Tax return
| |||