其中一个标准的方法是使用所谓的链表。
One of the standard ways is to use what's called a linked list.
清单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.
这么做就允许多个线程同时搜索链表。
Doing so allows for multiple threads to search the list concurrently.
清单5给出链表搜索代码。
空链表的表示到底是什么呢？
然后初始化一个查找数据结构，这是一个链表。
A lookup data structure which is a linked list is then initialized.
比方说链表中的元素个数。
当一些线程正在迭代链表时，出现迭代请求。
Iteration requests come in while some threads are iterating the list.
处理程序链表示一个有序的处理程序清单。
它们被作为链表来使用。
链表的优势之一是，您可以使用它们来避免锁定状态。
One advantage of linked lists is that you can use them to avoid locking situations.
单链表是让您可以描述多种类型数据的一种有效抽象。
Singly linked lists are a powerful abstraction that allow you to represent numerous types of data.
使用这种具有链表的散列表可以提供最快速的查询功能。
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.
另外，这些链表的规模也会增加分析问题的难度。
Also, the size of these lists makes it more difficult to analyze the problem.
最初可以使用内存块的一个空链表来创建一个抽象缓冲区。
You can initially create an abstract buffer with an empty linked list of memory block.
然后，可以使用 dbx中的现有命令查看链表的内容。
Further, I can have a look at the linked list contents using the already available commands in dbx.
这个结构体包含一个指向链表第一个元素的指针。
This structure contains a single pointer to the first element on the list.
另外，某些锁问题或内存损坏可能会损坏这个链表。
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.
毕竟，我们不必仅仅为了空链表而去定义一个额外的类。
After all, we've saved the effort of having to define an extra class just for empty lists.
现在，我们来优化链表中的搜索元素—即find方法。
Now, let's move on to optimizing search elements in the list-that is, the find method. Here are a few potential situations that may occur.
现在，我们来优化链表中的搜索元素—即find方法。
Now, let's move on to optimizing search elements in the list-that is, the find method. Here are a few potential situations that may occur.
应用推荐