循环队列存储空间的动态扩充方法

Dynamic expansion method circular queue storage space

循环队列以有效利用空间的优势在些软件系统中被广泛使用。但是在循环队列的使用中总是会事先开辟一定大小的空间,而在队列投入使用后不能再改变空间的大小。在文献[1]中设计了一种循环队列的存储结构,并研究设计了在该结构上的空间的回收方法。而在该结构上存储空间的初始化和动态扩充算法没有研究。本文作为文献[1]的有效补充,首次设计实现了在该存储结构上队列的初始化和动态扩充算法。

Circular queues is be widely used in some software systems as the advantage of efficient use of space. However, the circular queue is always open space of a certain size in advance, and did not change the size of the space when the queue put into use. In [ 1 ] we design a storage structure of a circular queue, and design the recovery process Algorithm of the structure. The dynam- ic expansion algorithm and the initialization algorithm does not research on the storage structure. As the literature [1] of the effective supplement, we designed and implemented the initialization algorithm and dynamic expansion algorithm on the storage structure of the queue for the first time in this paper.