Equativ.RoaringBitmaps

Equativ.RoaringBitmaps is a pure C# implementation of RoaringBitmap.

• ✨ Fully managed code! No risk of segfaults or memory leaks due to missed disposals.
• 🚀 Blazingly fast! See benchmarks.
• Portable: It works everywhere where .NET is supported.

Usage

dotnet add package Equativ.RoaringBitmaps

Example usage:

// Create bitmaps
var a = RoaringBitmap.Create([1, 2, 3, 4, 5]);
var b = RoaringBitmap.Create([4, 5, 6, 7]);

// Compute 'and' between bitmaps
var and = a & b;
//var or = a | b;
//var xor = a ^ b;
//var not = ~a;

// Retreive
int[] result = and.ToArray(); // [4, 5]

Performance

Here are some performance benchmarks. Make sure to run the benchmarks on your own hardware and in your own context/environment to get more meaningful results.
Benchmarks include numbers on Roaring.Net, which is a C# wrapper around the "official" CRoaring written in C.

Charts are generated using chartbenchmark.net.

Macbook pro M1 (ARM64)

(lower is better)

F.A.Q.

How can this be faster than the C implementation?

There can be a few reasons:

• Modern C# performs really well for this kind of workloads, it shall not be underestimated.
• Roaring.Net is wrapper, which means that there is a marshalling cost between C# and C.
• This implementation has a few optimizations that are not present in the C implementation, especially for ARM CPUs.