Improve doc for And/Or

filter.go

@@ -123,13 +123,13 @@ func (f *Filter) Count() int64 {
 }
 
 // And returns a new Bloom filter that consists of all elements
-// that belong to both f1 and f2. It requires two filters with
-// the same size and the same false-positives rate.
+// that belong to both f1 and f2. The two filters must be of
+// the same size and have the same false-positives rate.
 //
-// The false-positive rate of the resulting filter is at most
-// the false-positive rate of f1 and f2, but may be larger than
-// the rate of the filter created from scratch using the intersection
-// of the two sets.
+// The false-positive rate of the resulting filter is bounded by
+// the maximum false-positive rate of f1 and f2, but it may be larger
+// than the rate of the filter created from scratch using
+// the intersection of the two sets.
 func (f1 *Filter) And(f2 *Filter) *Filter {
 	if len(f1.data) != len(f2.data) || f1.lookups != f2.lookups {
 		panic("operation requires filters of the same type")
@@ -154,8 +154,8 @@ func (f1 *Filter) And(f2 *Filter) *Filter {
 }
 
 // Or returns a new Bloom filter that consists of all elements
-// that belong to either f1 or f2. It requires two filters with
-// the same size and the same false-positives rate.
+// that belong to either f1 or f2. The two filters must be of
+// the same size and have the same false-positives rate.
 //
 // The resulting filter is the same as the filter created from scratch
 // using the union of the two sets.