在上面的示例中，如果使用一个简单的散列图(hashmap)或二进制搜索树就可以轻易地解决问题，但是用XSL实现一个这样的数据结构并不是很方便，并且是不必要的。
In the above example, a simple hashmap or binary search tree could have easily solved the problem, but implementing one of these data structures in XSL would be inconvenient and unnecessary.
该方法称作DigestSearch是因为它使用惟一摘要(单向散列)值来表示一个搜索字。
The method is called DigestSearch because it USES the unique digest (one-way hash) value to represent a search word.
我使用从FreeDB搜索中返回的数据来生成带有适当元素的匿名散列。
I use the data returned from the FreeDB search to make an anonymous hash with the appropriate elements.
搜索结果被保存到一个散列映射中以进行排序、分类和筛选。
The search results are saved into a hash map for sorting, categorizing, and filtering.
完美散列函数是一种在时间和空间方面都十分高效的静态搜索集实现。
Perfect hash functions are time- and space-efficient implementations of static search sets.
稍后将在程序中搜索这些键，并且它们的最后记录时间将作为“event”散列元素的值存储。
These keys will be searched for later in the program and their last recorded time stored as the value of the "event" hash element.
第一个for循环将搜索目前没有绑定管道的窗口散列中的已有条目。
The first for loop searches for a pre-existing entry in the Windows hash that does not currently have a pipe attached to it.
Twitter搜索结果以一个散列引用的方式返回，除搜索结果本身外，还包含一个页面计数和其他字段。
Twitter search results are returned in a hash reference with a page count and other fields besides the search results themselves.
声明局部变量后，子例程将遍历每个指定查询词，搜索name或jobresponsibilities散列中的变音位匹配。
After the local variable declaration, the subroutine will make a pass through every query word specified searching for a metaphone match in the name or jobresponsibilities hashes.
声明局部变量后，子例程将遍历每个指定查询词，搜索name或jobresponsibilities散列中的变音位匹配。
After the local variable declaration, the subroutine will make a pass through every query word specified searching for a metaphone match in the name or jobresponsibilities hashes.
应用推荐