This linked list is called a PTE chain.
这个链表叫做pte链。
Design choices in a concurrent, singly linked list.
并发单向链表的设计方法。
The use of the hash table with linked list provides the quickest lookup.
使用这种具有链表的散列表可以提供最快速的查询功能。
Listing 1 shows the most basic concurrent, singly linked list interface.
清单1给出最基本的并发单向链表接口。
Vfs_vnodes is a linked list of all the vnodes for this mounted instance.
vfs_vnodes是这个装入实例的所有vnodes组成的链表。
At the highest level is the cache_chain, which is a linked list of the slab caches.
在最高层是cache_chain，这是一个slab缓存的链接列表。
In this example, I have used the "printlist" alias to print the complete linked list.
在此示例中，我使用 “printlist”别名输出整个链表。
You can initially create an abstract buffer with an empty linked list of memory block.
最初可以使用内存块的一个空链表来创建一个抽象缓冲区。
The linked list hash table contains information about the shared memory logging token pointers.
这个链表散列表包含有关共享内存日志标记指针的信息。
The problem arises when I try to create an XML Schema that describes the linked list structure.
当我试图创建一个描述链表结构的XMLSchema，问题产生了。
The solution in this case is to change the links in the linked list to also be weak references.
在这种情况下，解决办法就是也将链接列表中的链接更改 为弱引用。
Further, I can have a look at the linked list contents using the already available commands in dbx.
然后，可以使用 dbx中的现有命令查看链表的内容。
For instance, a thread waiting until items are added to a linked list may wake up to find the list empty.
比如，一个正在等待货物被加入到链表中的线程，当它被唤醒时可能发现链表是空的。
The master index is a linked list of all index entries in the IBM Informix Dynamic Server product manuals.
在IBMInformixDynamicServer产品手册中，主索引是所有索引条目的链接列表。
AXIOM allows many different object factory implementations, but the linked list is by far the most popular.
AXIOM允许很多不同的对象工厂实现，但链表是最常用的。
Now that the mutex is unlocked, other threads can access and modify the linked list, possibly adding items.
现在互斥对象已被解锁，其它线程可以访问和修改已链接列表，可能还会添加项。
The Buffer holds the information about a created abstract buffer, and it manages a linked list of memory blocks
Buffer包含关于已创建的抽象缓冲区的信息，它还管理内存块的一个链表
This program creates a linked list of few nodes, fills in the data, prints them, and finally deletes all the nodes.
此程序创建一个包含几个节点的链表，填充数据，输出它们，最后删除所有节点。
In addition to the standard hashing relationship, there is now a linked list that traverses through the collection.
除标准的散列关系之外，现在还有一个可遍历整个集合的链表。
The function in Listing 3 frees any memory blocks in the linked list, then frees the Buffer allocated by newBuffer().
清单3 中的函数释放链表中的所有内存块，然后释放由 newBuffer()分配的Buffer 。
If there is only a single mapping to the page, then a single pointer called "direct" can be used instead of a linked list.
如果只有一个到这个页的映射，那么可以用一个叫做“direct”的指针来代替链表。
If you structure a document as an append-only linked list, it allows you to easily revert changes back to previous states.
如果将一个文档作为只能添加（append-only） 的链表来构造，那么这会使您可以很轻松地将修改回复到先前的状态。
As shown in Listing 1, the virtual file system is maintained as a linked list of struct VFS, as denoted by the member vfs_next.
如清单1所示，由成员vfs_next指定，虚拟文件系统作为structvfs的链表进行维护。
Listing 2 shows two different serializations of the same linked list data structure serialized according to SOAP Encoding rules.
清单2展示了根据SOAPEncoding规则对相同链表数据结构进行序列化的2种不同的序列化。
The first DB2.OPEN_LOG call builds a linked list hash table as shown in Figure 1 from the logging tokens kept in the Shared memory.
第一个DB 2 . OPEN_LOG调用的功能是从共享内存中保存的日志标记来构建一个如图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指针。
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个字节。
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个字节。
应用推荐