In data structures, a collection of trees.
数据结构中的一种树型结构的集合。
The binding information in the name server database is stored in data structures called as towers.
名称服务数据库中的绑定信息存储在称为塔的数据结构中。
These root references are essentially globals, and are usually stored in data structures called root stacks.
这些根参考本质上是全局的。用来存储被称为根堆(root stacks)的数据结构。
They also have some built-in data structures like arrays, hashes, and some sort of support for record-like structures.
它们还有一些内嵌的数据结构，像数组、哈希表和对像记录一样的结构的某种支持。
The goal of ElementTree is to store representations of XML documents in data structures that behave in much the way you think about data in Python.
ElementTree的目标是以数据结构的形式存储XML文档的表示，这些数据结构的行为方式同您在 Python 中考虑数据的方式非常相似。
Document data structures in the model.
在模型中文档化数据结构。
As discussed at the beginning of this article, feed sources information can be specified in the program data structures, in a database table, or in a file.
我们在本文的一开始就提到过，提要源信息可以在程序数据结构中、数据库表中或一个文件中指定。
There is more volatility in mid-market businesses and their business data structures than there is in enterprise business data.
在中间市场的业务及其业务数据结构中，存在比企业业务数据中更多的易变性。
In order to support data structures like hash tables and query operations like grouping, anonymous types created by LINQ must provide stable hash codes.
为了支持类似哈希表的数据结构和像分组这样的查询操作，由LINQ创建的匿名类型必须提供稳定的哈希码。
If calling code ignored the API and manipulated data structures in the library code, this independence would be lost since a change in the library's implementation might break the misbehaving client.
如果调用代码忽略api并处理库代码中的数据结构，那么将丧失这种独立性，因为库实现中的改变可能破坏行为失常的客户端。
This article, the first in a two-part series, discusses the design of concurrent data structures in a multithreaded environment.
本文是两篇系列文章的第一篇，讨论如何在多线程环境中设计并发数据结构。
Data structures are grouped together in each dump and then matched and compared across the primary and baseline dump to identify suspected data structures experiencing large amount of growth.
数据结构被分组到每个转储中，然后在主转储和基线转储之间进行匹配与比较，以确定大量增长的可疑数据结构。
And most languages have a way to persist data structures in XML.
而且大多数语言都有以xml保存数据结构的方法。
The comparative analysis identifies a set of data structures experiencing significant growth in the number of instances of constituent data types.
比较分析确定一组数据结构，它们在许多组成数据类型的实例数目方面快速增长。
The comparative analysis technique identifies a set of large sized data structures experiencing significant growth in the number of instances of constituent data types.
比较分析技术确定一组大规模数据结构，它们在许多组成数据类型的实例数目方面快速增长。
This is done by representing the data in the most elementary of structures -- a byte stream also known as an octet stream.
这是通过用最基本的结构表示数据来完成的，最基本的结构就是字节流，也就是八位元流。
To make life easier (and it is good practice anyway), we make sure that all data is reachable from the root of a single tree of data structures in memory.
为了让生活更容易（它总是一个很好的实践），我们必须确保所有的数据从单一数据结构书的根上是可获得的。
The first view you will see is a bar chart showing the most costly data structures in the heap.
您看到的第一个视图就是显示堆中成本最高的数据结构的柱形图。
For example, if you manage data in hash tables or other unordered data structures in the application domain, you might face additional work re-assembling elements into the order set by a schema.
比方说，如果在应用领域采用哈希表或者其他无序数据结构管理数据，可能会面临着将元素按照模式中的顺序设定重新装配的额外工作。
In summary, there are a range of interrelated models used to analyze and define the data structures involved in service contracts, software implementations of those services, and the data platform.
总之，有很多相关的模型可用于分析和定义服务约定、服务的软件实现和数据平台中涉及的数据结构。
They are generally diagnosed by examining the state of various data structures in the application or middleware to determine if some aspect of that state is incorrect.
一般，通常检查应用程序或中间件中各种数据结构的状态即可确定该状态的错误因素。
They differ in specific low-level data structures, but they are semantically identical, storing the exact same information.
它们在特定的底层数据结构上有区别，但这些结构体在语法上一致的，存储完全相同的信息。
This section describes the actual data structures and algorithms in a little more detail.
本节较为详细地描述了实际的数据结构和算法。
Data is written to these files in special structures known as pages.
数据在写入文件时具有特定的结构，称为页面。
Creating an entire DSL just to hold simple data structures (like lists of ingredients and directions) seems like a bit of overkill; why not just keep this information in standard data structures?
创建一个完整的DSL只是为了保持简单的数据结构（如成分和方向的清单）好像有点大材小用了；为什么不干脆在标准的数据结构中保留此信息呢？
This means that it is much easier to write multi-threading applications in functional languages because immutable data structures inherently interact cleanly with threads.
这意味着以函数式语言编写多线程应用程序要容易得多，因为不可变数据结构与线程交互起来非常自然，因而代码可以很简洁。
Rather than store data in rigid structures like tables, they store data in loosely defined documents.
与在类似于表的固定结构中存储数据不同，面向文档的数据库在松散定义的文档中存储数据。
Take away the domain (in this case, data structures) and replace it with something else (say, a call center application) and the exercise is similar.
如果把这里的领域(即数据结构)换成其它领域(例如一个呼叫中心应用程序)，以上应用仍然类似。
The three most prominent data structures in Haskell are tuples, lists, and user-defined types.
Haskell中最突出的三种数据结构是：tuple、列表(list)和用户定义的类型。
The three most prominent data structures in Haskell are tuples, lists, and user-defined types.
Haskell中最突出的三种数据结构是：tuple、列表(list)和用户定义的类型。
应用推荐