What is the translation of " A PRIORITY QUEUE " in Chinese?

• 优先队列

Examples of using A priority queue in English and their translations into Chinese

What is a priority queue?
什么是优先级队列？?

This data structure is called a priority queue.
这种数据结构叫做优先队列。

We can use a priority queue to sort.
我们完全可以用一个优先队列。

We can easily do that with a priority queue.
我们完全可以用一个优先队列。

A priority queue has operations add and remove.
优先级队列具有添加和移除操作。

So that's building a priority queue.
这样构建一个递增的优先队列。

Writing a priority queue in C(part 3).
PriorityQueueinC（C优先队列库）.

This data structure is called a priority queue.
这种数据类型就叫做优先队列。

A priority queue does not permit null elements.
一个优先级队列不允许‘null'元素。

This data structure is called a priority queue.
这种数据结构就叫做优先队列。

A priority queue is an abstract data type.
优先队列也是一种抽象数据类型。

Heap was used to implement a priority queue.
Heap是常用的实现优先队列的方法。

A priority queue is a data structure that supports the following operations:.
双端优先队列是一个支持如下操作的数据结构：.

Such a data type is called a priority queue.
这种数据类型叫做优先队列。

Using a priority queue, limiting the concurrent execution of transactions; avoid deadlock.
使用优先级队列，限制并发执行的事务；避免死锁。

Such a data type is called a priority queue.
这种数据类型就叫做优先队列。

A priority queue relying on natural ordering also does not permit insertion of non-comparable objects.
依赖于自然排序的优先级队列也不允许插入不可比较的对象。

Such a data structure is called a priority queue.
这种数据结构就叫做优先队列。

As elements are added to a priority queue, its capacity grows automatically.
当元素加到优先级队列中，它的容量会自动增加。

Such a kind of queue is called a priority queue.
这种数据类型就叫做优先队列。

The closest one can come is to make a priority queue of interface{} values and use type assertions after fetching each element.
最接近的是创建interface{}值的优先序列，并在获取每一个元素后使用类型断言。

For concurrency control, Thread pool uses a priority queue solution.
对于事务的并发控制，Threadpool采用优先级队列的方式解决。

A priority queue relying on natural ordering also does not permit insertion of non-comparable objects(doing so may result in ClassCastException).
依靠自然排序的优先级队列还不允许插入不可比较的对象（这样做可能导致ClassCastException）。

In computer science, a queap is a priority queue data structure.
在计算机科学中，Brodal队列是一种堆、优先队列数据结构。

A priority queue is unbounded, but has an internal capacity governing the size of an array used to store the elements on the queue..
优先级队列是无界的，但是有一个内部容量，控制着用于存储队列元素的数组的大小。

With nothing more than a work queue(a priority queue, of course), you immediately attain most of the supposedly magical benefits of Agile Methodologies.
有了这样一个工作队列（当然这是一个优先队列），你瞬间就获得了大部分敏捷方法论所宜称的那些神奇的好处。

A priority queue relying on natural ordering also does not permit insertion of non-comparable objects(doing so may result in ClassCastException).
依赖于Comparablenaturalordering的优先级队列，因此不允许插入不可比较的对象（未实现Comparable接口的对象），这样做会导致ClassCastException。

The following class uses the heapq module to implement a simple priority queue:.
以下python程序使用该heapq模块实现简单的优先级队列：.

A high priority queue and special treatment for“diversity” candidates.
高优先级的队列及「多元化」候选人的特别对待.