Search - fifo r

Search - fifo r - List

[VC/MFC] 06_duilie DL : 0: 像堆栈一样，队列也是一种特殊的线性表。队列的插入和删除操作分别在线性表的两端进行，因此，队列是一个先进先出（ first-in-first-out, FIFO）的线性表。尽管可以很容易地从线性表类L i n e a r L i s t（见程序3 - 1）和链表类C h a i n（见程序3 - 8）中派生出队列类，但在本章中并没有这样做。出于对执行效率的考虑，我们把队列设计成一个基类，分别采用了公式化描述和链表描述。-The same as the stack, the queue is a special kind of linear form. Queue insert and delete operations were carried out at both ends of the linear table, so the queue is a FIFO (first-in-first-out, FIFO) linear form. Although easily from the linear form class L inear L ist (see procedure 3- 1) and the list class C hain (see procedure 3- 8), the derived queue class, but in this chapter did not do so. Out of the efficiency considerations, we designed a base class queue were formulated by a description and list descriptions.
Date : 2025-12-25 Size : 799kb User : 谢锦明