此程序创建一个包含几个节点的链表，填充数据，输出它们，最后删除所有节点。
This program creates a linked list of few nodes, fills in the data, prints them, and finally deletes all the nodes.
注意，与我们的递归程序非常类似，链表的定义也包括一个基线条件 ——在这里是NULL指针。
Notice how like our recursive programs, the definition of a linked list also contains a base case -- in this case, the NULL pointer.
因为最小块大小是16字节，那么只分配链表节点的用户程序就会遭受额外的100%的开销。
Since the minimum chunk size is 16 bytes, user programs allocating only list nodes suffer 100% overhead.
这些最小尺寸比大部分人期望的大许多——它们可能导致巨大的浪费，例如，在分配许多小链表节点的应用程序中。
These minimum sizes are larger than most people would like to see — they can lead to significant wastage for example in applications allocating many tiny linked-list nodes.
由于NULL指针会结束一个链表，所以我们也可以使用 NULL 指针条件作为基于链表的很多递归程序的基线条件。
Since a NULL pointer terminates a list, we can also use the NULL pointer condition as a base case for many of our recursive functions on linked lists.
处理程序链表示一个有序的处理程序清单。
要在程序中使用一个变量来容纳这种链表，您需要做的只是使用一个指向类型struct ll_int _ node的指针。
To have a variable hold this kind of list in a program, all you need is to have a pointer that points to type struct ll_int_node.
注意，与我们的递归程序非常类似，链表的定义也包括一个基线条件——在这里是NULL指针。
Notice how like our recursive programs, the definition of a linked list also contains a base case — in this case, the NULL pointer.
这个程序是基于双向链表实现的，很好地诠释了此特殊的数据结构。
This procedure is based on the realization of two-way linked list, a good interpretation of this particular data structure.
本程序主要是提取骨架的端点和分支点，方法采用的是单链表轮廓跟踪。
This program is mainly extract the skeleton endpoints and branch points, and methods used in single-contour tracking list.
说明：这段程序是关于链表的程序。如有不足，欢迎指教。
This program is on the list of programs. If not enough, please advise.
链表是单片机程序开发中一种常见的数据结构，通常包括栈链、队列和线性链表。
Linked list is a kind of common data structure in microcontroller's program, which includes stack, queue and linear list.
程序用了指针、链表、数组、结构体等知识点，可运用于小的管理软件。
Program using Pointers, linked lists, arrays, structures, and other knowledge, can be applied to a small management software.
为了使该程序在电脑中运行时节省内存，在入库函数中使用了链表功能。
In order to run the program to save computer memory, used in the function list storage function.
绝对安全使用内核链表在中断上下文，但但检索任何中断处理程序是一个坏主意。
It is perfectly safe to use kernel linked lists in interrupt context, but but retrieving anything in interrupt handlers is a bad idea.
这样相比效率就高了很多。在我的程序中，我就使用了这种单链表来管理。
As another example, some of the system-supplied SCSI class drivers use lookaside lists to allocate and release memory for SRBs.
这样相比效率就高了很多。在我的程序中，我就使用了这种单链表来管理。
As another example, some of the system-supplied SCSI class drivers use lookaside lists to allocate and release memory for SRBs.
应用推荐