Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - 先入先出队列

Search list

[Other resource] 51FIFO

Description: 51单片机的FIFO(先入先出)循环队列实现-51 SCM FIFO (first-in-first out) Revolving Queuing
Platform: | Size: 1365 | Author: tangcongfai | Hits:

[Report papers] 基于振荡采样的真随机数发生器IP设计

Description: 为了得到真正硬件产生的随机数序列,采用振荡电路作为物理源,设计了混洗电路和扰频 电路来改善输出序列的均衡性和数据冗余,它具有真随机数发生器的不可预测性高、随机性好的 优点.
Platform: | Size: 131699 | Author: fir12345@126.com | Hits:

[SourceCode] vxworks 自定义数据队列的实现

Description: 实现了 自定义的 数据缓冲队列，具有良好的扩展性。 利用用户保留内存进行数据缓冲，避免内存碎片
Platform: | Size: 5826 | Author: yinhuan99@gmail.com | Hits:

[SCM] 51FIFO

Description: 51单片机的FIFO(先入先出)循环队列实现-51 SCM FIFO (first-in-first out) Revolving Queuing
Platform: | Size: 1024 | Author: tangcongfai | Hits:

[Windows Develop] wubanpeidui

Description: 舞会上男女各排成一队进入舞厅，跳舞时依次从男士队伍和女士队伍的队头各出一个人相互结成舞伴。如果两队的人数不等，则队伍较长中未配对的人员将等待下一轮的舞曲。 要求用程序完成该配对过程的模拟，从键盘输入所有人员的名单，输入格式为“姓名 性别”，并且男女无序，输出所有配对的男女舞伴，如果某队伍中还有人员未配对完，则另外输出所有尚未配对人员名单。 选作内容： 1． 实现下一轮次的继续配对，此时，所有尚未配对的人员应优先予以配对； 2． 将姓名与性别数据存放在文本文件中，直接从文本中读入数据。 实现说明： 1． 总是排在队头的男女相互结成舞伴，具有队列的先进先出特征，因此采用队列来完成； 2． 采用两个队列分别存放男士和女士的姓名，所有输入的人员按照性别依次分解到各自的队列中，然后顺次取出各自的队头元素来配对并输出； 3． 队列类的数据类型可以是字符数组，也可以先实现模板类，再用字符数组来实例化实现。-thank you
Platform: | Size: 1024 | Author: 思缘 | Hits:

[VC/MFC] FIFO1

Description: FIFO的概念　FIFO： 　　一、先入先出队列(First Input First Output，FIFO)这是一种传统的按序执行方法，先进入的指令先完成并引退，跟着才执行第二条指令。-FIFO, the concept of FIFO: a first FIFO (First Input First Output, FIFO) which is a traditional sequential method of implementation, first access to complete and retire the first instruction, followed by implementation of the second instruction only.
Platform: | Size: 5120 | Author: asdfasdf | Hits:

[Data structs] DS2

Description: 使用STL queue adapter，实现队列先入先出。通过.run文件中的内容，实现相应的输出。-Using the STL queue adapter, to achieve queue FIFO. Through. Run the contents of the document to achieve a corresponding output.
Platform: | Size: 1445888 | Author: lavender | Hits:

[Other] vcFileupload

Description: 这是CTransferSocket_hawk的类实现文件，以下成员变量用于数据发送：数据缓存区,为一个先入先出队列，注意:队列中的数据比原始数据多4+BEGIN_TAG_LENGTH个字节,其中前4个字节用来存放原始数据的长度,接下来存放BEGIN_TAG.远程端需要长度来确定将要接收的数据块尺寸,并利用BEGIN_TAG，来判断是否有错误发生。-This is CTransferSocket_hawk class implementation file, the following member variable for data transmission: data buffer, a FIFO queue, Note: The data in the queue more than the original data, 4+ BEGIN_TAG_LENGTH bytes, of which the first 4 bytes the length used to store raw data, then store BEGIN_TAG. remote clients need to determine the length of the data block size to receive and use BEGIN_TAG, to determine whether an error occurred.
Platform: | Size: 38912 | Author: zs | Hits:

