mnemonist - Curated collection of data structures for the JavaScript language.

•    Javascript

---

Mnemonist is a curated collection of data structures for the JavaScript language. It gathers classic data structures (think heap, trie etc.) as well as more exotic ones such as Buckhard-Keller trees etc.

data-structure bag bimap bit-array bit-set bit-vector bitset bk-tree burkhard-keller-tree circular-buffer counter data-structures disjoint-set fibonacci-heap fuzzy-map hashed-array-tree heap interval-tree inverted-index linked-list multimap multiset queue sparse-set stack structures suffix-tree symspell trie union-find vantage-point-tree vector vp-tree

RoaringBitmap - A better compressed bitset in Java

•    Java

---

Roaring bitmaps are compressed bitmaps (also called bitsets) which tend to outperform conventional compressed bitmaps such as WAH or Concise.

bitset roaring-bitmaps roaringbitmap druid spark lucene

dsjslib - A library implementing several standard data structures and utilities, in JavaScript

•    Javascript

---

This is a collection of different data structures and utilities, implemented in JavaScript. Its written and tested using Node.js which is also the target platform.CircularBuffer - A data structure that uses a single, fixed-size buffer as if it were connected end-to-end. When the buffer is filled, new data is written starting at the beginning of the buffer and overwriting the old.

algorithms datastructures ds sort-map data-structures avl avltree trie ternarysearchtrie multiwaytrie skiplist btree binarysearch binarysearchtree sortedmap lru cache eviction maximize least-recently-used loading guava async delay-queue delayqueue priorityqueue heap binaryheap bitset bitarray bitvector circularbuffer ringbuffer graph directed undirected shortest cycle path topological bloomfilter bloom filter

EWAHBoolArray - A compressed bitmap class in C++.

•    C++

---

The class EWAHBoolArray is a compressed bitset data structure. It supports several word sizes by a template parameter (16-bit, 32-bit, 64-bit). You should expect the 64-bit word-size to provide better performance, but higher memory usage, while a 32-bit word-size might compress a bit better, at the expense of some performance.The library also provides a basic BoolArray class which can serve as a traditional bitmap.

bitmap bitset ewah compression

javaewah - A compressed alternative to the Java BitSet class

•    Java

---

The bit array data structure is implemented in Java as the BitSet class. Unfortunately, this fails to scale without compression. JavaEWAH is a word-aligned compressed variant of the Java bitset class. It uses a 64-bit run-length encoding (RLE) compression scheme. The goal of word-aligned compression is not to achieve the best compression, but rather to improve query processing time. Hence, we try to save CPU cycles, maybe at the expense of storage. However, the EWAH scheme we implemented is always more efficient storage-wise than an uncompressed bitmap (implemented in Java as the BitSet class). Unlike some alternatives, javaewah does not rely on a patented scheme.

bitset ewah bitmap-indexes

roaring - Roaring bitmaps in Go (golang)

•    Go

---

This is a go port of the Roaring bitmap data structure.Roaring bitmaps are used by several major systems such as Apache Lucene and derivative systems such as Solr and Elasticsearch, Metamarkets' Druid, LinkedIn Pinot, Netflix Atlas, Apache Spark, OpenSearchServer, Cloud Torrent, Whoosh, Pilosa, Microsoft Visual Studio Team Services (VSTS), and eBay's Apache Kylin.

roaring-bitmaps bitset compressed-bitset data-structure

bitset - Go package implementing bitsets

•    Go

---

Package bitset implements bitsets, a mapping between non-negative integers and boolean values. It should be more efficient than map[uint] bool.It provides methods for setting, clearing, flipping, and testing individual integers.

bitset data-structure collections go-collection

cbitset - A simple bitset library in C

•    C

---

Simple bitset library in C. It includes fast functions to compute cardinalities, unions, intersections...

bitset-library bitset

csharpewah - Compressed bitmaps in C#

•    CSharp

---

This is a compressed variant of the standard bitarray class. It uses a 64-bit RLE-like compression scheme. It can be used to implement bitmap indexes.The goal of word-aligned compression is not to achieve the best compression, but rather to improve query processing time. Hence, we try to save CPU cycles, maybe at the expense of storage. However, the EWAH scheme we implemented is always more efficient storage-wise than an uncompressed bitarray.

ewah bitmap compression bitset

