Examples of using 链表 in Chinese and their translations into English
{-}
-
Political
-
Ecclesiastic
-
Programming
而且，浸入式链表不能直接保存内建类型（int没有link成员变量）。
这一次，泛型链表函数被转换成更少的malloc(这才是链表函数应有的方式，真的)。
This time the generic linked list functions got converted to become malloc-less(the way linked list functions should behave, really).链表是Lisp中最主要的数据结构之一，Lisp本身代码就是由链表构成的。
Linked lists are one of Lisp's major data structures, and Lisp source code is itself made up of 重要：要从链表foo复制项目到一个新的链表bar，你可以写bar=foo[:]。
侵入式链表灵活性更小，但如我们所见，也更有效率。
That makes intrusive lists less flexible but, as we have seen, also more efficient.除了数组和链表数据结构，字符串也是编程工作面试中的另一热点话题。
Along with array and linked list data structures, a string is another popular topic on programming job interviews.链表是Lisp中最主要的数据结构之一，Lisp本身代码就是由链表构成的。
Linked lists are one of the Lisp language's major data structures, and Lisp source code is itself made up of 同样的，链表[SnF,SnF->-FnS,FnS]是不一致的--这些句子不能全为真。
Equivalently, the list[SnF, SnF->-FnS, FnS] is inconsistent- these sentences cannot all be true together.如果有很多的元素，简单的数组还是会打败链表的，即使在插入和移动物体。
If there are not many elements, simple array may still beat lists, even when inserting/removing objects.另一方面，链表依赖于引用，其中每个节点由数据和对前一个和下一个元素的引用组成。
On the other hand, Linked list relies on references where each node consists of the data and the references to the previous and next element.首先，如果链表是空的，则给它的head和tail分配节点。
If the list is non empty, it matches them with the head and the tail.真正复杂的人工智能应用程序可能会使用定向和无向图，它们只是树和链表的一般化。
Really sophisticated artificial intelligence applications might use things like directed and undirected graphs, which are really just generalizations of trees and linked lists.要了解这里发生了什么事，我们需要知道链表是如何存储在计算机内存的。
To understand what is going on here, we need to know how lists are stored in the computer's memory.它将继续正确地工作直到链表包含一个项目，其中头=尾部项目。
It will continuously working correctly up until the Linked List contains one item where the head= the tail item.每个文档都进行预处理，使一个词链表变成一个整数链表。
Each document is preprocessed, so that a list of words becomes a list of integers.新的扩展属性子系统的第一个用途就是实现POSIX访问控制链表。
The first use of the new extended attribute subsystem is to implement POSIX access control lists.例如，要统计某一顾客的所有账户余额，我们需要遍历链表。
For example, to sum up all the account balances for a specific customer, we are required to traverse the linked list.写一个函数unknown()，以一个URL为参数，返回一个那个网页出现的未知词链表。
Write a function unknown() that takes a URL as its argument, and returns a list of unknown words that occur on that webpage.轮到你来：用乘法创建一个链表的链表：nested=[[]]*3。
Your Turn: Use multiplication to create a list of lists: nested=[[]]* 3.当一个进程必须等待信号量时，就被添加到进程链表。
When a process must wait on a semaphore, it is added to the list of processes.
