The final nested hashtable is shown in Listing 5.
最后一个嵌套散列表如清单5所示。
To do this, you simply use a hashtable or a similar collection to store the XML documents.
为此，您只需使用一个hashtable或者一个类似的集合来存储XML文档。
If name does not correspond to a key in the hashtable, then null will simply be returned.
如果哈希表中没有与键值对应的名称，将返回null。
Each SharedObject instance has a data property that can be thought of as a hashtable for storing data.
每个SharedObject实例都有一个数据属性，可以看作存储数据的哈希表。
The container, which is also a hashtable, and the queues are placed as objects in the container hashtable.
Container也是散列表，这些队列作为对象放入容器散列表中。
Tests if this hashtable maps no keys to values.
测试哈希表是否有key到值的映射。
A function used by a hashtable to compute the location for a key.
哈希函数：哈希表使用的一种函数，能计算出一个键的位置。
All the structure of the hashtable itself is copied, but the keys and values are not cloned.
哈希表自身的结构被拷贝，但是键和值不拷贝。
Constructs a new, empty hashtable with the specified initial capacity and the specified load factor.
构建一个新的指定初始容量和装载因子的空哈希表。
Constructs a new, empty hashtable with a default initial capacity (11) and load factor, which is 0.75.
构建一个新的默认初始容量(11)的空哈希表，默认装载因子0.75。
The object is simply a hashtable or similar collection that stores object references as simple key-value pairs.
该对象只是将对象引用存储为简单键-值对的散列表或类似的集合。
Perfecting hashing is difficult and to deal with that hashtable implementations support collision resolution.
要写出一个完美的哈希函数是很困难的，特别是要处理哈希表中的冲突。
Constructs a new, empty hashtable with the specified initial capacity and default load factor, which is 0.75.
构建一个新的指定初始容量的空哈希表，默认装载因子0.75。
For this specific example, it turned out that the primary culprit was a font manager class that contained a static hashtable.
就本例而言，最后查明罪魁祸首是包含一个静态hashtable的字体管理器类。
A simple way around this is to create a general purpose hashtable that provides a mechanism for storing and retrieving strings.
解决这个问题的一个简单方法是创建一个通用散列表，该表提供存储和检索字符串的一种机制。
In this case, the SharedObject is looked up, and the name parameter is used to look up the saved object from the data hashtable.
本例中，已搜索到SharedObject，并且name参数已用于从数据哈希表中搜索已存储的对象。
This method is called automatically when the number of keys in the hashtable exceeds this hashtable's capacity and load factor.
当哈希表中key的数量超出哈希表的容量和加载因子时自动调用该方法。
For developers, S3 offers a minimalistic API that resembles a basic hashtable - allowing you to easily store and retrieve information.
S3给开发者提供了一个类似基本哈希表的最简化的API，它允许你轻松地存储和提取信息。
In a given program, the types of elements we use as keys, and the types of values we store in the hashtable, will not be arbitrary objects.
那么在给定的程序中，被用作键的元素类型和存储在散列表中的值类型，将不能是任意对象。
After tracing back through the list of referrers, I found that the root node was a static hashtable that stored the fonts in use for each form.
通过逆向追踪引用者列表，我发现根节点是用来存储每个窗体所用字体的一个静态hashtable。
This will confirm that I can add and then retrieve values from the hashtable-a simple test, but one that showcases the capabilities of NUnit.
这将确认我可以首先向Hashtable中添加值并随后检索相应的值—这是一个很简单的测试，但能够表现NUnit的功能。
Therefore, this static hashtable, which essentially existed for the life of the application itself, was never removing the keys that referenced each form.
因此，这个静态hashtable（在应用程序的生存期内一直存在）永远不会删除引用每个窗体的那些键。
Google's GAE documentation describes Bigtable as a sharded, sorted array, but I find it easier to think of it as a gigantic hashtable chunked out across a bazillion servers.
Google的GAE文档将Bigtable描述为一个分散的排序阵列，但是我发现将它描述为一个巨大的分布在无数服务器的哈希表更好理解。
Job parameters are stored in a hashtable and are passed to the device class plug-in code when the job is executed. Create a job object for setting job definition attributes as shown below.
作业参数存储在哈希表中，并当作业执行时将其发送到设备类的插件代码中。
Unlike the new collection implementations, Hashtable is synchronized.
和其他新的集合实现不同，Hashtable是同步化的。
The disk forms of Hashtable and HashMap are different and incompatible.
Hashtable和HashMap在磁盘上的格式是不相同、不兼容的。
The tag works like a Hashtable, defining a key/value pairing to set the properties.
标签就像一个Hashtable，它定义一个键 /值对来设置属性。
For example, suppose we are adding and retrieving elements to and from a Hashtable.
例如，假定往Hashtable中添加元素并从中检索元素。
Table 1 gives a rough idea of the scalability differences between Hashtable and ConcurrentHashMap.
表1对Hashtable和ConcurrentHashMap的可伸缩性进行了粗略的比较。
An instance of Hashtable has two parameters that affect its performance: initial capacity and load factor.
Hashtable实例有两个参数影响它的性能：初始容量和加载因子。
应用推荐