搜索资源列表
20070512graduate
- 在Linux底下用QtDesigner开发的一个进程同步例子。基本思想是设计一个缓冲区(循环队列),进程A往缓冲区写,进程B往缓冲区读,只有缓冲区空的时候才能写,只有缓冲区满的时候才能读。-used in Linux under a QtDesigner development process synchronization example. Basic idea is to design a buffer zone (Circular Queue), a process to write bu
RR
- Round-robin scheduling algorithm is one of the simplest scheduling algorithms. It is designed especially for time-sharing systems. The ready queue is treated as a circular queue. The algorithm assigns a time slice(also called time quantum) to each pr
CycQueue
- 循环缓冲队列 ,常用于数据的采集等。比如生产者-消费者模式。-Circular buffer queue, commonly used in data collection and so on. For example the producer- consumer model.
fifo
- 一个循环线性地址先进先出队列(FIFO),非常适合用做通讯、任务等,具有如下特点: 1.循环队列,空间利用率非常高,不用动态分配内存,不使用链表,无内存泄漏,无内存碎片; 2.线性地址空间,直接使用memcpy进出,速度非常快; 使用说明: 1.fifo_init 2.fifo_into 2.fifo_get 3.fifo_remove 4.fifo_uninit 如发现问题联系本人: lxj_com@163.com QQ:67016879
findpath
- 路径查找使用一个队列 1。为了给你实施的队列抽象数据类型(ADT)使用acircular阵列的经验。 2。为了解决一个真正的问题,使用队列。 您将首先执行一个模板队列ADT采用圆形阵列。然后,您将使用 队列找到一条最短路径的三维网格来构建应用程序。-Path Finding Using a Queue 1. To give you experience in implementing a queue abstract data type (ADT) using acircular
CircularQueue
- 双缓冲循环队列数据结构,能够高效对数据进行操作。-Double buffering circular queue data structure that can efficiently operate on the data.
ipw2100
- Firmware and host share a circular queue of Transmit Buffer Descr iptors (TBDs) for Linux v2.13.6.
queue
- This file defines five types of data structures: singly-linked lists, lists, simple queues, tail queues, and circular queues.
21twenty-one
- 实现队列的相关操作,入队,出队,实际应用中用的都是循环队列。(The relevant operation, queue enqueue, dequeue, practical applications are used in the circular queue.)