rrb-vector: Efficient RRB-Vectors

[ bsd3, data-structures, library ] [ Propose Tags ]

An RRB-Vector is an efficient sequence data structure. It supports fast indexing, iteration, concatenation and splitting.

Comparison with Data.Sequence

Seq a is a container with a very similar API. RRB-Vectors are generally faster for indexing and iteration, while sequences are faster for access to the front/back (amortized \(O(1)\)).


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1.0.0, 0.1.1.0, 0.2.0.0, 0.2.0.1, 0.2.1.0
Change log CHANGELOG.md
Dependencies base (>=4.11 && <5), deepseq (>=1.4.3 && <1.6), indexed-traversable (>=0.1 && <0.2), primitive (>=0.7 && <0.10) [details]
License BSD-3-Clause
Copyright 2021 konsumlamm
Author konsumlamm
Maintainer konsumlamm@gmail.com
Category Data Structures
Home page https://github.com/konsumlamm/rrb-vector
Bug tracker https://github.com/konsumlamm/rrb-vector/issues
Source repo head: git clone https://github.com/konsumlamm/rrb-vector.git
Uploaded by konsumlamm at 2023-12-02T17:03:20Z
Distributions LTSHaskell:0.2.1.0, NixOS:0.2.1.0, Stackage:0.2.1.0
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 552 total (25 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
All reported builds failed as of 2023-12-02 [all 1 reports]

Readme for rrb-vector-0.2.1.0

[back to package description]

rbb-vector

An implementation of a Relaxed Radix Balanced Vector (RRB-Vector), an efficient sequence data structure. It supports fast indexing, iteration, concatenation and splitting.

For more information, see rrb-vector on Hackage.