[Other] softhy153I

Description: 这是CTransferSocket_hawk的类实现文件，以下成员变量用于数据发送：数据缓存区,为一个先入先出队列，注意:队列中的数据比原始数据多4+BEGIN_TAG_LENGTH个字节,其中前4个字节用来存放原始数据的长度,接下来存放BEGIN_TAG.远程端需要长度来确定将要接收的数据块尺寸,并利用BEGIN_TAG，来判断是否有错误发生。-This is CTransferSocket_hawk class implementation file, the following member variable for data transmission: data buffer, a FIFO queue, Note: The data in the queue more than the original data, 4+ BEGIN_TAG_LENGTH bytes, of which the first 4 bytes the length used to store raw data, then store BEGIN_TAG. remote clients need to determine the length of the data block size to receive and use BEGIN_TAG, to determine whether an error occurred.
Platform: | Size: 990208 | Author: zs | Hits:

[Data structs] chexiang

Description: 利用队列结构实现车厢重排问题。车厢重排问题如下： 一列货车共有n节车厢，每个车厢都有自己的编号，编号范围从1~n。给定任意次序的车厢，通过转轨站将车厢编号按顺序重新排成1~n。转轨站共有k个缓冲轨，缓冲轨位于入轨和出轨之间。开始时，车厢从入轨进入缓冲轨，经过缓冲轨的重排后，按1~n的顺序进入出轨。缓冲轨按照先进先出方式，编写一个算法，将任意次序的车厢进行重排，输出每个缓冲轨中的车厢编号。 -Using queue structures to achieve car Rearrangement. Rearrangement inside the following: a freight train and rode a total of n cars, each car has its own number, number range from 1 ~ n. Compartment of any order given by the transition point will be re-arranged car number in sequence 1 ~ n. Transition point total of k-rail buffer, the buffer between the rail in the orbit and the derailment. Beginning of orbit into the buffer from the rail car after rail rearrangement buffer, press 1 ~ n the order into the derailment. Rail in accordance with the FIFO buffer mode, write an algorithm to order the car for any rearrangement, the output of each track in the buffer compartment number.
Platform: | Size: 896000 | Author: 莫凡 | Hits:

[Windows Develop] printer

Description: 测试你对这项任务队列和你有能力使用STL队列适配器的理解。您被要求完成的实施方案模拟一个共享打印机。这种打印机使用先入先出队列。 仿真工程通过阅读和处理从数据文件中的事件列表。每一个有效的数据文件中的行包含有关打印作业和作业提交时，这个时间信息。具体来说，在每一行中包含的信息是时间（以秒为单位）提交作业，在作业的页面长度，以及从中作业提交计算机的名称。在仿真开始时，这些事件都应该是阅读的计划，并在继承的工作量队列中。 该方案应通过增加内部模拟一个循环或while循环计数器时间的推移。该方案应初始化这个计数器为零，并增加一秒钟。打印作业“降临”时，模拟当前时间等于在工作量的队列前面的打印作业提交的时间。当这种情况发生，流行的工作量队列这一事件并将其放置在另一个队列<event>对象。这其他队列<event>对象存储的“到达”的打印作业。这些工作，而在此队列中等待的程序模拟印刷的其他工作。因此，你可能要等待此对象的名称或类似的东西。 -This assignment tests your understanding of queues and your ability to use the STL queue adapter. The program you are asked to finish the implementation of simulates a shared printer. This printer uses a first-in-first-out queue. The simulation works by reading and processing a list of events from a data file. Each line in a valid data file contains information about a print job and a time when this job was submitted. Specifically, the information contained in each line is the time (in seconds) the job was submitted, the length in pages of the job, and the name of the computer from which the job was submitted. At the beginning of the simulation, each of these events should be read in by the program and stored in the inherited workload queue. The program should simulate the passage of time by incrementing a counter inside a for-loop or while-loop. The program should initialize this counter to zero and increment it by one second. A print job "arrives" when the current time of the simu
Platform: | Size: 10240 | Author: | Hits:

