From 3f3fec38249d95953f80be289f7d5f5e7900a5a2 Mon Sep 17 00:00:00 2001 From: Richard Artoul Date: Thu, 29 Nov 2018 16:36:38 -0500 Subject: [PATCH] refactor comment for clarity --- roaring/roaring.go | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/roaring/roaring.go b/roaring/roaring.go index 584a614df..b295ebec0 100644 --- a/roaring/roaring.go +++ b/roaring/roaring.go @@ -485,7 +485,7 @@ func (b *Bitmap) unionIntoTargetSingle(target *Bitmap, other *Bitmap) { // In the naive approach, we had to allocate two containers, whereas in the optimized approach // we only had to allocate one container, and we also had to perform less union operations. This // example is simplistic, but the impact in terms of CPU cycles and memory allocations achieved -// by using the optimized alogorithm when working with a large number of large bitmaps is huge. +// by using the optimized alogorithm when unioning many large bitmaps can be huge. // // 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