清单1给出最基本的并发单向链表接口。
Listing 1 shows the most basic concurrent, singly linked list interface.
例如，链表就是根据其本身定义出来的。
For example, linked lists are defined in terms of themselves.
并发单向链表的设计方法。
让我们来看一些基于链表的递归函数示例。
Let's look at a few examples of recursive functions on linked lists.
这个链表叫做pte链。
我真正想做的是，除以链表的个数。
And what I really wanted to do is, divide by the number of lists.
这么做就允许多个线程同时搜索链表。
Doing so allows for multiple threads to search the list concurrently.
处理程序链表示一个有序的处理程序清单。
这种资料库称为访问控制链表（ACL）。
链表的优势之一是，您可以使用它们来避免锁定状态。
One advantage of linked lists is that you can use them to avoid locking situations.
当一些线程正在迭代链表时，出现迭代请求。
Iteration requests come in while some threads are iterating the list.
单链表是让您可以描述多种类型数据的一种有效抽象。
Singly linked lists are a powerful abstraction that allow you to represent numerous types of data.
循环链表大多数情况下都有向前或向后指针。
Most of the time circular lists have a front and back Pointers.
使用这种具有链表的散列表可以提供最快速的查询功能。
The use of the hash table with linked list provides the quickest lookup.
这个链表散列表包含有关共享内存日志标记指针的信息。
The linked list hash table contains information about the shared memory logging token pointers.
列表是原子的链表，或者是列表的列表，或者两者兼备。
最初可以使用内存块的一个空链表来创建一个抽象缓冲区。
You can initially create an abstract buffer with an empty linked list of memory block.
注意，两个读取器采取的行动依赖于是否链表为空。
Notice that the action taken by both of the getters depends on whether the list is empty.
另外，某些锁问题或内存损坏可能会损坏这个链表。
Also, it may happen that it gets corrupted because of some locking issues, or memory corruption.
除标准的散列关系之外，现在还有一个可遍历整个集合的链表。
In addition to the standard hashing relationship, there is now a linked list that traverses through the collection.
AXIOM允许很多不同的对象工厂实现，但链表是最常用的。
AXIOM allows many different object factory implementations, but the linked list is by far the most popular.
一开始看来，用这种方法表示一个空链表使代码简单。
It may at first appear that representing empty lists in this way makes the code simpler.
所以我只要不用刻意的除以，我有的是一个链表的链表。
So I just, inadvertently, divided by, I have a list of lists.
毕竟，我们不必仅仅为了空链表而去定义一个额外的类。
After all, we've saved the effort of having to define an extra class just for empty lists.
尽管使用链表人工管理内存是可行的，但那不是一件非常容易的工作。
Although manual memory management with linked lists is possible, it is not a very friendly task.
那时，执行一个不可变的链表是直截了当的，如清单6所示。
Implementation of the immutable lists is then straightforward, as shown in Listing 6.
在此示例中，我使用 “printlist”别名输出整个链表。
In this example, I have used the "printlist" alias to print the complete linked list.
在此示例中，我使用 “printlist”别名输出整个链表。
In this example, I have used the "printlist" alias to print the complete linked list.
应用推荐