在计算机科学中,队列数据结构是基本的先进先出(FIFO)结构。
In computer science, a queue data structure is your basic first-in, first-out (FIFO) structure.
这样做将消除Domino代理管理器的“先进先出”队列行为方式。
Doing so will take the "first in first out" queue behavior of the Domino agent manager out of the picture.
Linux调度和锁定用来管理先进先出(FIFO)队列。
Linux scheduling and locking involve managing first in, first out (FIFO) queues.
SqlQueue 也采取类似的方式,但是它像队列那样工作(先进先出;而不是像栈一样最后一个项进栈,第一个项出栈)。
The SqlQueue works in a similar fashion, but it works like a queue would (first item in, first item out; instead of last item in, first item out, like the stack).
按先进先出原则,对队列中的像素进行膨胀运算。
在前面的章节里,我们了解了管道,先进先出结构,消息队列,信号旗语,以及共用内存:这些是UNIX系统提供的经典的进程通信方式。
In the previous chapter, we looked at pipes, FIFOs, message queues, semaphores, and Shared memory: the classical methods of IPC provided by various UNIX systems.
在前面的章节里,我们了解了管道,先进先出结构,消息队列,信号旗语,以及共用内存:这些是UNIX系统提供的经典的进程通信方式。
In the previous chapter, we looked at pipes, FIFOs, message queues, semaphores, and Shared memory: the classical methods of IPC provided by various UNIX systems.
应用推荐