在上面的示例中，如果使用一个简单的散列图(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.

youdao

该方法称作DigestSearch是因为它使用惟一摘要(单向散列)值来表示一个搜索字。

The method is called DigestSearch because it USES the unique digest (one-way hash) value to represent a search word.

youdao

我使用从FreeDB搜索中返回的数据来生成带有适当元素的匿名散列。

I use the data returned from the FreeDB search to make an anonymous hash with the appropriate elements.

youdao