dequeue

См. также в других словарях:

• dequeue — /dē kūˈ/ (computing) transitive verb To remove (a data processing task) from a list of tasks awaiting processing in a buffer ORIGIN: ↑de (2) …   Useful english dictionary

• Dequeue — In computer science, the word dequeue can be used as: A verb meaning to remove from a queue An abbreviation for double ended queue (more commonly, deque) This disambiguation page lists articles associated with the same title. If an …   Wikipedia

• dequeue — verb to remove an item from a queue Ant: enqueue …   Wiktionary

• Abstrakter Datentyp — Ein Abstrakter Datentyp (ADT) ist ein Verbund von Daten zusammen mit der Definition aller zulässigen Operationen, die auf sie zugreifen. Inhaltsverzeichnis 1 Beschreibung 2 Spezifikationen 3 Beispiel 3.1 …   Deutsch Wikipedia

• Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …   Wikipedia

• Google C++ Testing Framework — (Google Test)  библиотека для модульного тестирования (англ. unit testing) на языке С++. Исходные тексты открыты с середины 2008 года[1] под лицензией BSD. Документация частично переведна на русский язык.[2] Google Test построена на… …   Википедия

• Double-ended queue — Not to be confused with Double ended priority queue. In computer science, a double ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data structure that implements a queue for which elements can only be added to or …   Wikipedia

• Deque — In computer science theory, a deque (short for double ended queue mdash; Deque is usually pronounced deck. ) is an abstract list type data structure, also called a head tail linked list, for which elements can be added to or removed from the… …   Wikipedia

• Continuation — For other uses, see Continuation (disambiguation). In computer science and programming, a continuation is an abstract representation of the control state of a computer program. A continuation reifies the program control state, i.e. the… …   Wikipedia

• Persistent data structure — In computing, a persistent data structure is a data structure which always preserves the previous version of itself when it is modified; such data structures are effectively immutable, as their operations do not (visibly) update the structure in… …   Wikipedia

• Ticket lock — A ticket lock is a form of lockless inter thread synchronization.OverviewConventionally, inter thread synchronization is achieved by using synchronization entities provided by the operating system, such as events, semaphores and mutexes.For… …   Wikipedia