[VHDL-FPGA-Verilog] FIFO

Description: 先入先出队列(First Input First Output，FIFO)这是一种传统的按序执行方法，先进入的指令先完成并引退，跟着才执行第二条指令。-FIFO queue (First Input First Output, FIFO) which is a traditional sequential execution method, first enter the command to finish and retire, only to follow the implementation of the second instruction.
Platform: | Size: 1024 | Author: 吴海勇 | Hits:

[VHDL-FPGA-Verilog] fifo-verilog

Description: 用verilog 编写的fifo（先入先出队列）代码 内含测试文件 test bench-First Input First Output programme which designed by verilog codes,including test bench
Platform: | Size: 1024 | Author: 贺铮 | Hits:

[SCM] 51MCU_FIFO

Description: 51单片机的FIFO(先入先出)循环队列实现（已在串口通信中实际应用）-51 single-chip FIFO (FIFO) circular queue (already in the practical application of the serial communication)
Platform: | Size: 25600 | Author: peack | Hits:

[SCM] 51-FIFO

Description: 51单片机的FIFO(先入先出)循环队列实现-51 single-chip FIFO (first-in, first-out) circular queue to achieve
Platform: | Size: 1024 | Author: 陈驰 | Hits:

[Software Engineering] FIFO-algorithm

Description: 先入先出队列，这是一种传统的按序执行方法，先进入的指令先完成并引退，跟着才执行第二条指令。是一种先进先出的数据缓存器，他与普通存储器的区别是没有外部读写地址线，这样使用起来非常简单，但缺点就是只能顺序写入数据，顺序的读出数据，其数据地址由内部读写指针自动加1完成，不能像普通存储器那样可以由地址线决定读取或写入某个指定的地址-First-in, first-out queue, which is a traditional sequential execution method, first enter the command to complete and retire, followed by the second instruction before it is implemented. Is a FIFO data buffer, and he is the difference between ordinary no external memory write address lines, so it is very simple, but the disadvantage is that the order can only write data, read data sequentially, the data address by the internal write pointer is automatically incremented to complete, not like ordinary memory address lines that can be read from or written to a decision to the address specified
Platform: | Size: 1024 | Author: 路子祥 | Hits:

[VHDL-FPGA-Verilog] FIFO

Description: First Input First Output的缩写，先入先出队列，这是一种传统的按序执行方法，先进入的指令先完成并引退，跟着才执行第二条指令。-The abbreviation of the first input first output, the first in first out queue, which is a traditional sequential execution method, first enter the command to finish and retire, only to follow the implementation of the second instruction.
Platform: | Size: 1024 | Author: 王衎秋 | Hits:

[Windows Develop] Queue_BAK

Description: queue 源码 包括：队列的先入先出，加锁等等(the source code of queue)
Platform: | Size: 3618816 | Author: xhn1986 | Hits:

[Other] 异步FIFO设计

Description: 经典的异步FIFO设计，First Input First Output的缩写，先入先出队列，这是一种传统的按序执行方法，先进入的指令先完成并引退，跟着才执行第二条指令。(Classic asynchronous FIFO design)
Platform: | Size: 429056 | Author: 见到过的都是 | Hits:

[Other] 同步FIFO设计

Description: First Input First Output的缩写，先入先出队列，这是一种传统的按序执行方法，先进入的指令先完成并引退，跟着才执行第二条指令。(Classic synchronous FIFO design)
Platform: | Size: 268288 | Author: 见到过的都是 | Hits:
« 12 »

CodeBus www.codebus.net