Why does each node in this Trie contain a linked list?
为什么每个节点在这种树包含一个链接列表？
Given a linked list, return the node where the cycle begins.
给定一个链表，返回循环的起始节点。
The fh:prev element creates what is essentially a linked list of entries.
prev元素创建本质上是一个链接列表的条目。
Vfs_vnodes is a linked list of all the vnodes for this mounted instance.
vfs_vnodes是这个装入实例的所有vnodes组成的链表。
The program stores birthdate information in a linked list of Client blocks.
程序会将生日资讯储存在用户端区块的已连结清单中。
At the highest level is the cache_chain, which is a linked list of the slab caches.
在最高层是cache_chain，这是一个slab缓存的链接列表。
In this article, 3 different methods of reversing a linked list are demonstrated.
在本文中，3扭转链表不同的方法证明。
Implement an algorithm to sort a linked list. Why did you pick the method you did?
实现算法分类一个链表。你为什么挑你做的方法？
The master index is a linked list of all index entries in the IBM Informix Dynamic Server product manuals.
在IBMInformixDynamicServer产品手册中，主索引是所有索引条目的链接列表。
For instance, a thread waiting until items are added to a linked list may wake up to find the list empty.
比如，一个正在等待货物被加入到链表中的线程，当它被唤醒时可能发现链表是空的。
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.
除标准的散列关系之外，现在还有一个可遍历整个集合的链表。
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”的指针来代替链表。
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的链表进行维护。
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指针。
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 is given such that each node contains an additional random pointer which could point to any node in the list or 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个字节。
This means the schema must represent more than simply what the XML looks like, it must represent the essence of the data structure: a linked list.
这意味着模式必须不仅仅代表XML看上去的样子，它必须代表根本的数据结构：链表。
If you access elements by index, a linked list is not a good solution: you have to traverse the list from the beginning, so it is an o (n) operation.
如果你访问元素的索引，一个链表是不是一个好办法：你必须遍历列表的开始，所以这是一个O (n)的操作。
This gives us all sorts of exciting new things to deal with; in particular, a linked list of JPEG files that are queued for uploading and some pthread code.
这会导致需要处理一些新的事情，特别是，针对上传进行排列的JPEG文件链接列表和一些pthread代码。
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.
另外一个数据存储方式叫链接，通过在数据节点中增加一个指向下一个节点的指针来对数据进行存储。
To illustrate the problem, imagine a Web service that returns a linked list data structure which we serialize to XML using the SOAP Section 5 Encoding rules.
要说明这个问题，请想象一个Web服务，它返回一个链表数据结构，我们可以使用SOAPSection5Encoding规则将次结构序列化为XML。
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，结束链表)的指针。
Normally, this is solved by each entry in the hash table being a pointer to a linked list, and the linked list would hold all the entries that hash to that same value.
通常的解决办法是为每一个哈希值指向一个链表，用于存放所有哈希冲突的值；
For each possible sequential table representation you will need a representation for the cursor. Three example representations are by an array, a linked list and a file.
对于每个可能的顺序表表示法，您都会需要一个光标的表示法。一个数组，一个链表和一个文件是表示法的三个例子。
For each possible sequential table representation you will need a representation for the cursor. Three example representations are by an array, a linked list and a file.
对于每个可能的顺序表表示法，您都会需要一个光标的表示法。一个数组，一个链表和一个文件是表示法的三个例子。
应用推荐