mirror of
https://github.com/featurebasedb/featurebase.git
synced 2026-09-07 09:05:55 +00:00
refactor comment for clarity
This commit is contained in:
parent
efd6116d3f
commit
3f3fec3824
1 changed files with 1 additions and 1 deletions
|
|
@ -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
|
||||
|
|
|
|||
Loading…
Add table
Reference in a new issue