Diclib.com
Словарь ChatGPT

Поиск в словаре Индивидуальные решения

Введите слово или словосочетание на любом языке 👆

Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

как употребляется слово
частота употребления
используется оно чаще в устной или письменной речи
варианты перевода слова
примеры употребления (несколько фраз с переводом)
этимология

Что (кто) такое cyclic queue - определение

ABSTRACT DATA TYPE

Bounded queue; Queue (data structure); Real-time queue; Amortized queue

Найдено результатов: 318

Cyclic peptide

PEPTIDE CHAINS WHICH CONTAIN A CIRCULAR SEQUENCE OF BONDS

Cyclic peptides; Peptides, cyclic; Cyclic polypeptides; Cyclic protein; Cyclic polypeptide; Cyclopeptides; Cyclopeptide; Peptide macrocycle

Cyclic peptides are polypeptide chains which contain a circular sequence of bonds. This can be through a connection between the amino and carboxyl ends of the peptide, for example in cyclosporin; a connection between the amino end and a side chain, for example in bacitracin; the carboxyl end and a side chain, for example in colistin; or two side chains or more complicated arrangements, for example in amanitin.

https://en.wikipedia.org/wiki/Cyclic_peptide

Cyclic order

TERNARY RELATION THAT IS CYCLIC (IF [𝑥,𝑦,𝑧] THEN [𝑧,𝑥,𝑦]), ASYMMETRIC (IF [𝑥,𝑦,𝑧] THEN NOT [𝑧,𝑦,𝑥]), TRANSITIVE (IF [𝑤,𝑥,𝑦] AND [𝑤,𝑦,𝑧] THEN [𝑤,𝑥,𝑧]) AND CONNECTED (FOR DISTINCT 𝑥,𝑦,𝑧

Cyclic sequence; Circular order; Circular ordering; Total cyclic order; Cyclically ordered set; Cyclic ordering; Complete cyclic order; Linear cyclic order; L-cyclic order; Circularly ordered set

In mathematics, a cyclic order is a way to arrange a set of objects in a circle. Unlike most structures in order theory, a cyclic order is not modeled as a binary relation, such as "".

https://en.wikipedia.org/wiki/Cyclic_order

Client–queue–client

Client-Queue-Client; Client-queue-client

A client–queue–client or passive queue system is a client–server computer network in which the server is a data queue for the clients. Instead of communicating with each other directly, clients exchange data with one another by storing it in a repository (the queue) on a server.

https://en.wikipedia.org/wiki/Client–queue–client

Cyclic neutropenia

HUMAN DISEASE

Cyclical neutropenia; Cyclical Neutropenia; Periodic neutropenia; Cyclic leucopenia; Cyclic hematopoesis

Cyclic neutropenia (CyN) is a rare hematologic disorder and form of congenital neutropenia that tends to occur approximately every three weeks and lasting for few days at a time due to changing rates of neutrophil production by the bone marrow. It causes a temporary condition with a low absolute neutrophil count and because the neutrophils make up the majority of circulating white blood cells it places the body at severe risk of inflammation and infection.

https://en.wikipedia.org/wiki/Cyclic_neutropenia

deque

ABSTRACT DATA TYPE FOR WHICH ELEMENTS CAN BE ADDED TO OR REMOVED FROM EITHER THE FRONT OR BACK

Doubly-ended queue; Deques; Double ended queue; Deque; Double-Ended Queue; Head-tail linked list; Doubly ended queue; Real-time deque

double-ended queue

circular buffer

DATA STRUCTURE

Ring Buffer; Ring buffer; Circular queue; Ringbuffer; Ring (data structure); Cyclic buffer; Circular log

<programming> An area of memory used to store a continuous stream of data by starting again at the beginning of the buffer after reaching the end. A circular buffer is usually written by one process and read by another. Separate read and write pointers are maintained. These are not allowed to pass each other otherwise either unread data would be overwritten or invalid data would be read. A circuit may implement a hardware circular buffer. (2000-06-17)

double-ended queue

ABSTRACT DATA TYPE FOR WHICH ELEMENTS CAN BE ADDED TO OR REMOVED FROM EITHER THE FRONT OR BACK

Doubly-ended queue; Deques; Double ended queue; Deque; Double-Ended Queue; Head-tail linked list; Doubly ended queue; Real-time deque

<algorithm> /dek/ (deque) A queue which can have items added or removed from either end[?]. The Knuth reference below reports that the name was coined by E. J. Schweppe. [D. E. Knuth, "The Art of Computer Programming. Volume 1: Fundamental Algorithms", second edition, Sections 2.2.1, 2.6, Addison-Wesley, 1973]. Silicon Graphics (http://sgi.com/tech/stl/Deque.html). [Correct definition? Example use?] (2003-12-17)

Double-ended queue

ABSTRACT DATA TYPE FOR WHICH ELEMENTS CAN BE ADDED TO OR REMOVED FROM EITHER THE FRONT OR BACK

Doubly-ended queue; Deques; Double ended queue; Deque; Double-Ended Queue; Head-tail linked list; Doubly ended queue; Real-time deque

In computer science, a double-ended queue (abbreviated to deque, pronounced deck, like "cheque"Jesse Liberty; Siddhartha Rao; Bradley Jones. C++ in One Hour a Day, Sams Teach Yourself, Sixth Edition.

https://en.wikipedia.org/wiki/Double-ended_queue

Queue

WIKIMEDIA DISAMBIGUATION PAGE

Queue (computing); Queues; Queuing methods; Queue (disambiguation); The Queue (disambiguation); The Queue (novel)

·vt To fasten, as hair, in a queue.

II. Queue ·noun A line of persons waiting anywhere.

III. Queue ·noun A tail-like appendage of hair; a pigtail.

queue

WIKIMEDIA DISAMBIGUATION PAGE

Queue (computing); Queues; Queuing methods; Queue (disambiguation); The Queue (disambiguation); The Queue (novel)

¦ noun

1. chiefly Brit. a line or sequence of people or vehicles awaiting their turn to be attended to or to proceed.

Computing a list of data items, commands, etc., stored so as to be retrievable in a definite order.

2. archaic a plait of hair worn at the back of the head.

¦ verb (queues, queuing or queueing, queued) chiefly Brit. wait in a queue.

?Computing arrange in a queue.

Origin

C16 (as a heraldic term denoting an animal's tail): from Fr., based on L. cauda 'tail'; cf. cue².

Википедия

Queue (abstract data type)

In computer science, a queue is a collection of entities that are maintained in a sequence and can be modified by the addition of entities at one end of the sequence and the removal of entities from the other end of the sequence. By convention, the end of the sequence at which elements are added is called the back, tail, or rear of the queue, and the end at which elements are removed is called the head or front of the queue, analogously to the words used when people line up to wait for goods or services.

The operation of adding an element to the rear of the queue is known as enqueue, and the operation of removing an element from the front is known as dequeue. Other operations may also be allowed, often including a peek or front operation that returns the value of the next element to be dequeued without dequeuing it.

The operations of a queue make it 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 a new element is added, all elements that were added before have to be removed before the new element can be removed. A queue is an example of a linear data structure, or more abstractly a sequential collection. Queues are common in computer programs, where they are implemented as data structures coupled with access routines, as an abstract data structure or in object-oriented languages as classes. Common implementations are circular buffers and linked lists.

Queues provide services in computer science, transport, and operations research where various entities such as data, objects, persons, or events are stored and held to be processed later. In these contexts, the queue performs the function of a buffer. Another usage of queues is in the implementation of breadth-first search.

https://en.wikipedia.org/wiki/Queue (abstract data type)