| 摘要 |
PURPOSE:To improve efficiency of processing of queue control by providing plural pointer storing sections and data storing sections and judging whether the objective position of insertion is the rear end of a queue or not at the time of inserting an element to the queue. CONSTITUTION:At the time of inserting an insertion element 16 to a queue 15, priority order of the element 16 and control data in a data storing section 14 are compared first, and judged whether the position of insertion is the rear end of the queue or not. In case of rear end, the element is inserted next the rear end element 15n of the queue 15. When, it is not the rear end, the position of insertion is decided by comparison of priority order referring to the head element 15a of the queue 15. When it is not the position of insertion, next element of the queue 15 is referred. After repeating this process, an element 16 is inserted when it becomes the position of insertion. When the position of insertion is the head of the queue 15, a pointer in a pointer storing section 12 is updated, and when the position of insertion is the rear end of the queue 15, a pointer in a pointer storing section 13 and control data in a storing section 14 are updated. Thus, efficiency of processing of queue control can be enhanced. |
