因为最小块大小是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.
例如，一个链表在指针为4字节的系统上可能分配只包含两个指针的节点，也就是说只需要8个字节。
For example, a linked list on a system with 4-byte Pointers might allocate nodes holding only, say, two Pointers, requiring only 8 bytes.
在两个级别上执行锁定(见清单7)：链表有一个读写锁，各个节点包含一个互斥锁。
Locking occurs on two levels (see Listing 7) : The list has a read-write lock, while individual nodes contain a mutex.
此程序创建一个包含几个节点的链表，填充数据，输出它们，最后删除所有节点。
This program creates a linked list of few nodes, fills in the data, prints them, and finally deletes all the nodes.
链表所包含的节点结构体由两部分构成：它所持有的数据，以及指向另一个节点结构体(或者是NULL，结束链表)的指针。
A linked list consists of a node structure that contains two members: the data it is holding and a pointer to another node structure (or NULL, to terminate the list).
然后，把释放的节点添加到这个bucket 的空闲链表的开头。
The block to be freed is then added to the head of the free list for that bucket.
如何将一个节点添加到双链表的终结吗？
圆形，双链表，如何管理节点对象的关系？
Circular, doubly linked list, how to manage the node to object relationship?
但在双链表的每个节点从它的兄弟姐妹和兄弟姐妹参考节点的引用。
But in doubly-linked list each node is referenced from it's sibling and the sibling references the node.
返回：链表新的首节点。
给定一个单链表，将其节点进行分组，使得所有的奇数节点排列在前，偶数节点在后。
Given a singly linked list, group all odd nodes together followed by the even nodes.
给定一个链表，返回循环的起始节点。
Given a linked list, return the node where the cycle begins.
我的问题：这可能与一个以上的一个或多个先前的节点的节点创建链表，如何将结构是什么样子的？
My Question: Is it possible to create linked list with nodes with more than one next or more than one previous nodes, if so how would the struct look like?
给定一个链表，其中的节点包含一个额外的随机指针，可能指向链表中的任意一个节点或者为空。
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.
在实现多项式的运算过程中，通过链表来找到多项式的每一项，并对两个链表的节点执行相应操作来实现运算。
Polynomial operations in the realization of the process, through the list to find the polynomial of each, and two lists of nodes perform the appropriate action to implement operations.
作用：从循环链表断开该节点的链接。
作用：从循环链表断开该节点的链接。
应用推荐