From de1ff6860548e8ca578144d24ab27e20f002ace8 Mon Sep 17 00:00:00 2001 From: zheng Date: Mon, 25 Nov 2013 22:56:23 +0800 Subject: [PATCH] continue to translate the referred comments in 'core algorithm deployed' --- {translated => sources}/Core algorithms deployed.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) rename {translated => sources}/Core algorithms deployed.md (99%) diff --git a/translated/Core algorithms deployed.md b/sources/Core algorithms deployed.md similarity index 99% rename from translated/Core algorithms deployed.md rename to sources/Core algorithms deployed.md index 60e3c8bab3..62daa41bf3 100644 --- a/translated/Core algorithms deployed.md +++ b/sources/Core algorithms deployed.md @@ -34,10 +34,10 @@ 8.[哈希函数][16]，参考了Knuth和一篇论文。 -> Knuth recommends primes in approximately golden ratio to the maximum integer representable by a machine word for multiplicative hashing. Chuck Lever verified the effectiveness of this technique: -> -> [http://www.citi.umich.edu/techreports/reports/citi-tr-00-1.pdf][17] -> +> Knuth recommends primes in approximately golden ratio to the maximum integer representable by a machine word for multiplicative hashing. Chuck Lever verified the effectiveness of this technique: +> +> [http://www.citi.umich.edu/techreports/reports/citi-tr-00-1.pdf][17] +> > These primes are chosen to be bit-sparse, that is operations on them can use shifts and additions instead of multiplications for machines where multiplications are slow. 9.一部分代码，比如[这个驱动][18],实现了他们自己的哈希函数。 @@ -94,7 +94,7 @@ 链接在这里([source code on Google code][40])。我只会列出一部分。我建议使用搜索来找到你最喜欢的算法或者数据结构。 1.[伸展树][41]。 - + > The tree is also parameterized by an allocation policy (Allocator). The policy is used for allocating lists in the C free store or the zone; see zone.h. 2.[Voronoi diagrams][42]用于一个示例。