# simongog/sdsl-lite

Succinct Data Structure Library 2.0

Repository: https://github.com/simongog/sdsl-lite
Canonical: https://ross.abutalabs.com/products/sdsl-lite
Language: C++
License: NOASSERTION
License Family: other
Last push: 2023-06-02T21:07:10+00:00

## Health v2 (maintenance only)
Score: 23/100 (v2, computed 2026-09-03T02:20:16.233290+00:00)
- activity 0, release rhythm 8, longevity 100
- inputs: {"age_days": 4934, "days_push": 1188, "days_rel": null, "gap_med": null, "n_releases_24m": 0}
- flags: no_license
- formula: round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10)

## Adoption (not part of the score)
Stars 2310, forks 362 (observed 2026-08-28T04:06:36.037408+00:00)

## What it is
A C++11 library implementing succinct data structures such as bitvectors with rank/select, wavelet trees, compressed suffix arrays, and compressed suffix trees. It stores data near the information-theoretic lower bound while supporting efficient query operations, with serialization and memory analysis tooling.

## Use cases
- build compressed full-text indexes over large text collections
- store bitvectors supporting fast rank and select queries in minimal space
- implement wavelet trees for range queries on integer sequences
- construct compressed suffix arrays and suffix trees for string search
- serialize large succinct indexes to disk and reload them efficiently
- analyze memory usage of compact data structures

## When to choose
- you need space-efficient data structures close to the information-theoretic lower bound
- you are building text indexing or bioinformatics tools in C++
- you want research-grade implementations of succinct structures from published literature
- you need to handle datasets larger than available RAM via compact representations

## When to avoid
- you need simple general-purpose containers rather than specialized compact structures
- your project is not C++ or requires a permissive license (license is non-standard)
- you need actively developed features or quick bug-fix turnaround
- you want high-level APIs without understanding bit-level data structure internals

## Facets
- artifact type: library
- maturity: maintenance
- function: serialization, search-engine, developer-tools
- domain: data-science, developer-tools
- platform: cpp, windows, cross-platform
- tags: succinct-data-structures, compressed-suffix-arrays, wavelet-trees, rank-select, bitvectors, suffix-trees, c++11, algorithms, search, linux, macos

## Member repositories
- simongog/sdsl-lite (main) score 23

## Provenance
- Observed fields: from GitHub, fetched 2026-08-28T04:06:36.037408+00:00.
- Health v2: computed from the inputs above; adoption is never an input.
- Inferred fields (summary, facets, guidance): AI-extracted, prompt v1, taxonomy v1, on 2026-08-30T02:39:34.293975+00:00, confidence not recorded.
  - readme: https://github.com/simongog/sdsl-lite (fetched 2026-08-28T04:06:36.037408+00:00, sha 63eb976b286f)
- Data as of 2026-08-30T08:39:29.467469+00:00.