Queue processing method and device

Abstract

The embodiment of the invention discloses a queue processing method and device. The method comprises the steps of confirming operation type, queue information and the number of bytes of data to be processed; and processing the data to be processed in bytes according to the operation types and the queue information, wherein the operation types comprise types of storing data in a queue, taking data out of the queue, copying data from the queue, or deleting data from the queue. The method provided by the embodiment of the invention has no limitation of the type on operated data; no matter what operation is carried out by the queue, the operation is carried out in bytes; and the concept of data types of the queue processing process in the prior art is discarded, and all data types are integrated into the bytes, so that a user can flexibly confirm the data to be processed according to actual requirements, and greater convenience is brought to the user.

Description

technical field [0001] The present invention relates to the field of computer technology, in particular to a queue processing method and device. Background technique [0002] When using traditional data structures to produce and consume sequential data, queues are generally used to process first-in, first-out data. A queue is a special linear table that only allows deletions at the front end of the table and insertions at the rear end of the table. The end of the insertion operation is called the tail of the queue, and the end of the deletion operation is called the head of the queue. When there are no elements in the queue, it is called an empty queue. On the basis of the initial queue, a ring queue, a two-way queue, and a ring two-way queue are gradually developed, and these queues can handle first-in, first-out data well. [0003] The inventor found through research on the prior art that although the existing queue data structure can solve most of the first-in first-ou...

AI Technical Summary

Problems solved by technology

[0003] The inventor found through research on the prior art that although the existing queue data structure can solve most of the first-in first-out data processing problems, the objects before and after processing must be consistent when using the existing queue for data processing, so that Take the data access process as an example. If two short integers are stored, the last retrieval can only be done twice. Each time a short integer is retrieved, and it cannot be adjusted according to the actual situation. For example, one long integer is retrieved at one time. Integer, which makes the existing technology less flexible and adaptable

Images