This function reads the XML and returns the data back as an array of hash tables.
该函数读取XML，并作为一组散列表返回数据。
In this case, I create an array of hash tables — a common method to store structured data such as this.
在本例中，我创建了一个散列表的数组——用来存储这类结构式数据的一种常见方法。
No modification is required to the drawbooks function, because the objects all have the same keys and values as the original hash tables.
不需要对drawbooks函数做任何修改，因为对象都有与原始的散列表相同的键和值。
When hash tables are built, join keys are pushed down and used to filter the rows of the fact table, and performance improves dramatically.
构建散列表时，连接键被下推用于过滤事实表的行，性能也显著提高。
Here, I set a variable called g_books to an array that contains three hash tables, where each hash table contains information about the book.
这里，我将名为g_books的变量设置为一个包含三个散列表的数组，每个散列表包含关于该书的信息。
The most common use for generic classes is with collections like linked lists, hash tables, stacks, queues, trees, and so on.
泛型类最常用于集合，如链接列表、哈希表、堆栈、队列、树等。
For example, suppose that you have a class that stores user information and service information in two separate hash tables, as shown in Listing 3.
例如，假设您有一个类，它用两个单独的散列表来存储用户信息和服务信息，如清单3所示。
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创建的匿名类型必须提供稳定的哈希码。
The object model often contains redundant information — for example, to speed searches in hash tables; redundant information means more validation of the XML document.
对象模型常常包含冗余信息，比如用散列表加快搜索的速度，而冗余信息却意味着XML文档需要更多的验证。
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.
比方说，如果在应用领域采用哈希表或者其他无序数据结构管理数据，可能会面临着将元素按照模式中的顺序设定重新装配的额外工作。
Throughout the years, many kinds of data structure had been proposed and applied, for instance, hash tables, binary search tree, digital search tree, ternary search tree and so on and so forth.
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
Hash tables are not organized to support either operation efficiently.
散列表无法高效率地支持这两种操作。
Hash tables are not organized to support either operation efficiently.
散列表无法高效率地支持这两种操作。
应用推荐