| 翻訳と辞書 |
Double-ended queue
In computer science, a double-ended queue (dequeue, often abbreviated to deque, pronounced ''deck'') 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).〔Donald Knuth. ''The Art of Computer Programming'', Volume 1: ''Fundamental Algorithms'', Third Edition. Addison-Wesley, 1997. ISBN 0-201-89683-4. Section 2.2.1: Stacks, Queues, and Deques, pp. 238–243.〕 It is also often called a head-tail linked list, though properly this refers to a specific data structure implementation (see below).
==Naming conventions==
''Deque'' is sometimes written ''dequeue'', but this use is generally deprecated in technical literature or technical writing because ''dequeue'' is also a verb meaning "to remove from a queue". Nevertheless, several libraries and some writers, such as Aho, Hopcroft, and Ullman in their textbook ''Data Structures and Algorithms'', spell it ''dequeue''. John Mitchell, author of ''Concepts in Programming Languages,'' also uses this terminology.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Double-ended queue」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|