roaringrel 1.0.0.post2

Implementation of integer relations based on roaring bitmaps.

Contents

• Install

• Usage

• API

• License

This library implements as low-level mutable data structure to store a finite relation between finite sets:

\begin{equation*} R \subseteq X_1 \times ... \times X_n \end{equation*}

It presumes that the component sets \(X_1,...,X_n\) are finite zero-based contiguous integer ranges, in the form \(X_j = {0,...,s_j-1}\). The tuple \((s_1,...,s_n)\) of component set sizes is referred to as the shape of the relation \(R\), while the tuples \((x_1,...x_n) \in R\) are referred to as its entries.

Relations are implemented using a 64-bit roaring bitmaps. to store the underlying set of entries.

Install

You can install the latest release from PyPI as follows:

$ pip install roaringrel

Usage

For an overview of library features and usage, see https://roaringrel.readthedocs.io/en/latest/getting-started.html

API

For the full API documentation, see https://roaringrel.readthedocs.io/

License

LGPLv3 © Hashberg.