创建新的散列表。
The final nested hashtable is shown in Listing 5.
最后一个嵌套散列表如清单5所示。
How we do so depends on how we intend to use the Hashtable.
传递类型参数的方式取决于我们打算如何使用Hashtable。
Thus, the code to create the event hashtable is shown in Listing 6.
因此，创建事件散列表的代码如清单6所示。
A function used by a hashtable to compute the location for a key.
哈希函数：哈希表使用的一种函数，能计算出一个键的位置。
You have to construct a hashtable to contain the blog post information.
必须构造一个包含blog帖子信息的散列表。
The disk forms of Hashtable and HashMap are different and incompatible.
Hashtable和HashMap在磁盘上的格式是不相同、不兼容的。
Parses the property entry and stores it in a hashtable for future reference.
解析属性项并将它存储到一个hashtable中以便将来引用。
These two values will be lost after we get the object back from the hashtable.
这两个值将在我们的哈希表中得到对象返回值后被消除。
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中添加元素并从中检索元素。
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。
Table 1 gives a rough idea of the scalability differences between Hashtable and ConcurrentHashMap.
表1对Hashtable和ConcurrentHashMap的可伸缩性进行了粗略的比较。
Each SharedObject instance has a data property that can be thought of as a hashtable for storing data.
每个SharedObject实例都有一个数据属性，可以看作存储数据的哈希表。
The object is simply a hashtable or similar collection that stores object references as simple key-value pairs.
该对象只是将对象引用存储为简单键-值对的散列表或类似的集合。
The container, which is also a hashtable, and the queues are placed as objects in the container hashtable.
Container也是散列表，这些队列作为对象放入容器散列表中。
Perfecting hashing is difficult and to deal with that hashtable implementations support collision resolution.
要写出一个完美的哈希函数是很困难的，特别是要处理哈希表中的冲突。
When we create a new instance of a Hashtable, we have to pass type arguments to specify the types of Key and Value.
创建一个新的Hashtable实例时，必须传递类型参数以指定Key和Value的类型。
Figure 22 shows the type graph for the Hashtable referenced in the ownership chain under EvaluateServlet (Figure 20).
图22显示了EvaluateServlet（如图20 所示）下的所有链引用的Hashtable 的类型图。
Just think of the Preferences object as one big key-value hashtable that structures the keys in a tree-like structure.
只要把Preferences对象当作一个大的键—值散列表(这个表把树形结构中的键组织起来)。
For this specific example, it turned out that the primary culprit was a font manager class that contained a static hashtable.
就本例而言，最后查明罪魁祸首是包含一个静态hashtable的字体管理器类。
I mentioned earlier that a dictionary is implemented using a hashtable and that means that the keys have to be hashtable.
我之前说过，字典是用哈希表(散列表)来实现的，这就意味着所有键都必须是散列的。
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参数已用于从数据哈希表中搜索已存储的对象。
A simple way around this is to create a general purpose hashtable that provides a mechanism for storing and retrieving strings.
解决这个问题的一个简单方法是创建一个通用散列表，该表提供存储和检索字符串的一种机制。
For developers, S3 offers a minimalistic API that resembles a basic hashtable - allowing you to easily store and retrieve information.
S3给开发者提供了一个类似基本哈希表的最简化的API，它允许你轻松地存储和提取信息。
The various forms could be zoomed in or out independently, so the hashtable contained a vector with all of the fonts for a given form.
各个窗体可被单独放大或缩小，所以这个hashtable包含一个具有某个给定窗体的全部字体的vector。
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.
那么在给定的程序中，被用作键的元素类型和存储在散列表中的值类型，将不能是任意对象。
The code only changed from the previous example in only one place: the values placed in the PROVIDER_URL key of the environment Hashtable object.
相对于前一个示例，此代码仅在一个地方进行了更改：放在环境Hashtable对象的provider_url键中的值。
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的功能。
应用推荐