Index: ossp-pkg/act/act_hash_fct.c
RCS File: /v/ossp/cvs/ossp-pkg/act/act_hash_fct.c,v
rcsdiff -q -kk '-r1.25' '-r1.26' -u '/v/ossp/cvs/ossp-pkg/act/act_hash_fct.c,v' 2>/dev/null
--- act_hash_fct.c	2001/03/21 15:59:01	1.25
+++ act_hash_fct.c	2001/03/21 16:08:22	1.26
@@ -53,7 +53,7 @@
 ** buckets you already have to expect a collision).
 **
 ** Usually there are a gazillion more possible keys than buckets, so
-** the best any hash function can do is map an equal number of those
+** the best any hash function can do is to map an equal number of those
 ** gazillion keys to each bucket. The number of collisions you get is
 ** expected to follow the Chi^2 distribution.
 **
@@ -65,7 +65,7 @@
 **   5. Compute: Chi^2 = sum (over all i) (b_i*((i-p)^2)/p) 
 **
 ** The distribution is expected to have a result close to b, i.e.,
-** within 3sqrt(b) of b. Chi^2 measures are usually reported in units of
+** within 3*sqrt(b) of b. Chi^2 measures are usually reported in units of
 ** standard deviations. That is, if the formula above gives b+c*sqrt(b),
 ** they report c, and c is expected to be between -3 and 3.
 **