您可能见到过大整数质因数分解，或是对复杂数据结构的庞大列表进行分类，这些都是长时间运行的操作。
You might see examples of prime factorizations of large integers, or sorting huge lists of complex data structures, and those are certainly long running operations.
它还构建在外部描述的数据结构的概念之上，这是固定列表动态sql使用的主机变量的一种软编码方法。
It also builds upon the concept of externally described data structures, a way of soft coding the host variables used by fixed-list dynamic SQL.
如前所述，此列表应包含与聚合数据结构级别表(如图5所示)相同的顶级泄漏疑点。
As mentioned earlier, this list should contain the same top leak suspects as shown in the aggregated data structure level view (Figure 5).
在接下来两篇文章中，我们将探讨更强大、更方便的数据结构的应用：有序列表和随机访问字典。
In the next two articles, we'll explore the use of much more powerful and convenient data structures: ordered lists and random-access dictionaries.
从方法返回这种列表对于构建许多很常用的数据结构很有用。
Returning such a list from a method could be useful for building many very common data structures.
清单20显示了修改后的函数，它利用了几个列表数据结构和前面描述的各种列表操作函数的优势。
Listing 20 shows a new version of the function that takes advantage of several list data structures and the various list-manipulation functions described earlier.
选择要导入的导入者设置和数据结构的列表。
Select the importer settings and the list of data structures to be imported.
SPL中的新补充？php添加了一些有用的并且易于使用的功能，以及数据结构的实现，例如双重链接列表、栈、堆和队列。
The new additions to SPL add some useful functionality to PHP that is easy to use, as well as implementations of data structures, such as doubly linked lists, stacks, heaps, and queues.
然后是数据提取工具，可以从网页上的表格、列表和其他数据结构中提取数据。
Then there are the data extraction tools which allow you to extract data from tables, lists and other data structures on the webpage.
因为Python的类型是动态的，且具有简洁的数据结构语法，比如列表和字典，所以neo发现它通常可以减少代码行。
Since Python is dynamic typed and has concise syntax for data structures such as list and dictionary, Neo found it usually results in fewer lines of code.
当然，很少有Python程序员希望使用上面的诸如列表、元组和字典等日益复杂的数据结构。
Of course, few Python programmers want to work with increasingly complex forests of data structures like the lists, tuples, and dictionaries above.
Gperf的内部实现以两个内部数据结构为核心：关键字签名（keyword signatures）列表（Key_List）和关联值（associated values）数组（asso_values）。
Gperf's internal implementation centers on two internal data structures: the keyword signatures list (Key_List) and the associated values array (asso_values).
Haskell中最突出的三种数据结构是：tuple、列表(list)和用户定义的类型。
The three most prominent data structures in Haskell are tuples, lists, and user-defined types.
两个选项列表都是空的，这是我们所用的Web服务的数据结构的关系。
The list of both selections is empty, because of the data structure that is used by our Web services.
相反，Vimscript中的列表的序列是可变的，并且在很多情况下类似于匿名数组数据结构。
In contrast, lists in Vimscript are mutable and in many ways far more like (references to) anonymous-array data structures.
持久化基本链表数据结构是最简单的；在这里，Clojure中的一个列表绑定到一个名为“a”的变量。
Making a basic linked-list data structure persistent is the easiest exercise; here, a list in Clojure is bound to a var named "a".
Andrej在比较了强类型对象与基于列表的数据结构后，又转向对变量定义的讨论。
After a discussion about strongly typed objects versus list-based data structures, Andrej moves on to definitions verses variables.
更慢一点儿的数据结构是HashMap，然后是ThreadLocal(这基本上是一个以当前线程作为键的特殊散列表)。
The next-fastest data structure is HashMap, followed by ThreadLocal (essentially, a specialized hash table in which the current thread is the key).
从某种意义上说，您所想要的和列表上给出的是完全相反的：一个顺序不相关，但身份明确的数据结构。
What's wanted is, in a sense, the exact opposite of a list: a data structure where order is irrelevant, and identity is explicit.
这种组合不可避免地使许多程序员忽视了数据类型(如整型和浮点)和基本数据结构(如列表和映射)的缺陷。
The combination was irresistible enough that programmers could overlook the lack of data types like int and float and basic data structures like lists and maps.
使用适用于列表的列表节点数据结构。
访问控制列表(acl)： ACL是一种数据结构，它将一个服务的权限列表与一组主体相关联。
Access Control list (ACL) : An ACL is a data structure that associates to a set of principals a list of permissions for a service.
一开始，您创建了您的数据结构(my _ data_struct)，该结构包含一些数据和两个列表头。
At the start, you create your data structure (my_data_struct), which includes some data and then two list heads.
如果可行，他就可以在几小时之内，用Python整洁的列表和字典等数据结构，以及列表理解(list comprehension)等整洁的函数编程功能来编写这个代码。
If it was possible he could write it within a few hours with Python's neat data structures such as list and dictionary, neat functional programming features such as list comprehension.
描述路径的线性多边形列表对移动来说是一个灵活的数据结构，它可以局部调整寻路实体的移动位置。
Thelinear list of polygons describing the path is a flexible data structure forsteering, and it can be locally adjusted as the agent's position moves.
列表是数据结构的一个简单例子。
随后，此字符串将被传递给VectorSpace模块，并且数据散列的数据结构将依靠文件名来获得文件内的向量列表。
This string is then passed into the VectorSpace module, and a data hash data structure is keyed on the filename for the list of vectors within a file.
Clojure是一种Lisp变体，因此计算过程首先将一个表达式读取为Clojure数据结构(通常是一个列表)，随后计算数据结构中的各表达式。
Clojure is a Lisp variant, so evaluation occurs by first reading an expression as a Clojure data structure (usually a list), then evaluating each expression in the data structure.
Ruby散列表(或关联数组)是一种数据结构，允许您定义用于存储的键(而不是简单的数值索引)。
A Ruby hash (or associative array) is a data structure that allows you to define the key for storage (instead of a simple numerical index).
有序列表是最常见的线性数据结构之一。
应用推荐