From dcfed6ebb63182c89fc72c3441306f2822e4868e Mon Sep 17 00:00:00 2001 From: Richard Artoul Date: Fri, 7 Dec 2018 16:00:49 -0500 Subject: [PATCH] fix grammar --- roaring/roaring.go | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/roaring/roaring.go b/roaring/roaring.go index 93aa65add..61827fc77 100644 --- a/roaring/roaring.go +++ b/roaring/roaring.go @@ -494,7 +494,7 @@ func (b *Bitmap) unionIntoTargetSingle(target *Bitmap, other *Bitmap) { // An additional optimization that this function makes is that it recognizes that even when // CPU support is present, performing the popcount() operation isn't free. Imagine a scenario // where 10 bitset containers are being unioned together one after the next. If every -// bitset<->bitset union operation needs to keep the containers cardinality up to date, then +// bitset<->bitset union operation needs to keep the containers' cardinality up to date, then // the algorithm will waste a lot of time performing intermediary popcount() operations that // will immediately be invalidated by the next union operation. As a result, we allow the cardinality // of containers to degrade when we perform the in-place union operations, and then when the algorithm