Update lib/elixir/lib/hash_dict.ex

José Valim · José Valim · commit 8e22a2c0745b · 2013-01-24T10:44:54.000-07:00
Update comments
diff --git a/lib/elixir/lib/hash_dict.ex b/lib/elixir/lib/hash_dict.ex
@@ -17,17 +17,17 @@ defmodule HashDict do
   # per bucket. We use bit shifting to make rehashing faster on
   # expansion.
   #
-  # However, compared to dict, it provides many enhancements:
+  # Compared to dict, it provides many enhancements:
   #
   # 1. HashDict buckets are ordered sets, this gives us faster access
   #    and modification times
   #
   # 2. It uses phash2 to calculate the hash (instead of phash)
   #
   # 3. The dictionary first starts with a single bucket, instead of
-  #    a set of buckets with 16 buckets. This allow us to skip hashing
-  #    altogher for small dictionaries, providing faster operations
-  #    and reducing memory consumption
+  #    a set of 8 buckets. This allow us to skip hashing altogher
+  #    for small dictionaries, providing faster operations and
+  #    reducing memory consumption
   #
   # 4. Once we reach 8 elements, the dictionary is promoted to a
   #    set of buckets

Original file line number	Diff line number	Diff line change
`@@ -17,17 +17,17 @@ defmodule HashDict do`
`17`	`17`	`# per bucket. We use bit shifting to make rehashing faster on`
`18`	`18`	`# expansion.`
`19`	`19`	`#`
`20`		`- # However, compared to dict, it provides many enhancements:`
	`20`	`+ # Compared to dict, it provides many enhancements:`
`21`	`21`	`#`
`22`	`22`	`# 1. HashDict buckets are ordered sets, this gives us faster access`
`23`	`23`	`# and modification times`
`24`	`24`	`#`
`25`	`25`	`# 2. It uses phash2 to calculate the hash (instead of phash)`
`26`	`26`	`#`
`27`	`27`	`# 3. The dictionary first starts with a single bucket, instead of`
`28`		`- # a set of buckets with 16 buckets. This allow us to skip hashing`
`29`		`- # altogher for small dictionaries, providing faster operations`
`30`		`- # and reducing memory consumption`
	`28`	`+ # a set of 8 buckets. This allow us to skip hashing altogher`
	`29`	`+ # for small dictionaries, providing faster operations and`
	`30`	`+ # reducing memory consumption`
`31`	`31`	`#`
`32`	`32`	`# 4. Once we reach 8 elements, the dictionary is promoted to a`
`33`	`33`	`# set of buckets`