FastBitSet.js - Speed-optimized BitSet implementation for modern browsers and JavaScript engines

•    Javascript

---

Speed-optimized BitSet implementation for modern browsers and JavaScript engines

bitset intersection union bitmap performance

sparsebitmap - A simple sparse bitmap implementation in java

•    Java

---

Alternative compressed bitmap implementations in Java such as JavaEWAH can be a bit overengineered. The goal of this project is to come up with a very simple alternative that has good performance.

bitset compression

SwiftBitset - A fast Bitset class in Swift

•    Swift

---

A bitset class in Swift for fast and concise set operations over integers. Works under both Linux and MacOS. It is engineered to be really fast, on par with portable C/C++ implementations.To dissamble a function...

bitset swift

CRoaring - Roaring bitmaps in C (and C++)

•    C

---

Bitsets, also called bitmaps, are commonly used as fast data structures. Unfortunately, they can use too much memory. To compensate, we often use compressed bitmaps.Roaring bitmaps are compressed bitmaps which tend to outperform conventional compressed bitmaps such as WAH, EWAH or Concise. They are used by several major systems such as Apache Lucene and derivative systems such as Solr and Elasticsearch, Metamarkets' Druid, LinkedIn Pinot, Netflix Atlas, Apache Spark, OpenSearchServer, Cloud Torrent, Whoosh, Pilosa, Microsoft Visual Studio Team Services (VSTS), and eBay's Apache Kylin.

roaring-bitmaps visual-studio clang gcc bitset bitset-library compressed-bitset data-structure

croaring-rs - Rust wrapper for CRoaring

•    Rust

---

Tested on Rust stable/beta/nightly and LLVM version 3.8.

roaring-bitmaps bitset compressed-bitset data-structure

PyRoaringBitMap - A Python wrapper over the C implementation of roaring bitmap.

•    Python

---

An efficient and light-weight ordered set of 32 bits integers. This is a Python wrapper for the C library CRoaring.If for some reason you wish to keep using the old version, based on Ctypes, use PyRoaring 0.0.7.

roaring-bitmaps bitset compressed-bitset data-structure

bit-array - JavaScript implementation of bit arrays.

•    Javascript

---

Even though bit arrays are not that useful in JavaScript, there is one place where they excel; encoding large boolean sets for transfer between the browser and server. A JSON representation of a bit array is much smaller than an actual boolean array. Alternatively you could just include bit-array.js in your project.

bit-array bit-vector bitset bitmap bitstring

BitSet.js - An arbitrary size Bit-Vector implementation in JavaScript

•    Javascript

---

BitSet.js is a infinite Bit-Array implementation in JavaScript. That means that if you invert a bit vector, the leading ones get remembered. As far as I can tell, BitSet.js is the only library which has this feature. It is also heavily benchmarked against other implementations and is the fastest implementation to date.NOTE: As of version v4.0.0, BitSet.js is mutable, which means that the object gets changed by method invocations. In order to work on explicit copies, use clone().

bit set twiddle bit-array binary bit-vector bitset bitmap bitstring bitwise

roaringbitmap - Roaring Bitmap in Cython

•    Python

---

A roaring bitmap is an efficient compressed datastructure to store a set of integers. A Roaring bitmap stores a set of 32-bit integers in a series of arrays and bitmaps, whichever takes the least space (which is always 2 ** 16 bits or less). This datastructure is useful for storing a large number of integers, e.g., for an inverted index used by search engines and databases. In particular, it is possible to quickly compute the intersection of a series of sets, which can be used to implement a query as the conjunction of subqueries.

roaring-bitmaps bitset cython datastructures

Bitter - A Swift Bits Manipulation/Bitwise Operations Toolkit

•    Swift

---

For a Swift 3.x compatible version, check out release 2.0.5 or the swift-3 branch. If you want to install Bitter manually just include all the Swift files in Sources/Bitter in your project or load it as a git submodule.

bitset bit-manipulation bitwise-operators

bitmap-elixir - Bitmap implementation in Elixir using binaries and integers

•    Elixir

---

In computing, a bitmap is a mapping from some domain (for example, a range of integers) to bits, that is, values which are zero or one. It is also called a bit array or bitmap index. This is an Elixir implementation of a bit array. Two implementations are provided as part of the library, Binary and Integer. Integers are the default due to clear performance superiority based on benchmarks provided below.

bitset bitmap elixir hex-package