You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi,
I was testing different bitmap libraries (by the way as a replacement for hash map)
The results i received for 8 and operations for 500k entities where first bitmap has 10k entities in a row with 1 bit, Clone of the bitmap is used on each operation
In your kelindar-column you have fill bitmap.Bitmap // The fill-list and Txn with sync.Pool usage which allow to avoid bitmap allocation. I believe the technique is worth mentioning for potential users of this library
@marniks7 Thanks, I'll add this to documentation. Any other suggestions on what to improve in bitmap or column packages? By the way, great work on marniks7/bitmap-usage!
Hi,
I was testing different bitmap libraries (by the way as a replacement for hash map)
The results i received for 8
and
operations for500k
entities where first bitmap has 10k entities in a row with1
bit,Clone
of the bitmap is used on each operationThis is what i received for https://github.com/kelindar/column
In your
kelindar-column
you havefill bitmap.Bitmap // The fill-list
andTxn
withsync.Pool
usage which allow to avoid bitmap allocation. I believe the technique is worth mentioning for potential users of this libraryResults with
sync.Pool
:if you are curious here is
hashmap
results - iteration and comparison for 10k entitiesThe text was updated successfully, but these errors were encountered: