差别
这里会显示出您选择的修订版和当前版本之间的差别。
两侧同时换到之前的修订记录 前一修订版 | |||
fifo [2016/05/26 21:41] gongyu |
fifo [2016/05/26 21:42] (当前版本) gongyu |
||
---|---|---|---|
行 8: | 行 8: | ||
Queueing theory encompasses these methods for processing data structures, as well as interactions between strict-FIFO queues. | Queueing theory encompasses these methods for processing data structures, as well as interactions between strict-FIFO queues. | ||
- | {{:fifo_queue.png|}} | + | {{ :fifo_queue.png |}} |
====Data structure==== | ====Data structure==== | ||
Representation of a FIFO (first in, first out) queue | Representation of a FIFO (first in, first out) queue | ||
Depending on the application, a FIFO could be implemented as a hardware shift register, or using different memory structures, typically a circular buffer or a kind of List. For information on the abstract data structure, see Queue (data structure). | Depending on the application, a FIFO could be implemented as a hardware shift register, or using different memory structures, typically a circular buffer or a kind of List. For information on the abstract data structure, see Queue (data structure). | ||
- | {{:600px-data_queue.svg.png|}} | + | {{ :600px-data_queue.svg.png |}} |
====Code==== | ====Code==== |