21. However, any creditor who had contracted for a security interest would be first in the priority queue . 22. Edits populate a series of inter-linked priority queues , where the vandalism scores are the priority. 23. A standard approach here is to check if a node about to be added already appears in the priority queue . 24. To make the sampling of reactions more efficient, an indexed priority queue is used to store the reaction times. 25. This makes the min-max heap a very useful data structure to implement a double-ended priority queue . 26. Edits populate a series of inter-linked priority queues , where the vandalism scores are the priority for insertion. 27. A calendar queue ( CQ ) is a priority queue ( queue in which every element has associated priority ). 28. This operation and its " O " ( 1 ) performance is crucial to many applications of priority queues . 29. The algorithm uses two priority queues , one for triangles that can be split and another for triangles that can be merged. 30. Several general-purpose priority queue algorithms have proven effective for discrete-event simulation, most notably, the splay tree.
