A vector of bools implemented as compact byte array (8 bools per byte) for efficient storage

Module for printing text with line tracking and location output. This is useful for compilers and preprocessors that need to generate code that refers to locations in external files. The module allows tracking of code positions and can output directives indicating where the code was originally located in the source files.

Module for dynamic vectors, useful when the cardinal of a finite domain is not yet known.

Module for sets of indices. This module provides a type-safe abstraction over the underlying IntSet implementation.

Compressed sparse bit set represented as a linked list of bitmasks, such that elements from the same group of Sys.word_size - 1 are stored in a single cell.

An order chain is a data structure designed to incrementally construct a totally ordered set represented as an interval 0,n[. The order is progressively refined by accumulating constraints: - starting with a single element, - getting an element strictly larger than an existing one, - getting an element strictly larger than an existing one and strictly smaller than all existing elements that are larger. This data structure is used by the dynamic priority optimizations of LRGrep automata.

Refine computes the refined partition of a list of overlapping set: the smallest list of non-overlapping sets such that each set is a subset of one of the input set.