Making a basic linked-list data structure persistent is the easiest exercise; here, a list in Clojure is bound to a var named "a".
持久化基本链表数据结构是最简单的；在这里，Clojure中的一个列表绑定到一个名为“a”的变量。
ArrayList is a particular type of list, storing its contents in an allocated array, whereas LinkedList USES a linked-list implementation instead.
ArrayList是List的具体类型，在分配好的数组中存储内容，而LinkedList使用的是链表实现。
In addition, because logical partitions are defined in a linked-list structure, damage to one of them can block access to the remaining logical partitions.
另外，由于逻辑分区以一种链接表结构定义，如果一个逻辑分区损坏，就会阻止对剩余的逻辑分区的访问。
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.
这些最小尺寸比大部分人期望的大许多——它们可能导致巨大的浪费，例如，在分配许多小链表节点的应用程序中。
One of the standard ways is to use what's called a linked list.
其中一个标准的方法是使用所谓的链表。
A linked list can be used to store this information.
可以使用相连的列表存储这些信息。
Each scheduler class is linked with one another in a singly linked list, allowing the classes to be iterated (for example, for the purposes of enablement of disablement on a given processor).
每个调度器类都在一对一连接的列表中彼此相连，使类可以迭代(例如，要启用给定处理器的禁用)。
For instance, a thread waiting until items are added to a linked list may wake up to find the list empty.
比如，一个正在等待货物被加入到链表中的线程，当它被唤醒时可能发现链表是空的。
The solution in this case is to change the links in the linked list to also be weak references.
在这种情况下，解决办法就是也将链接列表中的链接更改 为弱引用。
One we referenced earlier is the implementation of a doubly linked list in the Spl class SplDoublyLinkedList.
我们前面提到一个类就是在spl类spldoublylinkedlist中实现的双重链接列表。
The fh:prev element creates what is essentially a linked list of entries.
prev元素创建本质上是一个链接列表的条目。
The master index is a linked list of all index entries in the IBM Informix Dynamic Server product manuals.
在IBMInformixDynamicServer产品手册中，主索引是所有索引条目的链接列表。
At the highest level is the cache_chain, which is a linked list of the slab caches.
在最高层是cache_chain，这是一个slab缓存的链接列表。
You can initially create an abstract buffer with an empty linked list of memory block.
最初可以使用内存块的一个空链表来创建一个抽象缓冲区。
This program creates a linked list of few nodes, fills in the data, prints them, and finally deletes all the nodes.
此程序创建一个包含几个节点的链表，填充数据，输出它们，最后删除所有节点。
So to construct a nonblocking linked list, tree, or hash table, we need to find a way to update multiple Pointers with CAS without leaving the data structure in an inconsistent state.
所以，要构建一个非阻塞的链表、树或哈希表，需要找到一种方式，可以用CAS更新多个指针，同时不会让数据结构处于不一致的状态。
The use of the hash table with linked list provides the quickest lookup.
使用这种具有链表的散列表可以提供最快速的查询功能。
A lookup data structure which is a linked list is then initialized.
然后初始化一个查找数据结构，这是一个链表。
The linked list hash table contains information about the shared memory logging token pointers.
这个链表散列表包含有关共享内存日志标记指针的信息。
Thus, if I were to write a schema to represent my particular linked list, there is no guarantee that another person will read my schema and extract from it the same data model.
因此，如果我写了一个只代表我特别链表的模式，就不能保证有其他人会读我的模式并从中提取相同的数据模型。
Listing 1 shows the most basic concurrent, singly linked list interface.
清单1给出最基本的并发单向链表接口。
Notice how like our recursive programs, the definition of a linked list also contains a base case -- in this case, the NULL pointer.
注意，与我们的递归程序非常类似，链表的定义也包括一个基线条件 ——在这里是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).
链表所包含的节点结构体由两部分构成：它所持有的数据，以及指向另一个节点结构体(或者是NULL，结束链表)的指针。
Now that the mutex is unlocked, other threads can access and modify the linked list, possibly adding items.
现在互斥对象已被解锁，其它线程可以访问和修改已链接列表，可能还会添加项。
An alternative is a data storage method called a linked list, in which each piece of data includes a "pointer" that indicates the location of the next piece.
另外一个数据存储方式叫链接，通过在数据节点中增加一个指向下一个节点的指针来对数据进行存储。
For example, a linked list on a system with 4-byte Pointers might allocate nodes holding only, say, two Pointers, requiring only 8 bytes.
例如，一个链表在指针为4字节的系统上可能分配只包含两个指针的节点，也就是说只需要8个字节。
In addition to the standard hashing relationship, there is now a linked list that traverses through the collection.
除标准的散列关系之外，现在还有一个可遍历整个集合的链表。
In other words, new items are added to the end, and map lookups move items to the end of the linked list.
换句话说，新项目被添加到尾部，映射表查找操作将项目移到链表的尾部。
In other words, new items are added to the end, and map lookups move items to the end of the linked list.
换句话说，新项目被添加到尾部，映射表查找操作将项目移到链表的尾部。
应用推荐