All of this is vaguely endearing and even consoling-a little like watching a giant computer hash up some simple arithmetic.
所有这一切都让人隐隐地感到喜爱与宽慰就好像一台超级计算机无法搞定一些简单幼稚的数学题一样。
Each instance has to initialize its own cache, but it only caches the references it USES, and is able to access the reference directly rather than having to look it up in a hash map.
每个实例必须初始化其自身的缓存,但它只缓存那些它要使用的引用,并且可以直接访问引用而不是要到一个散列映射中去寻找。
This hash is created for every keyword, so old results don't show up.
这个散列为每一个关键字创建,所以旧的结果不会显示。
There's been a lot of work done on these over the years, but in fact, it's pretty hard to invent a good hash function. So my advice to you is, if you want to use something was a hash, go to a library. Look up a good hash function.
已经做过了很多的尝试和努力,但是事实是,很难发明出一个好的哈希函数,所以我给你们的建议是,如果你们想使用哈希功能,到函数库中查找一个好的哈希函数。
Now at Harvard Thinks Big I happened to tear into this thing myself and it would seem a little pointless to re-hash that same demo so instead I thought I'd solicit an ideally sufficiently strong volunteer to come on up.
现在在“哈佛大梦想”的讨论会上,我反复思考这件事,觉得再演示一遍似乎意义不大,因此我想找一位合适的志愿者,上讲台来。
应用推荐