Using a priority queue to sort [edit]
A priority queue is unbounded, but has an internal capacity governing the size of an array used to store the elements on the queue.
一个优先队列是极大的,但是拥有一个内部的容量调节数组的大小用来存储在队列中的元素。
A real - world example of a priority queue is the line to check luggage at an airport.
cFosSpeed traffic shaping consists of two major parts: first, find out the maximum line speeds (send resp. receive) and then, send out data with no more than the sending speed and use a priority queue for the rest of the data.
高级Traffic Shaping cFosSpeed Traffic Shaping由两个主要部分组成: 一, 找出宽带最大链接速度 (上传/下载 ) , 然后, 不再过量上传数据而是对数据剩余部分使用一个优先级队列.
The Priority queue is an extreme life saver.
Get Priority Queue access for faster response and resolution, and Critical Situation Management for your highest severity cases.
获取优先排队访问权限,以便更快地响应和解决问题,并针对最严重的案例进行紧急情况管理。
In the algorithm, the priority queue concept and the rip-up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance.
该算法采用优先队列同拆线重布策略相结合的方法,控制由互连线耦合电容引起的串扰噪声。
The root node is inserted into the priority queue. Until the queue is empty or the desired number of results have been returned the search continues by processing the nearest entry in the queue.
先把根节点加入优先队列 ,然后查询优先队列中离查询的矩形或者点最近的项,直到优先队列被清空或者已经得到要求的邻居数。
A priority queue is a container adaptor that provides constant time lookup of the largest (by default) element, at the expense of logarithmic insertion and extraction.
优先队列是一个容器,允许以对数时间插入的代价,进行常数时间的最大值(或最小值,取决于Compare )访问。
Scan All Code Changes(normal priority queue)
扫描所有代码更改(正常的优先队列)
Original: Priority queue is a container that allows for constant time maximum (or minimum, depending on Compare) extraction at the expense of logarithmic insertion.
优先队列是一个容器,允许以对数时间插入的代价,进行常数时间的最大值(或最小值,取决于Compare )访问。
  Priority Queue with direct access to Priority Support Engineers for faster issue resolution.
优先排队 ,直接获得 Priority 支持工程师的协助,以更快的速度解决问题。
The priority queue was empty.