Queue (abstract data type)
Автор:
Jesse Russell,Ronald Cohn, 148 стр., издатель:
"Книга по Требованию", ISBN:
978-5-5121-7729-7
High Quality Content by WIKIPEDIA articles! A queue (pronounced /?kju?/ kew) is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that once an element is added, all elements that were added before have to be removed before the new element can be invoked. A queue is an example of a linear data structure. Данное издание представляет собой компиляцию сведений, находящихся в свободном доступе в среде Интернет в целом, и в информационном сетевом ресурсе "Википедия" в частности. Собранная по частотным запросам указанной тематики, данная компиляция построена по принципу подбора...
Рейтинг книги:



4 из 5,
9 голос(-ов).