搜索资源列表
-
0下载：
In this homework, we are going to implement various ADTs including “doubly
linked list”, “dynamic array” and “binary search tree”. Based on the parameter to the
“make” command, we will generate 3 different executables: “adtTest.dlist”,
“adtTest
-
-
0下载：
通用双向链表的一种实现，可作为库函数调用。-A realization of generic doubly linked list can be used as a library function call.
-
-
0下载：
UNIX/Linux应用程序在使用select/poll调用实现I/O的集中控制时，可借此实现通用的定时器功能。因为依赖于之前上传的双向链表实现，故而也包含在其中。-UNIX/Linux applications to achieve the centralized control of the I/O using select/poll call will be able to achieve universal timer functions. Doubly linked list impl
-
-
0下载：
这是一个循环双链表，上传的目的在于与大家共同进步，也希望大家能把一些不错的代码贡献出来-This is a circular doubly linked list, upload aims and common progress, but also hope that we can some good code contributed
-
-
0下载：
双链表实现malloc free,模拟内存分配，开辟数组以模拟-Doubly linked list implementation malloc free, analog memory allocation, open arrays to simulate
-
-
0下载：
Simple doubly linked list implementation.
-
-
0下载：
Simple doubly linked list implementation for Linux.
-
-
1下载：
首先，您将实现一个模板双端，双链表或DLIST。然后，您
建立两个应用程序：一个反向波兰表达式计算器和一个呼叫中心将使用DLIST模拟程序。
该项目将让您在申请动态内存管理的经验，实施
模板容器类（双端双向链表，或Dlist中），使用at-
最多一次不变的存在，所有权和保护规则来实现两个简单的
采用这种结构的应用程序。-This project will give you experience in applying dynamic memory management, im
-
-
0下载：
Simple doubly linked list implementation.
-
-
0下载：
Define pointers to support a doubly-linked list of all live heap objects.
-
-
0下载：
Doubly-linked list of objects. The objects lifetimes are controlled by the list. I.e. the the list creates the objects and they are deleted upon removal.
-Doubly-linked list of objects. The objects lifetimes are controlled by the list. I.e. the th
-
-
0下载：
Helper class to automatically initialize the doubly linked list created pointers.
-
-
0下载：
Linux Device Driver: List element. This is a doubly linked list that also contains an opaque pointer to data.
-
-
0下载：
通用双向链表，创建节点后要释放节点，从头部、尾部、中间插入节点，获取节点。-General doubly linked list, created after the release of the node to node, the head, the tail, the intervening nodes, access nodes.
-
