Double-ended queue
In computer science, a double-ended queue (abbreviated to deque, pronounced deck, like "cheque") is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail). It is also often called a head-tail linked list, though properly this refers to a specific data structure of a deque (see below).
Abstract data typeAllocator (C++)Array data structureC++ Standard LibraryCilkCoders at WorkCollection (abstract data type)Compare-and-swapConc-tree listConvex hull of a simple polygonDEQDQDeckDequeDequesDequeueDouble-Ended QueueDouble-ended priority queueDouble compare-and-swapDouble ended queueDoubly-ended queueDoubly ended queueDynamic arrayEulerian pathFinger treeHead-tail linked listIacono's working set structureIntrosortJava (programming language)List of data structuresList of terms relating to algorithms and data structuresMonoqueOutline of combinatoricsPeek (data type operation)Permutation patternPersistent data structurePile (abstract data type)Purely functional data structureQueueQueue (abstract data type)
Link from a Wikipage to another Wikipage
differentFrom
primaryTopic
Double-ended queue
In computer science, a double-ended queue (abbreviated to deque, pronounced deck, like "cheque") is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail). It is also often called a head-tail linked list, though properly this refers to a specific data structure of a deque (see below).
has abstract
Ein Deque (Double-ended queue, ...... t oder entfernt werden können.
@de
Em ciência da computação, uma ...... ão ultrapasse o limite máximo.
@pt
In computer science, a double- ...... ucture of a deque (see below).
@en
In informatica, una deque (sol ...... ente dalla testa o dalla coda.
@it
Una cola doblemente terminada ...... arse fácilmente con una deque.
@es
Двобічна черга, жарг. дек (анг ...... як на початок, так і в кінець.
@uk
Двусвязная очередь (жарг. дэк, ...... при помощи двусвязного списка.
@ru
両端キュー(りょうたんキュー、英: double-ended ...... ーである。head-tail linked list とも。
@ja
双端队列(deque,全名double-ended queue)是一种具有队列和栈性质的抽象数据类型。双端队列中的元素可以从两端弹出,插入和删除操作限定在队列的两邊进行。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,020,968,556
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
Ein Deque (Double-ended queue, ...... t oder entfernt werden können.
@de
Em ciência da computação, uma ...... ue implementado por arranjo é:
@pt
In computer science, a double- ...... ucture of a deque (see below).
@en
In informatica, una deque (sol ...... ente dalla testa o dalla coda.
@it
Una cola doblemente terminada ...... arse fácilmente con una deque.
@es
Двобічна черга, жарг. дек (анг ...... як на початок, так і в кінець.
@uk
Двусвязная очередь (жарг. дэк, ...... при помощи двусвязного списка.
@ru
両端キュー(りょうたんキュー、英: double-ended ...... ーである。head-tail linked list とも。
@ja
双端队列(deque,全名double-ended queue)是一种具有队列和栈性质的抽象数据类型。双端队列中的元素可以从两端弹出,插入和删除操作限定在队列的两邊进行。
@zh
label
Cola doblemente terminada
@es
Deque (estruturas de dados)
@pt
Deque
@de
Deque
@it
Double-ended queue
@en
Двобічна черга
@uk
Двухсторонняя очередь
@ru
両端キュー
@ja
双端队列
@zh
덱 (자료 구조)
@ko