Queue processing method and device

A processing method and queuing technology, applied in the computer field, which can solve problems such as poor flexibility and adaptability, and inability to adjust

Inactive Publication Date: 2013-07-03
BEIJING BOCO COMM TECH
View PDF3 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Queue processing method and device
  • Queue processing method and device
  • Queue processing method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0056] In order to make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions provided by the embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

[0057] The queue processing method provided by the embodiment of the present invention includes:

[0058] Determine the type of operation and the type of data to be processed;

[0059] determining the number of bytes of data to be processed according to the type of data to be processed;

[0060] The data to be processed is processed byte by byte according to the operation type and the number of bytes of the data to be processed.

[0061] The operation type includes: storing data into the queue, taking out data from the queue, copying data from the queue, or deleting data from the queue.

[0062] The following describes in detail in conjunction with specific embodiments.

[0063] see figure 1...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
Inventor 张海洲
Owner BEIJING BOCO COMM TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap