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缓存的链接列表。
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产品手册中，主索引是所有索引条目的链接列表。
Given a linked list, return the node where the cycle begins.
给定一个链表，返回循环的起始节点。
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的链表进行维护。
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指针。
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看上去的样子，它必须代表根本的数据结构：链表。
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。
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.
另外一个数据存储方式叫链接，通过在数据节点中增加一个指向下一个节点的指针来对数据进行存储。
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.
通常的解决办法是为每一个哈希值指向一个链表，用于存放所有哈希冲突的值；
In the case of malloc, havoc can result for the process, because malloc usually maintains a linked list of all its allocated area and it may have been in the middle of changing this list.
如果是调用malloc，则进程会被严重破坏，因为malloc通常会为所有它所分配的区域维持一个链表，而它又可能正在修改那个链表。
The client that reads my schema must be able to understand that I am describing such a linked list structure and thus must accept all possible versions of the XML that de-serialize to the same graph.
读取我模式的客户机必须能理解我在描述这样一个链表结构，并且必须接受所有可能的反序列化相同图的XML版本。
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.
给定一个链表，其中的节点包含一个额外的随机指针，可能指向链表中的任意一个节点或者为空。
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，结束链表)的指针。
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.
另外，由于逻辑分区以一种链接表结构定义，如果一个逻辑分区损坏，就会阻止对剩余的逻辑分区的访问。
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.
另外，由于逻辑分区以一种链接表结构定义，如果一个逻辑分区损坏，就会阻止对剩余的逻辑分区的访问。
应用推荐